./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/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/eca-rers2012/Problem01_label02.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.graphml --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 c0f41b7d074691792fd10e7dba36f11652ac022c2313237070654cd8c5fa3312 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:42:46,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:42:46,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:42:46,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:42:46,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:42:46,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:42:46,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:42:46,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:42:46,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:42:46,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:42:46,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:42:46,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:42:46,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:42:46,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:42:46,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:42:46,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:42:46,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:42:46,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:42:46,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:42:46,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:42:46,724 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:42:46,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:42:46,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:42:46,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:42:46,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:42:46,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:42:46,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:42:46,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:42:46,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:42:46,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:42:46,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:42:46,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:42:46,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:42:46,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:42:46,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:42:46,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:42:46,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:42:46,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:42:46,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:42:46,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:42:46,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:42:46,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:42:46,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:42:46,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:42:46,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:42:46,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:42:46,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:42:46,778 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:42:46,778 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:42:46,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:42:46,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:42:46,779 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:42:46,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:42:46,780 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:42:46,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:42:46,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:42:46,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:42:46,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:42:46,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:42:46,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:42:46,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:42:46,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:42:46,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:42:46,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:42:46,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:42:46,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:42:46,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:42:46,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:42:46,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:42:46,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:42:46,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:42:46,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:42:46,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:42:46,783 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:42:46,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:42:46,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:42:46,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> c0f41b7d074691792fd10e7dba36f11652ac022c2313237070654cd8c5fa3312 [2022-07-13 11:42:46,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:42:46,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:42:47,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:42:47,000 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:42:47,001 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:42:47,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2022-07-13 11:42:47,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3397412/0a68e7326b614debb59e44d5cfa117d6/FLAG50f802246 [2022-07-13 11:42:47,499 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:42:47,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2022-07-13 11:42:47,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3397412/0a68e7326b614debb59e44d5cfa117d6/FLAG50f802246 [2022-07-13 11:42:47,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3397412/0a68e7326b614debb59e44d5cfa117d6 [2022-07-13 11:42:47,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:42:47,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:42:47,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:42:47,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:42:47,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:42:47,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:42:47" (1/1) ... [2022-07-13 11:42:47,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4694af0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:47, skipping insertion in model container [2022-07-13 11:42:47,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:42:47" (1/1) ... [2022-07-13 11:42:47,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:42:47,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:42:47,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c[16747,16760] [2022-07-13 11:42:47,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:42:47,921 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:42:47,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label02.c[16747,16760] [2022-07-13 11:42:48,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:42:48,010 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:42:48,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48 WrapperNode [2022-07-13 11:42:48,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:42:48,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:42:48,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:42:48,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:42:48,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,109 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-07-13 11:42:48,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:42:48,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:42:48,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:42:48,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:42:48,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:42:48,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:42:48,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:42:48,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:42:48,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (1/1) ... [2022-07-13 11:42:48,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:42:48,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:42:48,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:42:48,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:42:48,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:42:48,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:42:48,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:42:48,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:42:48,347 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:42:48,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:42:48,966 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:42:48,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:42:48,975 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:42:48,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:42:48 BoogieIcfgContainer [2022-07-13 11:42:48,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:42:48,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:42:48,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:42:48,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:42:49,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:42:47" (1/3) ... [2022-07-13 11:42:49,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355fdae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:42:49, skipping insertion in model container [2022-07-13 11:42:49,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:42:48" (2/3) ... [2022-07-13 11:42:49,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355fdae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:42:49, skipping insertion in model container [2022-07-13 11:42:49,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:42:48" (3/3) ... [2022-07-13 11:42:49,002 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label02.c [2022-07-13 11:42:49,011 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:42:49,011 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:42:49,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:42:49,068 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25bcd52b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73a04654 [2022-07-13 11:42:49,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:42:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 11:42:49,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:49,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:49,086 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:49,089 INFO L85 PathProgramCache]: Analyzing trace with hash -776841673, now seen corresponding path program 1 times [2022-07-13 11:42:49,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:49,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16502031] [2022-07-13 11:42:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:49,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:49,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:49,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16502031] [2022-07-13 11:42:49,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16502031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:49,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:49,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:42:49,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329679881] [2022-07-13 11:42:49,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:49,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:49,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:49,432 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:49,969 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-07-13 11:42:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:49,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-07-13 11:42:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:49,979 INFO L225 Difference]: With dead ends: 528 [2022-07-13 11:42:49,979 INFO L226 Difference]: Without dead ends: 266 [2022-07-13 11:42:49,981 INFO L412 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 [2022-07-13 11:42:49,983 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 98 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:49,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 51 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:42:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-13 11:42:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-13 11:42:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4566037735849056) internal successors, (386), 265 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 386 transitions. [2022-07-13 11:42:50,015 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 386 transitions. Word has length 90 [2022-07-13 11:42:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:50,016 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 386 transitions. [2022-07-13 11:42:50,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 386 transitions. [2022-07-13 11:42:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 11:42:50,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:50,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:50,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:42:50,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:50,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash 904352266, now seen corresponding path program 1 times [2022-07-13 11:42:50,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:50,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098386956] [2022-07-13 11:42:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:50,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:50,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:50,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098386956] [2022-07-13 11:42:50,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098386956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:50,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:50,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:42:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901061007] [2022-07-13 11:42:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:50,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:50,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:50,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:50,056 INFO L87 Difference]: Start difference. First operand 266 states and 386 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:50,351 INFO L93 Difference]: Finished difference Result 792 states and 1153 transitions. [2022-07-13 11:42:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:50,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-07-13 11:42:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:50,355 INFO L225 Difference]: With dead ends: 792 [2022-07-13 11:42:50,355 INFO L226 Difference]: Without dead ends: 528 [2022-07-13 11:42:50,359 INFO L412 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 [2022-07-13 11:42:50,360 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:50,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-07-13 11:42:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-07-13 11:42:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3795066413662238) internal successors, (727), 527 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 727 transitions. [2022-07-13 11:42:50,377 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 727 transitions. Word has length 96 [2022-07-13 11:42:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:50,377 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 727 transitions. [2022-07-13 11:42:50,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 727 transitions. [2022-07-13 11:42:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 11:42:50,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:50,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:50,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:42:50,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:50,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1983827210, now seen corresponding path program 1 times [2022-07-13 11:42:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:50,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499407813] [2022-07-13 11:42:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 11:42:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:50,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499407813] [2022-07-13 11:42:50,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499407813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:50,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:50,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:42:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772938955] [2022-07-13 11:42:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:50,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:50,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:50,453 INFO L87 Difference]: Start difference. First operand 528 states and 727 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:50,755 INFO L93 Difference]: Finished difference Result 1578 states and 2176 transitions. [2022-07-13 11:42:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 97 [2022-07-13 11:42:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:50,758 INFO L225 Difference]: With dead ends: 1578 [2022-07-13 11:42:50,758 INFO L226 Difference]: Without dead ends: 1052 [2022-07-13 11:42:50,759 INFO L412 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 [2022-07-13 11:42:50,759 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 59 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:50,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 31 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-13 11:42:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2022-07-13 11:42:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3768996960486322) internal successors, (906), 658 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 906 transitions. [2022-07-13 11:42:50,771 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 906 transitions. Word has length 97 [2022-07-13 11:42:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:50,771 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 906 transitions. [2022-07-13 11:42:50,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 906 transitions. [2022-07-13 11:42:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 11:42:50,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:50,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:50,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:42:50,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -963864069, now seen corresponding path program 1 times [2022-07-13 11:42:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:50,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320279211] [2022-07-13 11:42:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:50,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320279211] [2022-07-13 11:42:50,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320279211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:50,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:50,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:42:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9137990] [2022-07-13 11:42:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:50,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:50,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:50,814 INFO L87 Difference]: Start difference. First operand 659 states and 906 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:51,103 INFO L93 Difference]: Finished difference Result 1578 states and 2156 transitions. [2022-07-13 11:42:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:51,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-07-13 11:42:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:51,106 INFO L225 Difference]: With dead ends: 1578 [2022-07-13 11:42:51,106 INFO L226 Difference]: Without dead ends: 921 [2022-07-13 11:42:51,107 INFO L412 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 [2022-07-13 11:42:51,107 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:51,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 55 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-07-13 11:42:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-07-13 11:42:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.308695652173913) internal successors, (1204), 920 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1204 transitions. [2022-07-13 11:42:51,122 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1204 transitions. Word has length 103 [2022-07-13 11:42:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:51,122 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1204 transitions. [2022-07-13 11:42:51,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1204 transitions. [2022-07-13 11:42:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 11:42:51,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:51,125 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:51,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:42:51,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:51,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash -887722715, now seen corresponding path program 1 times [2022-07-13 11:42:51,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:51,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811036556] [2022-07-13 11:42:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:42:51,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811036556] [2022-07-13 11:42:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811036556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:51,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:51,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:42:51,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716023839] [2022-07-13 11:42:51,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:51,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:51,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:51,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:51,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:51,161 INFO L87 Difference]: Start difference. First operand 921 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:51,459 INFO L93 Difference]: Finished difference Result 2364 states and 3056 transitions. [2022-07-13 11:42:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:51,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 116 [2022-07-13 11:42:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:51,463 INFO L225 Difference]: With dead ends: 2364 [2022-07-13 11:42:51,464 INFO L226 Difference]: Without dead ends: 1445 [2022-07-13 11:42:51,465 INFO L412 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 [2022-07-13 11:42:51,466 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:51,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 47 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-07-13 11:42:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2022-07-13 11:42:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2859560067681894) internal successors, (1520), 1182 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1520 transitions. [2022-07-13 11:42:51,485 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1520 transitions. Word has length 116 [2022-07-13 11:42:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:51,485 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1520 transitions. [2022-07-13 11:42:51,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1520 transitions. [2022-07-13 11:42:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 11:42:51,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:51,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:51,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:42:51,488 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2095190628, now seen corresponding path program 1 times [2022-07-13 11:42:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:51,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586114420] [2022-07-13 11:42:51,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:42:51,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:51,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586114420] [2022-07-13 11:42:51,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586114420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:51,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:51,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:42:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948562258] [2022-07-13 11:42:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:51,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:51,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:51,542 INFO L87 Difference]: Start difference. First operand 1183 states and 1520 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:51,809 INFO L93 Difference]: Finished difference Result 2495 states and 3205 transitions. [2022-07-13 11:42:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:51,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 118 [2022-07-13 11:42:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:51,813 INFO L225 Difference]: With dead ends: 2495 [2022-07-13 11:42:51,813 INFO L226 Difference]: Without dead ends: 1314 [2022-07-13 11:42:51,814 INFO L412 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 [2022-07-13 11:42:51,817 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:51,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 74 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:42:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-07-13 11:42:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2022-07-13 11:42:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2711348057882712) internal successors, (1669), 1313 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1669 transitions. [2022-07-13 11:42:51,845 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1669 transitions. Word has length 118 [2022-07-13 11:42:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:51,845 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1669 transitions. [2022-07-13 11:42:51,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1669 transitions. [2022-07-13 11:42:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 11:42:51,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:51,847 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:51,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:42:51,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:51,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1811589588, now seen corresponding path program 1 times [2022-07-13 11:42:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:51,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906611329] [2022-07-13 11:42:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:51,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 11:42:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:51,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906611329] [2022-07-13 11:42:51,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906611329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:51,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:51,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:42:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92898126] [2022-07-13 11:42:51,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:51,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:42:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:42:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:51,911 INFO L87 Difference]: Start difference. First operand 1314 states and 1669 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:52,333 INFO L93 Difference]: Finished difference Result 3019 states and 3777 transitions. [2022-07-13 11:42:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:42:52,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 122 [2022-07-13 11:42:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:52,338 INFO L225 Difference]: With dead ends: 3019 [2022-07-13 11:42:52,338 INFO L226 Difference]: Without dead ends: 1707 [2022-07-13 11:42:52,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:42:52,340 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 386 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:52,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 71 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:42:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-07-13 11:42:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2022-07-13 11:42:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2412698412698413) internal successors, (1955), 1575 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1955 transitions. [2022-07-13 11:42:52,361 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1955 transitions. Word has length 122 [2022-07-13 11:42:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:52,361 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 1955 transitions. [2022-07-13 11:42:52,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1955 transitions. [2022-07-13 11:42:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 11:42:52,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:52,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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] [2022-07-13 11:42:52,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:42:52,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 650221427, now seen corresponding path program 1 times [2022-07-13 11:42:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:52,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313240345] [2022-07-13 11:42:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:52,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:52,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313240345] [2022-07-13 11:42:52,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313240345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:42:52,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289516925] [2022-07-13 11:42:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:52,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:52,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:42:52,415 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) [2022-07-13 11:42:52,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:42:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:52,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:42:52,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 11:42:52,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:52,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289516925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:52,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:42:52,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-07-13 11:42:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118174578] [2022-07-13 11:42:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:52,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:52,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:52,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:52,599 INFO L87 Difference]: Start difference. First operand 1576 states and 1955 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:52,884 INFO L93 Difference]: Finished difference Result 3674 states and 4578 transitions. [2022-07-13 11:42:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:52,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 140 [2022-07-13 11:42:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:52,889 INFO L225 Difference]: With dead ends: 3674 [2022-07-13 11:42:52,889 INFO L226 Difference]: Without dead ends: 2100 [2022-07-13 11:42:52,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:52,891 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 66 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:52,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 31 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-07-13 11:42:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2022-07-13 11:42:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.217479674796748) internal successors, (2396), 1968 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2396 transitions. [2022-07-13 11:42:52,913 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2396 transitions. Word has length 140 [2022-07-13 11:42:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:52,914 INFO L495 AbstractCegarLoop]: Abstraction has 1969 states and 2396 transitions. [2022-07-13 11:42:52,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2396 transitions. [2022-07-13 11:42:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-13 11:42:52,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:52,916 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:52,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:53,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:53,133 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:53,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1361137988, now seen corresponding path program 1 times [2022-07-13 11:42:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:53,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315034628] [2022-07-13 11:42:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 82 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 11:42:53,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:53,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315034628] [2022-07-13 11:42:53,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315034628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:42:53,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606536731] [2022-07-13 11:42:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:53,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:53,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:42:53,179 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) [2022-07-13 11:42:53,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:42:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:53,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:42:53,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 11:42:53,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:53,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606536731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:53,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:42:53,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-07-13 11:42:53,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697401597] [2022-07-13 11:42:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:53,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:53,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:53,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:53,380 INFO L87 Difference]: Start difference. First operand 1969 states and 2396 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:53,685 INFO L93 Difference]: Finished difference Result 4460 states and 5459 transitions. [2022-07-13 11:42:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:53,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 163 [2022-07-13 11:42:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:53,692 INFO L225 Difference]: With dead ends: 4460 [2022-07-13 11:42:53,692 INFO L226 Difference]: Without dead ends: 2493 [2022-07-13 11:42:53,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:42:53,696 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:53,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 193 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-07-13 11:42:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2231. [2022-07-13 11:42:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.2080717488789237) internal successors, (2694), 2230 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2694 transitions. [2022-07-13 11:42:53,728 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2694 transitions. Word has length 163 [2022-07-13 11:42:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:53,728 INFO L495 AbstractCegarLoop]: Abstraction has 2231 states and 2694 transitions. [2022-07-13 11:42:53,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2694 transitions. [2022-07-13 11:42:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-13 11:42:53,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:53,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:42:53,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:53,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-13 11:42:53,938 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:53,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:53,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1645727001, now seen corresponding path program 1 times [2022-07-13 11:42:53,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:53,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643293031] [2022-07-13 11:42:53,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:53,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 11:42:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643293031] [2022-07-13 11:42:53,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643293031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:53,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:53,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:42:53,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988704259] [2022-07-13 11:42:53,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:53,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:53,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:53,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:53,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:53,993 INFO L87 Difference]: Start difference. First operand 2231 states and 2694 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:54,298 INFO L93 Difference]: Finished difference Result 4591 states and 5560 transitions. [2022-07-13 11:42:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:54,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 176 [2022-07-13 11:42:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:54,304 INFO L225 Difference]: With dead ends: 4591 [2022-07-13 11:42:54,319 INFO L226 Difference]: Without dead ends: 2362 [2022-07-13 11:42:54,321 INFO L412 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 [2022-07-13 11:42:54,322 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 94 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:54,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 60 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-07-13 11:42:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-07-13 11:42:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.1994917407878019) internal successors, (2832), 2361 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2832 transitions. [2022-07-13 11:42:54,371 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2832 transitions. Word has length 176 [2022-07-13 11:42:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:54,371 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 2832 transitions. [2022-07-13 11:42:54,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2832 transitions. [2022-07-13 11:42:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-13 11:42:54,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:54,375 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:42:54,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:42:54,375 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:54,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -836738982, now seen corresponding path program 1 times [2022-07-13 11:42:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:54,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060581830] [2022-07-13 11:42:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:42:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060581830] [2022-07-13 11:42:54,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060581830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:42:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286192960] [2022-07-13 11:42:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:54,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:54,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:42:54,512 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) [2022-07-13 11:42:54,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:42:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:54,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:42:54,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-13 11:42:54,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:54,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286192960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:54,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:42:54,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-13 11:42:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843276054] [2022-07-13 11:42:54,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:54,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:54,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:54,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:42:54,666 INFO L87 Difference]: Start difference. First operand 2362 states and 2832 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:54,962 INFO L93 Difference]: Finished difference Result 6032 states and 7225 transitions. [2022-07-13 11:42:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 189 [2022-07-13 11:42:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:54,972 INFO L225 Difference]: With dead ends: 6032 [2022-07-13 11:42:54,973 INFO L226 Difference]: Without dead ends: 3672 [2022-07-13 11:42:54,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:42:54,977 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 67 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:54,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 31 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2022-07-13 11:42:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3410. [2022-07-13 11:42:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 3409 states have (on average 1.188911704312115) internal successors, (4053), 3409 states have internal predecessors, (4053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 4053 transitions. [2022-07-13 11:42:55,021 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 4053 transitions. Word has length 189 [2022-07-13 11:42:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:55,022 INFO L495 AbstractCegarLoop]: Abstraction has 3410 states and 4053 transitions. [2022-07-13 11:42:55,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 4053 transitions. [2022-07-13 11:42:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-13 11:42:55,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:55,026 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:42:55,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:55,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:55,243 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:55,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash 347086668, now seen corresponding path program 1 times [2022-07-13 11:42:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:55,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817552965] [2022-07-13 11:42:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-13 11:42:55,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:55,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817552965] [2022-07-13 11:42:55,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817552965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:55,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:42:55,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:42:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208636829] [2022-07-13 11:42:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:55,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:55,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:55,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:55,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:42:55,278 INFO L87 Difference]: Start difference. First operand 3410 states and 4053 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:55,577 INFO L93 Difference]: Finished difference Result 7211 states and 8563 transitions. [2022-07-13 11:42:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:55,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 201 [2022-07-13 11:42:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:55,585 INFO L225 Difference]: With dead ends: 7211 [2022-07-13 11:42:55,585 INFO L226 Difference]: Without dead ends: 3410 [2022-07-13 11:42:55,589 INFO L412 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 [2022-07-13 11:42:55,590 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 137 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:55,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 191 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2022-07-13 11:42:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3148. [2022-07-13 11:42:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.1035907213218938) internal successors, (3473), 3147 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3473 transitions. [2022-07-13 11:42:55,627 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3473 transitions. Word has length 201 [2022-07-13 11:42:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:55,627 INFO L495 AbstractCegarLoop]: Abstraction has 3148 states and 3473 transitions. [2022-07-13 11:42:55,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3473 transitions. [2022-07-13 11:42:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-13 11:42:55,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:55,633 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:42:55,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:42:55,634 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 901044654, now seen corresponding path program 1 times [2022-07-13 11:42:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176597956] [2022-07-13 11:42:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:55,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 161 proven. 6 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 11:42:55,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:55,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176597956] [2022-07-13 11:42:55,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176597956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:42:55,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655786554] [2022-07-13 11:42:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:55,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:55,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:42:55,688 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) [2022-07-13 11:42:55,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:42:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:55,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:42:55,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-13 11:42:55,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:55,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655786554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:55,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:42:55,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 11:42:55,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662737705] [2022-07-13 11:42:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:55,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:55,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:55,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:55,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:42:55,898 INFO L87 Difference]: Start difference. First operand 3148 states and 3473 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:56,182 INFO L93 Difference]: Finished difference Result 6687 states and 7401 transitions. [2022-07-13 11:42:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:56,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 221 [2022-07-13 11:42:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:56,190 INFO L225 Difference]: With dead ends: 6687 [2022-07-13 11:42:56,190 INFO L226 Difference]: Without dead ends: 3541 [2022-07-13 11:42:56,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:42:56,193 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 55 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:56,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 169 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:42:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2022-07-13 11:42:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3410. [2022-07-13 11:42:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 3409 states have (on average 1.0903490759753593) internal successors, (3717), 3409 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 3717 transitions. [2022-07-13 11:42:56,232 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 3717 transitions. Word has length 221 [2022-07-13 11:42:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:56,232 INFO L495 AbstractCegarLoop]: Abstraction has 3410 states and 3717 transitions. [2022-07-13 11:42:56,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 3717 transitions. [2022-07-13 11:42:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-07-13 11:42:56,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:56,237 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:42:56,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:56,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:56,455 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:56,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:56,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1726679257, now seen corresponding path program 1 times [2022-07-13 11:42:56,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:56,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929560602] [2022-07-13 11:42:56,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:56,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 228 proven. 6 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-07-13 11:42:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:56,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929560602] [2022-07-13 11:42:56,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929560602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:42:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645272435] [2022-07-13 11:42:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:56,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:56,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:42:56,512 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) [2022-07-13 11:42:56,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:42:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:56,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:42:56,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-07-13 11:42:56,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:56,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645272435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:56,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:42:56,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 11:42:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318201395] [2022-07-13 11:42:56,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:56,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:56,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:42:56,679 INFO L87 Difference]: Start difference. First operand 3410 states and 3717 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:56,932 INFO L93 Difference]: Finished difference Result 7080 states and 7718 transitions. [2022-07-13 11:42:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:56,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 260 [2022-07-13 11:42:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:56,941 INFO L225 Difference]: With dead ends: 7080 [2022-07-13 11:42:56,941 INFO L226 Difference]: Without dead ends: 3541 [2022-07-13 11:42:56,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:42:56,945 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 109 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:56,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 175 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:42:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2022-07-13 11:42:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3410. [2022-07-13 11:42:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 3409 states have (on average 1.0765620416544441) internal successors, (3670), 3409 states have internal predecessors, (3670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 3670 transitions. [2022-07-13 11:42:56,981 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 3670 transitions. Word has length 260 [2022-07-13 11:42:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:56,981 INFO L495 AbstractCegarLoop]: Abstraction has 3410 states and 3670 transitions. [2022-07-13 11:42:56,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 3670 transitions. [2022-07-13 11:42:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-07-13 11:42:56,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:42:56,987 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 11:42:57,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:57,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 11:42:57,204 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:42:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:42:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1381679681, now seen corresponding path program 1 times [2022-07-13 11:42:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:42:57,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284547558] [2022-07-13 11:42:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:42:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 233 proven. 6 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-13 11:42:57,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:42:57,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284547558] [2022-07-13 11:42:57,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284547558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:42:57,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485951594] [2022-07-13 11:42:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:42:57,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:42:57,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:42:57,278 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) [2022-07-13 11:42:57,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:42:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:42:57,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:42:57,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:42:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2022-07-13 11:42:57,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:42:57,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485951594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:42:57,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:42:57,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 11:42:57,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103254021] [2022-07-13 11:42:57,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:42:57,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:42:57,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:42:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:42:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:42:57,416 INFO L87 Difference]: Start difference. First operand 3410 states and 3670 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:42:57,675 INFO L93 Difference]: Finished difference Result 6816 states and 7332 transitions. [2022-07-13 11:42:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:42:57,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 265 [2022-07-13 11:42:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:42:57,676 INFO L225 Difference]: With dead ends: 6816 [2022-07-13 11:42:57,676 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 11:42:57,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:42:57,680 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:42:57,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 179 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:42:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 11:42:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 11:42:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 11:42:57,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2022-07-13 11:42:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:42:57,682 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 11:42:57,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:42:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 11:42:57,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 11:42:57,684 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:42:57,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:42:57,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 11:42:57,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 11:42:58,583 INFO L899 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-07-13 11:42:58,583 INFO L899 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-07-13 11:42:58,583 INFO L899 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,584 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,585 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,586 INFO L899 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-07-13 11:42:58,587 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-07-13 11:42:58,588 INFO L899 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-07-13 11:42:58,589 INFO L899 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-07-13 11:42:58,590 INFO L899 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-07-13 11:42:58,590 INFO L899 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-07-13 11:42:58,590 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-07-13 11:42:58,591 INFO L895 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse2 (<= ~a16~0 4)) (.cse6 (<= ~a20~0 0)) (.cse7 (<= 14 ~a8~0)) (.cse4 (= ~a21~0 1)) (.cse0 (<= ~a8~0 13)) (.cse5 (<= ~a21~0 0)) (.cse1 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ~a7~0 0) .cse4 .cse3) (and .cse4 .cse1 .cse3) (and .cse0 (or (and .cse5 .cse3) (and .cse5 .cse1)) .cse2) (and .cse0 (<= 6 ~a16~0) .cse3) (and .cse6 .cse2) (and .cse6 .cse7) (and .cse7 .cse4 .cse3) (and .cse0 .cse5 .cse1 .cse3))) [2022-07-13 11:42:58,591 INFO L899 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,591 INFO L899 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,591 INFO L899 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,591 INFO L899 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,591 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,591 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-07-13 11:42:58,592 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-07-13 11:42:58,593 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-07-13 11:42:58,593 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-07-13 11:42:58,593 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 11:42:58,593 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-07-13 11:42:58,593 INFO L902 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-07-13 11:42:58,593 INFO L899 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,593 INFO L899 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,593 INFO L899 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,593 INFO L899 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-07-13 11:42:58,594 INFO L899 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,595 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-07-13 11:42:58,596 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-07-13 11:42:58,597 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-07-13 11:42:58,597 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-07-13 11:42:58,597 INFO L899 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,597 INFO L895 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse2 (<= ~a16~0 4)) (.cse6 (<= ~a20~0 0)) (.cse7 (<= 14 ~a8~0)) (.cse4 (= ~a21~0 1)) (.cse0 (<= ~a8~0 13)) (.cse5 (<= ~a21~0 0)) (.cse1 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ~a7~0 0) .cse4 .cse3) (and .cse4 .cse1 .cse3) (and .cse0 (or (and .cse5 .cse3) (and .cse5 .cse1)) .cse2) (and .cse0 (<= 6 ~a16~0) .cse3) (and .cse6 .cse2) (and .cse6 .cse7) (and .cse7 .cse4 .cse3) (and .cse0 .cse5 .cse1 .cse3))) [2022-07-13 11:42:58,597 INFO L899 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,597 INFO L899 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,597 INFO L899 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,597 INFO L899 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 456) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-07-13 11:42:58,598 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-07-13 11:42:58,599 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-07-13 11:42:58,600 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-07-13 11:42:58,602 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:42:58,604 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:42:58,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:42:58 BoogieIcfgContainer [2022-07-13 11:42:58,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:42:58,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:42:58,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:42:58,616 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:42:58,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:42:48" (3/4) ... [2022-07-13 11:42:58,619 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 11:42:58,629 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-13 11:42:58,630 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 11:42:58,631 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 11:42:58,631 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 11:42:58,698 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:42:58,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:42:58,699 INFO L158 Benchmark]: Toolchain (without parser) took 11164.04ms. Allocated memory was 92.3MB in the beginning and 226.5MB in the end (delta: 134.2MB). Free memory was 61.3MB in the beginning and 166.8MB in the end (delta: -105.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-13 11:42:58,699 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:42:58,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.08ms. Allocated memory is still 92.3MB. Free memory was 61.0MB in the beginning and 52.0MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:42:58,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.90ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 52.0MB in the beginning and 94.4MB in the end (delta: -42.4MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-13 11:42:58,700 INFO L158 Benchmark]: Boogie Preprocessor took 68.16ms. Allocated memory is still 119.5MB. Free memory was 94.4MB in the beginning and 90.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:42:58,700 INFO L158 Benchmark]: RCFGBuilder took 798.26ms. Allocated memory is still 119.5MB. Free memory was 90.3MB in the beginning and 36.8MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-07-13 11:42:58,700 INFO L158 Benchmark]: TraceAbstraction took 9619.61ms. Allocated memory was 119.5MB in the beginning and 226.5MB in the end (delta: 107.0MB). Free memory was 90.1MB in the beginning and 177.2MB in the end (delta: -87.2MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2022-07-13 11:42:58,700 INFO L158 Benchmark]: Witness Printer took 82.32ms. Allocated memory is still 226.5MB. Free memory was 177.2MB in the beginning and 166.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 11:42:58,704 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.08ms. Allocated memory is still 92.3MB. Free memory was 61.0MB in the beginning and 52.0MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.90ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 52.0MB in the beginning and 94.4MB in the end (delta: -42.4MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.16ms. Allocated memory is still 119.5MB. Free memory was 94.4MB in the beginning and 90.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 798.26ms. Allocated memory is still 119.5MB. Free memory was 90.3MB in the beginning and 36.8MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9619.61ms. Allocated memory was 119.5MB in the beginning and 226.5MB in the end (delta: 107.0MB). Free memory was 90.1MB in the beginning and 177.2MB in the end (delta: -87.2MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. * Witness Printer took 82.32ms. Allocated memory is still 226.5MB. Free memory was 177.2MB in the beginning and 166.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 456]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 15, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1762 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1762 mSDsluCounter, 1394 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 806 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5158 IncrementalHoareTripleChecker+Invalid, 5964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 806 mSolverCounterUnsat, 1313 mSDtfsCounter, 5158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1276 GetRequests, 1243 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3410occurred in iteration=11, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 1965 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 67 NumberOfFragments, 207 HoareAnnotationTreeSize, 3 FomulaSimplifications, 290 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4816 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 3595 NumberOfCodeBlocks, 3595 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3574 ConstructedInterpolants, 0 QuantifiedInterpolants, 8729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2510 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 3337/3426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: ((((((((((a8 <= 13 && a17 == 1) && a16 <= 4) && a20 == 1) || ((a7 <= 0 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a17 == 1) && a20 == 1)) || ((a8 <= 13 && ((a21 <= 0 && a20 == 1) || (a21 <= 0 && a17 == 1))) && a16 <= 4)) || ((a8 <= 13 && 6 <= a16) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || (a20 <= 0 && 14 <= a8)) || ((14 <= a8 && a21 == 1) && a20 == 1)) || (((a8 <= 13 && a21 <= 0) && a17 == 1) && a20 == 1) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((a8 <= 13 && a17 == 1) && a16 <= 4) && a20 == 1) || ((a7 <= 0 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a17 == 1) && a20 == 1)) || ((a8 <= 13 && ((a21 <= 0 && a20 == 1) || (a21 <= 0 && a17 == 1))) && a16 <= 4)) || ((a8 <= 13 && 6 <= a16) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || (a20 <= 0 && 14 <= a8)) || ((14 <= a8 && a21 == 1) && a20 == 1)) || (((a8 <= 13 && a21 <= 0) && a17 == 1) && a20 == 1) RESULT: Ultimate proved your program to be correct! [2022-07-13 11:42:58,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE