./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:54:10,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:54:10,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:54:10,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:54:10,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:54:10,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:54:10,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:54:10,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:54:10,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:54:10,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:54:10,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:54:10,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:54:10,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:54:10,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:54:10,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:54:10,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:54:10,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:54:10,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:54:10,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:54:10,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:54:10,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:54:10,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:54:10,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:54:10,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:54:10,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:54:10,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:54:10,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:54:10,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:54:10,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:54:10,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:54:10,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:54:10,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:54:10,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:54:10,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:54:10,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:54:10,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:54:10,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:54:10,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:54:10,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:54:10,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:54:10,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:54:10,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:54:10,673 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:54:10,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:54:10,673 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:54:10,674 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:54:10,674 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:54:10,674 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:54:10,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:54:10,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:54:10,675 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:54:10,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:54:10,676 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:54:10,676 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:54:10,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:54:10,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:54:10,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:54:10,677 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:54:10,677 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:54:10,677 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:54:10,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:54:10,678 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:54:10,678 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:54:10,678 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:54:10,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:54:10,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:54:10,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:54:10,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:54:10,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:54:10,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:54:10,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:54:10,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:54:10,680 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:54:10,680 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2021-12-14 19:54:10,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:54:10,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:54:10,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:54:10,867 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:54:10,868 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:54:10,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2021-12-14 19:54:10,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda4646ca/9e2174d29d1e44ce9418a2fe7406db34/FLAG29055bb76 [2021-12-14 19:54:11,264 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:54:11,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2021-12-14 19:54:11,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda4646ca/9e2174d29d1e44ce9418a2fe7406db34/FLAG29055bb76 [2021-12-14 19:54:11,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda4646ca/9e2174d29d1e44ce9418a2fe7406db34 [2021-12-14 19:54:11,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:54:11,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:54:11,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:54:11,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:54:11,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:54:11,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d7edc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11, skipping insertion in model container [2021-12-14 19:54:11,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:54:11,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:54:11,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:54:11,881 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:54:11,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:54:11,916 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:54:11,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11 WrapperNode [2021-12-14 19:54:11,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:54:11,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:54:11,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:54:11,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:54:11,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,957 INFO L137 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2021-12-14 19:54:11,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:54:11,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:54:11,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:54:11,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:54:11,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:54:11,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:54:11,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:54:11,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:54:11,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (1/1) ... [2021-12-14 19:54:11,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:54:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:12,013 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) [2021-12-14 19:54:12,025 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 [2021-12-14 19:54:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:54:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:54:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:54:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:54:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:54:12,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:54:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:54:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:54:12,142 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:54:12,144 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:54:12,327 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:54:12,331 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:54:12,331 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-14 19:54:12,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:54:12 BoogieIcfgContainer [2021-12-14 19:54:12,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:54:12,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:54:12,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:54:12,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:54:12,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:54:11" (1/3) ... [2021-12-14 19:54:12,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c051537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:54:12, skipping insertion in model container [2021-12-14 19:54:12,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:54:11" (2/3) ... [2021-12-14 19:54:12,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c051537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:54:12, skipping insertion in model container [2021-12-14 19:54:12,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:54:12" (3/3) ... [2021-12-14 19:54:12,338 INFO L111 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2021-12-14 19:54:12,341 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:54:12,342 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-12-14 19:54:12,378 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:54:12,384 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:54:12,385 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-12-14 19:54:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:54:12,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:12,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:54:12,411 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-14 19:54:12,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:12,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412401925] [2021-12-14 19:54:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:12,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:12,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:12,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412401925] [2021-12-14 19:54:12,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412401925] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:12,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:54:12,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-14 19:54:12,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657253465] [2021-12-14 19:54:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:12,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:54:12,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:12,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:54:12,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:54:12,590 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 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, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:12,644 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-12-14 19:54:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:54:12,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-14 19:54:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:12,651 INFO L225 Difference]: With dead ends: 52 [2021-12-14 19:54:12,651 INFO L226 Difference]: Without dead ends: 50 [2021-12-14 19:54:12,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:54:12,654 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:12,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-14 19:54:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-14 19:54:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.588235294117647) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-14 19:54:12,681 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 4 [2021-12-14 19:54:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:12,682 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-14 19:54:12,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-14 19:54:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:54:12,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:12,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:54:12,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:54:12,683 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2021-12-14 19:54:12,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:12,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677301479] [2021-12-14 19:54:12,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:12,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:12,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:12,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677301479] [2021-12-14 19:54:12,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677301479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:12,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:54:12,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:54:12,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373336939] [2021-12-14 19:54:12,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:12,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:54:12,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:12,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:54:12,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:54:12,791 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:12,849 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-14 19:54:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:54:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-14 19:54:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:12,851 INFO L225 Difference]: With dead ends: 53 [2021-12-14 19:54:12,851 INFO L226 Difference]: Without dead ends: 53 [2021-12-14 19:54:12,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:54:12,854 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:12,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-14 19:54:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-12-14 19:54:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-12-14 19:54:12,866 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 4 [2021-12-14 19:54:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:12,866 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-12-14 19:54:12,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-12-14 19:54:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:54:12,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:12,867 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-12-14 19:54:12,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:54:12,870 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2021-12-14 19:54:12,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:12,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133429258] [2021-12-14 19:54:12,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:12,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:12,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:12,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133429258] [2021-12-14 19:54:12,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133429258] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:12,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621845697] [2021-12-14 19:54:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:12,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:12,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:12,982 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) [2021-12-14 19:54:12,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:54:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:13,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:54:13,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:13,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:13,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621845697] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:13,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:13,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2021-12-14 19:54:13,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710154758] [2021-12-14 19:54:13,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:13,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:54:13,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:54:13,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:54:13,266 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:13,448 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2021-12-14 19:54:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:54:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 7 [2021-12-14 19:54:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:13,449 INFO L225 Difference]: With dead ends: 59 [2021-12-14 19:54:13,449 INFO L226 Difference]: Without dead ends: 59 [2021-12-14 19:54:13,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:54:13,450 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 179 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:13,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 126 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:54:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-14 19:54:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-14 19:54:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-12-14 19:54:13,454 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 7 [2021-12-14 19:54:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:13,454 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-12-14 19:54:13,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-12-14 19:54:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:54:13,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:13,455 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:13,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 19:54:13,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:13,660 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2021-12-14 19:54:13,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:13,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426062224] [2021-12-14 19:54:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:13,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:13,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:13,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426062224] [2021-12-14 19:54:13,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426062224] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:13,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93673370] [2021-12-14 19:54:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:13,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:13,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:13,738 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) [2021-12-14 19:54:13,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:54:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:13,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:54:13,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:13,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:13,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93673370] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:13,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:13,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-14 19:54:13,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193418785] [2021-12-14 19:54:13,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:13,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 19:54:13,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:13,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 19:54:13,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:54:13,919 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:13,972 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-12-14 19:54:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:54:13,973 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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 19 [2021-12-14 19:54:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:13,973 INFO L225 Difference]: With dead ends: 77 [2021-12-14 19:54:13,973 INFO L226 Difference]: Without dead ends: 77 [2021-12-14 19:54:13,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:54:13,974 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:13,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 290 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-14 19:54:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-14 19:54:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2021-12-14 19:54:13,978 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2021-12-14 19:54:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:13,978 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2021-12-14 19:54:13,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2021-12-14 19:54:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:54:13,979 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:13,979 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:14,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:14,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-14 19:54:14,196 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:14,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:14,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2021-12-14 19:54:14,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:14,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425535960] [2021-12-14 19:54:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:14,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:14,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:14,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425535960] [2021-12-14 19:54:14,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425535960] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:14,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174190683] [2021-12-14 19:54:14,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:54:14,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:14,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:14,448 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) [2021-12-14 19:54:14,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:54:14,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 19:54:14,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:54:14,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 19:54:14,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:14,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:54:14,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174190683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:14,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:54:14,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 17 [2021-12-14 19:54:14,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815842888] [2021-12-14 19:54:14,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:14,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:54:14,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:14,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:54:14,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-12-14 19:54:14,749 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:14,812 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-12-14 19:54:14,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:54:14,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 37 [2021-12-14 19:54:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:14,813 INFO L225 Difference]: With dead ends: 85 [2021-12-14 19:54:14,813 INFO L226 Difference]: Without dead ends: 85 [2021-12-14 19:54:14,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-12-14 19:54:14,814 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 111 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:14,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 64 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-14 19:54:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2021-12-14 19:54:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-12-14 19:54:14,821 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2021-12-14 19:54:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:14,821 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-12-14 19:54:14,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-12-14 19:54:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:54:14,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:14,822 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:14,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:15,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:15,023 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2021-12-14 19:54:15,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:15,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821453277] [2021-12-14 19:54:15,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:15,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-14 19:54:15,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:15,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821453277] [2021-12-14 19:54:15,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821453277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:15,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:54:15,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:54:15,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007642777] [2021-12-14 19:54:15,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:15,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:54:15,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:54:15,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:54:15,095 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:15,153 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-12-14 19:54:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:54:15,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 37 [2021-12-14 19:54:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:15,164 INFO L225 Difference]: With dead ends: 78 [2021-12-14 19:54:15,164 INFO L226 Difference]: Without dead ends: 78 [2021-12-14 19:54:15,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:54:15,166 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:15,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-14 19:54:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-14 19:54:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-12-14 19:54:15,181 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2021-12-14 19:54:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:15,182 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-12-14 19:54:15,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-12-14 19:54:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:54:15,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:15,183 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:15,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:54:15,183 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2021-12-14 19:54:15,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:15,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119527663] [2021-12-14 19:54:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:15,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:15,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:15,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119527663] [2021-12-14 19:54:15,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119527663] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:15,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:54:15,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-14 19:54:15,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319711815] [2021-12-14 19:54:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:15,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:54:15,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:54:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:54:15,277 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:15,292 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-12-14 19:54:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:54:15,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 38 [2021-12-14 19:54:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:15,294 INFO L225 Difference]: With dead ends: 77 [2021-12-14 19:54:15,294 INFO L226 Difference]: Without dead ends: 77 [2021-12-14 19:54:15,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:54:15,295 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:15,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-14 19:54:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-14 19:54:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.265625) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2021-12-14 19:54:15,302 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 38 [2021-12-14 19:54:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:15,303 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2021-12-14 19:54:15,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2021-12-14 19:54:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:54:15,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:15,305 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:15,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:54:15,305 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:15,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2021-12-14 19:54:15,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:15,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77481382] [2021-12-14 19:54:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:15,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:15,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:15,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77481382] [2021-12-14 19:54:15,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77481382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:15,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:54:15,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:54:15,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776558502] [2021-12-14 19:54:15,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:15,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:54:15,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:15,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:54:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:54:15,422 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:15,449 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-12-14 19:54:15,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:54:15,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 38 [2021-12-14 19:54:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:15,453 INFO L225 Difference]: With dead ends: 80 [2021-12-14 19:54:15,453 INFO L226 Difference]: Without dead ends: 80 [2021-12-14 19:54:15,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:54:15,456 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:15,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 60 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-14 19:54:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2021-12-14 19:54:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-12-14 19:54:15,466 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2021-12-14 19:54:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:15,466 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-12-14 19:54:15,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-12-14 19:54:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:54:15,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:15,469 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:15,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:54:15,469 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2021-12-14 19:54:15,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:15,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696020141] [2021-12-14 19:54:15,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:15,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 100 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:15,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:15,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696020141] [2021-12-14 19:54:15,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696020141] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:15,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522380467] [2021-12-14 19:54:15,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:15,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:15,644 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) [2021-12-14 19:54:15,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:54:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:15,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-14 19:54:15,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:15,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:16,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522380467] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:16,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:16,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4, 4] total 23 [2021-12-14 19:54:16,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4687575] [2021-12-14 19:54:16,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:16,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-14 19:54:16,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:16,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 19:54:16,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2021-12-14 19:54:16,163 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:16,574 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-12-14 19:54:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:54:16,575 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 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 42 [2021-12-14 19:54:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:16,576 INFO L225 Difference]: With dead ends: 98 [2021-12-14 19:54:16,576 INFO L226 Difference]: Without dead ends: 98 [2021-12-14 19:54:16,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=408, Invalid=1152, Unknown=0, NotChecked=0, Total=1560 [2021-12-14 19:54:16,577 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 471 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:16,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 155 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:54:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-14 19:54:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2021-12-14 19:54:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2021-12-14 19:54:16,579 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 42 [2021-12-14 19:54:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:16,580 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2021-12-14 19:54:16,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2021-12-14 19:54:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 19:54:16,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:16,580 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:16,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:16,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:16,791 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2021-12-14 19:54:16,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:16,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925159271] [2021-12-14 19:54:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:16,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:16,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:16,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925159271] [2021-12-14 19:54:16,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925159271] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:16,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617570783] [2021-12-14 19:54:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:16,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:16,866 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) [2021-12-14 19:54:16,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:54:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:16,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:54:16,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:17,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:17,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617570783] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:17,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:17,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2021-12-14 19:54:17,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022299410] [2021-12-14 19:54:17,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:17,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:54:17,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:54:17,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:54:17,338 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:17,422 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2021-12-14 19:54:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:54:17,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-14 19:54:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:17,423 INFO L225 Difference]: With dead ends: 93 [2021-12-14 19:54:17,423 INFO L226 Difference]: Without dead ends: 93 [2021-12-14 19:54:17,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:54:17,424 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:17,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 92 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:54:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-14 19:54:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-14 19:54:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.2125) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2021-12-14 19:54:17,427 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 43 [2021-12-14 19:54:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:17,428 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2021-12-14 19:54:17,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2021-12-14 19:54:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 19:54:17,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:17,429 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:17,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:17,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 19:54:17,639 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2021-12-14 19:54:17,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:17,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249987836] [2021-12-14 19:54:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:17,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 100 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:54:17,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:17,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249987836] [2021-12-14 19:54:17,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249987836] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:17,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130271652] [2021-12-14 19:54:17,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:54:17,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:17,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:17,890 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) [2021-12-14 19:54:17,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:54:17,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:54:17,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:54:17,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-14 19:54:17,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:18,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:18,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130271652] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:18,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:18,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 32 [2021-12-14 19:54:18,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451782485] [2021-12-14 19:54:18,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:18,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-14 19:54:18,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-14 19:54:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 19:54:18,708 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:19,443 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2021-12-14 19:54:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 19:54:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 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 57 [2021-12-14 19:54:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:19,444 INFO L225 Difference]: With dead ends: 137 [2021-12-14 19:54:19,444 INFO L226 Difference]: Without dead ends: 137 [2021-12-14 19:54:19,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=2262, Unknown=0, NotChecked=0, Total=2970 [2021-12-14 19:54:19,445 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 663 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:19,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 260 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:54:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-14 19:54:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2021-12-14 19:54:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 121 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2021-12-14 19:54:19,447 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 57 [2021-12-14 19:54:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:19,448 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2021-12-14 19:54:19,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.5454545454545454) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2021-12-14 19:54:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-14 19:54:19,448 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:19,448 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:19,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:19,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:19,659 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2021-12-14 19:54:19,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:19,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211545396] [2021-12-14 19:54:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:19,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:19,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:19,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211545396] [2021-12-14 19:54:19,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211545396] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:19,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258956782] [2021-12-14 19:54:19,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:54:19,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:19,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:19,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:54:19,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 19:54:19,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:54:19,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 19:54:19,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-12-14 19:54:20,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2021-12-14 19:54:21,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258956782] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:21,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:21,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2021-12-14 19:54:21,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962681174] [2021-12-14 19:54:21,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:21,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 19:54:21,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:21,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 19:54:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:54:21,027 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:21,381 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2021-12-14 19:54:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:54:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-14 19:54:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:21,384 INFO L225 Difference]: With dead ends: 121 [2021-12-14 19:54:21,384 INFO L226 Difference]: Without dead ends: 121 [2021-12-14 19:54:21,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2021-12-14 19:54:21,385 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 343 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:21,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 115 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:54:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-14 19:54:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-14 19:54:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.18348623853211) internal successors, (129), 120 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) [2021-12-14 19:54:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2021-12-14 19:54:21,388 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 58 [2021-12-14 19:54:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:21,388 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2021-12-14 19:54:21,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2021-12-14 19:54:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 19:54:21,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:21,389 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:21,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:21,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:21,606 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash 797853176, now seen corresponding path program 1 times [2021-12-14 19:54:21,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:21,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631983291] [2021-12-14 19:54:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:21,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:21,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631983291] [2021-12-14 19:54:21,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631983291] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660161874] [2021-12-14 19:54:21,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:21,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:21,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:21,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:21,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 19:54:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:21,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:54:21,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:21,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:21,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660161874] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:21,984 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:21,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-12-14 19:54:21,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032462953] [2021-12-14 19:54:21,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:21,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 19:54:21,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:21,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 19:54:21,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:54:21,986 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:22,028 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-12-14 19:54:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:54:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 70 [2021-12-14 19:54:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:22,029 INFO L225 Difference]: With dead ends: 121 [2021-12-14 19:54:22,029 INFO L226 Difference]: Without dead ends: 121 [2021-12-14 19:54:22,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:54:22,030 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:22,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 259 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-14 19:54:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-14 19:54:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.146788990825688) internal successors, (125), 120 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2021-12-14 19:54:22,032 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 70 [2021-12-14 19:54:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:22,033 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2021-12-14 19:54:22,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2021-12-14 19:54:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-14 19:54:22,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:22,034 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:22,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:22,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 19:54:22,244 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2021-12-14 19:54:22,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:22,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618839835] [2021-12-14 19:54:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:22,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:22,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:22,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618839835] [2021-12-14 19:54:22,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618839835] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:22,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190249618] [2021-12-14 19:54:22,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:54:22,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:22,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:22,334 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:22,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 19:54:22,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-14 19:54:22,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:54:22,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:54:22,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2021-12-14 19:54:22,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:54:22,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190249618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:22,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:54:22,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2021-12-14 19:54:22,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986159840] [2021-12-14 19:54:22,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:22,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:54:22,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:54:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-12-14 19:54:22,949 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:23,035 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-12-14 19:54:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:54:23,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 87 [2021-12-14 19:54:23,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:23,036 INFO L225 Difference]: With dead ends: 120 [2021-12-14 19:54:23,036 INFO L226 Difference]: Without dead ends: 120 [2021-12-14 19:54:23,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-12-14 19:54:23,037 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 191 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:23,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 64 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-14 19:54:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-12-14 19:54:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2021-12-14 19:54:23,039 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 87 [2021-12-14 19:54:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:23,040 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2021-12-14 19:54:23,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2021-12-14 19:54:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-14 19:54:23,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:23,040 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:23,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 19:54:23,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 19:54:23,255 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565048, now seen corresponding path program 2 times [2021-12-14 19:54:23,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:23,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745419386] [2021-12-14 19:54:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:23,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-12-14 19:54:23,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:23,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745419386] [2021-12-14 19:54:23,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745419386] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:23,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:54:23,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:54:23,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538465704] [2021-12-14 19:54:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:23,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:54:23,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:54:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:54:23,310 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:23,337 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-12-14 19:54:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:54:23,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 [2021-12-14 19:54:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:23,338 INFO L225 Difference]: With dead ends: 118 [2021-12-14 19:54:23,339 INFO L226 Difference]: Without dead ends: 118 [2021-12-14 19:54:23,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:54:23,341 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:23,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 100 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-14 19:54:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-12-14 19:54:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 108 states have (on average 1.1296296296296295) internal successors, (122), 117 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2021-12-14 19:54:23,343 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 90 [2021-12-14 19:54:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:23,343 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2021-12-14 19:54:23,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2021-12-14 19:54:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-14 19:54:23,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:23,344 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:23,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:54:23,345 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1503565049, now seen corresponding path program 1 times [2021-12-14 19:54:23,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:23,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712415415] [2021-12-14 19:54:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:23,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 164 proven. 71 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:23,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:23,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712415415] [2021-12-14 19:54:23,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712415415] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:23,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917576747] [2021-12-14 19:54:23,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:23,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:23,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:23,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:23,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 19:54:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:23,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 19:54:23,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:24,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:54:24,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:54:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:24,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:54:24,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917576747] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:24,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:54:24,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 18 [2021-12-14 19:54:24,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418794085] [2021-12-14 19:54:24,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:24,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:54:24,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:54:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-14 19:54:24,430 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:24,504 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2021-12-14 19:54:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:54:24,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 [2021-12-14 19:54:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:24,505 INFO L225 Difference]: With dead ends: 125 [2021-12-14 19:54:24,505 INFO L226 Difference]: Without dead ends: 125 [2021-12-14 19:54:24,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:54:24,506 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:24,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:54:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-14 19:54:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2021-12-14 19:54:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2021-12-14 19:54:24,512 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 90 [2021-12-14 19:54:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:24,512 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2021-12-14 19:54:24,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2021-12-14 19:54:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 19:54:24,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:24,512 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:24,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:24,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 19:54:24,713 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:24,714 INFO L85 PathProgramCache]: Analyzing trace with hash -634123742, now seen corresponding path program 1 times [2021-12-14 19:54:24,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:24,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583320738] [2021-12-14 19:54:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:24,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:24,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:24,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583320738] [2021-12-14 19:54:24,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583320738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:24,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:54:24,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:54:24,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763081120] [2021-12-14 19:54:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:24,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:54:24,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:24,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:54:24,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:54:24,747 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:24,758 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2021-12-14 19:54:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:54:24,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 91 [2021-12-14 19:54:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:24,759 INFO L225 Difference]: With dead ends: 119 [2021-12-14 19:54:24,760 INFO L226 Difference]: Without dead ends: 119 [2021-12-14 19:54:24,760 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:54:24,760 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:24,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-14 19:54:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-14 19:54:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 110 states have (on average 1.1181818181818182) internal successors, (123), 118 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2021-12-14 19:54:24,763 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 91 [2021-12-14 19:54:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:24,763 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2021-12-14 19:54:24,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2021-12-14 19:54:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 19:54:24,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:24,764 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:24,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:54:24,764 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -634123741, now seen corresponding path program 1 times [2021-12-14 19:54:24,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966159399] [2021-12-14 19:54:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:24,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:24,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:24,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966159399] [2021-12-14 19:54:24,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966159399] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:24,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:54:24,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:54:24,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243803102] [2021-12-14 19:54:24,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:24,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:54:24,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:24,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:54:24,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:54:24,821 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:24,836 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-12-14 19:54:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:54:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 91 [2021-12-14 19:54:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:24,837 INFO L225 Difference]: With dead ends: 122 [2021-12-14 19:54:24,837 INFO L226 Difference]: Without dead ends: 122 [2021-12-14 19:54:24,837 INFO L932 BasicCegarLoop]: 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 [2021-12-14 19:54:24,838 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:24,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-14 19:54:24,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2021-12-14 19:54:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.117117117117117) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2021-12-14 19:54:24,841 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 91 [2021-12-14 19:54:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:24,842 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2021-12-14 19:54:24,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2021-12-14 19:54:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-14 19:54:24,845 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:24,845 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:24,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:54:24,845 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:24,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash 789303046, now seen corresponding path program 1 times [2021-12-14 19:54:24,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:24,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910321101] [2021-12-14 19:54:24,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:24,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 164 proven. 73 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:25,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:25,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910321101] [2021-12-14 19:54:25,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910321101] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:25,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487924801] [2021-12-14 19:54:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:25,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:25,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:25,094 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:25,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 19:54:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:25,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 19:54:25,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:25,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:54:25,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:54:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:25,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:27,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487924801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:27,265 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:27,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 24 [2021-12-14 19:54:27,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171546221] [2021-12-14 19:54:27,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:27,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 19:54:27,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:27,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 19:54:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2021-12-14 19:54:27,267 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 26 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:27,872 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2021-12-14 19:54:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:54:27,873 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 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 95 [2021-12-14 19:54:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:27,873 INFO L225 Difference]: With dead ends: 180 [2021-12-14 19:54:27,873 INFO L226 Difference]: Without dead ends: 180 [2021-12-14 19:54:27,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=430, Invalid=1376, Unknown=0, NotChecked=0, Total=1806 [2021-12-14 19:54:27,874 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 366 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:27,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 363 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 636 Invalid, 0 Unknown, 88 Unchecked, 0.3s Time] [2021-12-14 19:54:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-14 19:54:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2021-12-14 19:54:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.136) internal successors, (142), 133 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) [2021-12-14 19:54:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2021-12-14 19:54:27,877 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 95 [2021-12-14 19:54:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:27,877 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2021-12-14 19:54:27,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2021-12-14 19:54:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-14 19:54:27,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:27,878 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:27,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:28,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:28,098 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409354, now seen corresponding path program 1 times [2021-12-14 19:54:28,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:28,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696838863] [2021-12-14 19:54:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:28,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:28,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:28,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696838863] [2021-12-14 19:54:28,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696838863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:28,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781390520] [2021-12-14 19:54:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:28,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:28,163 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:28,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 19:54:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:28,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:54:28,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:28,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:54:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:28,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:28,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781390520] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:28,498 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:28,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2021-12-14 19:54:28,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671809038] [2021-12-14 19:54:28,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:28,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:54:28,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:54:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:54:28,500 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:28,568 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-12-14 19:54:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:54:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 [2021-12-14 19:54:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:28,570 INFO L225 Difference]: With dead ends: 137 [2021-12-14 19:54:28,570 INFO L226 Difference]: Without dead ends: 137 [2021-12-14 19:54:28,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:54:28,571 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:28,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 149 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:54:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-14 19:54:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2021-12-14 19:54:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 126 states have (on average 1.119047619047619) internal successors, (141), 134 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) [2021-12-14 19:54:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2021-12-14 19:54:28,577 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 96 [2021-12-14 19:54:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:28,577 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2021-12-14 19:54:28,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2021-12-14 19:54:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-14 19:54:28,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:28,578 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:28,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:28,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:28,799 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:28,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:28,800 INFO L85 PathProgramCache]: Analyzing trace with hash -265893408, now seen corresponding path program 1 times [2021-12-14 19:54:28,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:28,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347180065] [2021-12-14 19:54:28,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:28,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:28,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:28,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347180065] [2021-12-14 19:54:28,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347180065] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:28,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813749148] [2021-12-14 19:54:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:28,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:28,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:28,838 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:28,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 19:54:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:28,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:54:28,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:29,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:29,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813749148] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:29,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:29,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-14 19:54:29,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157857919] [2021-12-14 19:54:29,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:29,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:54:29,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:54:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:54:29,134 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:29,160 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2021-12-14 19:54:29,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:54:29,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-12-14 19:54:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:29,161 INFO L225 Difference]: With dead ends: 145 [2021-12-14 19:54:29,161 INFO L226 Difference]: Without dead ends: 145 [2021-12-14 19:54:29,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:54:29,162 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:29,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 83 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-14 19:54:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2021-12-14 19:54:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 142 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2021-12-14 19:54:29,165 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 103 [2021-12-14 19:54:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:29,165 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2021-12-14 19:54:29,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2021-12-14 19:54:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-14 19:54:29,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:29,166 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:29,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:29,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-14 19:54:29,379 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1508601145, now seen corresponding path program 2 times [2021-12-14 19:54:29,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:29,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82480742] [2021-12-14 19:54:29,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:29,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 164 proven. 109 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-14 19:54:29,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:29,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82480742] [2021-12-14 19:54:29,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82480742] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:29,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379584020] [2021-12-14 19:54:29,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:54:29,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:29,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:29,681 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:29,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 19:54:29,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:54:29,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:54:29,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-14 19:54:29,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:30,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:54:30,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:54:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:30,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:32,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379584020] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:32,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:32,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 33 [2021-12-14 19:54:32,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431110214] [2021-12-14 19:54:32,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:32,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 19:54:32,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 19:54:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 19:54:32,035 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand has 35 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:33,184 INFO L93 Difference]: Finished difference Result 257 states and 269 transitions. [2021-12-14 19:54:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-14 19:54:33,186 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-12-14 19:54:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:33,187 INFO L225 Difference]: With dead ends: 257 [2021-12-14 19:54:33,187 INFO L226 Difference]: Without dead ends: 257 [2021-12-14 19:54:33,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=775, Invalid=2765, Unknown=0, NotChecked=0, Total=3540 [2021-12-14 19:54:33,188 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 798 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:33,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [798 Valid, 572 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1035 Invalid, 0 Unknown, 106 Unchecked, 0.5s Time] [2021-12-14 19:54:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-12-14 19:54:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 164. [2021-12-14 19:54:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 155 states have (on average 1.1419354838709677) internal successors, (177), 163 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2021-12-14 19:54:33,191 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 110 [2021-12-14 19:54:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:33,191 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2021-12-14 19:54:33,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2021-12-14 19:54:33,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-14 19:54:33,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:33,192 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:33,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:33,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:33,392 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash -478004765, now seen corresponding path program 2 times [2021-12-14 19:54:33,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:33,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188373252] [2021-12-14 19:54:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:33,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:33,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188373252] [2021-12-14 19:54:33,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188373252] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171017022] [2021-12-14 19:54:33,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:54:33,486 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:33,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:33,486 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:33,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 19:54:33,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 19:54:33,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:54:33,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:54:33,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:33,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:54:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-14 19:54:33,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-14 19:54:34,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171017022] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:34,285 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:34,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2021-12-14 19:54:34,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713490127] [2021-12-14 19:54:34,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:34,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 19:54:34,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 19:54:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:54:34,286 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:34,526 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2021-12-14 19:54:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:54:34,526 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 111 [2021-12-14 19:54:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:34,527 INFO L225 Difference]: With dead ends: 163 [2021-12-14 19:54:34,527 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 19:54:34,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2021-12-14 19:54:34,528 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 173 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:34,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 185 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:54:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 19:54:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-14 19:54:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 155 states have (on average 1.103225806451613) internal successors, (171), 162 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2021-12-14 19:54:34,530 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 111 [2021-12-14 19:54:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:34,531 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2021-12-14 19:54:34,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.4375) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2021-12-14 19:54:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-14 19:54:34,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:34,532 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:34,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:34,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:34,743 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145504, now seen corresponding path program 2 times [2021-12-14 19:54:34,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159378637] [2021-12-14 19:54:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:34,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:34,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:34,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159378637] [2021-12-14 19:54:34,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159378637] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:34,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913575822] [2021-12-14 19:54:34,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:54:34,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:34,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:34,819 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:34,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 19:54:34,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:54:34,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:54:34,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:54:34,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:35,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:54:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:35,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913575822] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:54:35,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:54:35,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-12-14 19:54:35,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815431642] [2021-12-14 19:54:35,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:54:35,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 19:54:35,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:35,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 19:54:35,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:54:35,319 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:35,357 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2021-12-14 19:54:35,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:54:35,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 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 123 [2021-12-14 19:54:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:35,358 INFO L225 Difference]: With dead ends: 163 [2021-12-14 19:54:35,358 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 19:54:35,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:54:35,359 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 41 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:35,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 161 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 19:54:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-14 19:54:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 155 states have (on average 1.0774193548387097) internal successors, (167), 162 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2021-12-14 19:54:35,362 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 123 [2021-12-14 19:54:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:35,362 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2021-12-14 19:54:35,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2021-12-14 19:54:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-12-14 19:54:35,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:35,363 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:35,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:35,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 19:54:35,575 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:35,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash 482493849, now seen corresponding path program 3 times [2021-12-14 19:54:35,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:35,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837286694] [2021-12-14 19:54:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:35,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:54:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2021-12-14 19:54:35,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:54:35,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837286694] [2021-12-14 19:54:35,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837286694] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:54:35,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548376709] [2021-12-14 19:54:35,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:54:35,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:35,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:54:35,669 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:54:35,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 19:54:35,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-14 19:54:35,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:54:35,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:54:35,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:54:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:54:36,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:54:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2021-12-14 19:54:36,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:54:36,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548376709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:54:36,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:54:36,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2021-12-14 19:54:36,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429778027] [2021-12-14 19:54:36,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:54:36,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:54:36,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:54:36,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:54:36,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-12-14 19:54:36,740 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:54:36,843 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2021-12-14 19:54:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:54:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 [2021-12-14 19:54:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:54:36,844 INFO L225 Difference]: With dead ends: 162 [2021-12-14 19:54:36,844 INFO L226 Difference]: Without dead ends: 162 [2021-12-14 19:54:36,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2021-12-14 19:54:36,845 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 88 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:54:36,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 88 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:54:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-14 19:54:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2021-12-14 19:54:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2021-12-14 19:54:36,847 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 140 [2021-12-14 19:54:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:54:36,847 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2021-12-14 19:54:36,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:54:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2021-12-14 19:54:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-14 19:54:36,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:54:36,848 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:36,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-14 19:54:37,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:54:37,063 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 13 more)] === [2021-12-14 19:54:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:54:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766496, now seen corresponding path program 3 times [2021-12-14 19:54:37,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:54:37,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564193863] [2021-12-14 19:54:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:54:37,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:54:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:54:37,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 19:54:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:54:37,188 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 19:54:37,188 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 19:54:37,189 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (16 of 17 remaining) [2021-12-14 19:54:37,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (15 of 17 remaining) [2021-12-14 19:54:37,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (14 of 17 remaining) [2021-12-14 19:54:37,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (13 of 17 remaining) [2021-12-14 19:54:37,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (12 of 17 remaining) [2021-12-14 19:54:37,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (11 of 17 remaining) [2021-12-14 19:54:37,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (10 of 17 remaining) [2021-12-14 19:54:37,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (9 of 17 remaining) [2021-12-14 19:54:37,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (8 of 17 remaining) [2021-12-14 19:54:37,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (7 of 17 remaining) [2021-12-14 19:54:37,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (6 of 17 remaining) [2021-12-14 19:54:37,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (5 of 17 remaining) [2021-12-14 19:54:37,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (4 of 17 remaining) [2021-12-14 19:54:37,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (3 of 17 remaining) [2021-12-14 19:54:37,191 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (2 of 17 remaining) [2021-12-14 19:54:37,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (1 of 17 remaining) [2021-12-14 19:54:37,192 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2021-12-14 19:54:37,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 19:54:37,194 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:54:37,196 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:54:37,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:54:37 BoogieIcfgContainer [2021-12-14 19:54:37,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:54:37,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:54:37,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:54:37,291 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:54:37,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:54:12" (3/4) ... [2021-12-14 19:54:37,292 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 19:54:37,359 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 19:54:37,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:54:37,360 INFO L158 Benchmark]: Toolchain (without parser) took 25658.07ms. Allocated memory was 102.8MB in the beginning and 237.0MB in the end (delta: 134.2MB). Free memory was 75.5MB in the beginning and 192.7MB in the end (delta: -117.2MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2021-12-14 19:54:37,360 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:54:37,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.89ms. Allocated memory is still 102.8MB. Free memory was 75.2MB in the beginning and 78.9MB in the end (delta: -3.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2021-12-14 19:54:37,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.70ms. Allocated memory is still 102.8MB. Free memory was 78.9MB in the beginning and 76.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:54:37,363 INFO L158 Benchmark]: Boogie Preprocessor took 32.18ms. Allocated memory is still 102.8MB. Free memory was 76.8MB in the beginning and 75.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:54:37,364 INFO L158 Benchmark]: RCFGBuilder took 341.70ms. Allocated memory is still 102.8MB. Free memory was 75.5MB in the beginning and 62.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 19:54:37,364 INFO L158 Benchmark]: TraceAbstraction took 24956.63ms. Allocated memory was 102.8MB in the beginning and 237.0MB in the end (delta: 134.2MB). Free memory was 62.0MB in the beginning and 203.2MB in the end (delta: -141.2MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2021-12-14 19:54:37,364 INFO L158 Benchmark]: Witness Printer took 68.79ms. Allocated memory is still 237.0MB. Free memory was 203.2MB in the beginning and 192.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 19:54:37,367 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.15ms. Allocated memory is still 102.8MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.89ms. Allocated memory is still 102.8MB. Free memory was 75.2MB in the beginning and 78.9MB in the end (delta: -3.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.70ms. Allocated memory is still 102.8MB. Free memory was 78.9MB in the beginning and 76.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.18ms. Allocated memory is still 102.8MB. Free memory was 76.8MB in the beginning and 75.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.70ms. Allocated memory is still 102.8MB. Free memory was 75.5MB in the beginning and 62.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24956.63ms. Allocated memory was 102.8MB in the beginning and 237.0MB in the end (delta: 134.2MB). Free memory was 62.0MB in the beginning and 203.2MB in the end (delta: -141.2MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. * Witness Printer took 68.79ms. Allocated memory is still 237.0MB. Free memory was 203.2MB in the beginning and 192.7MB 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 - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; VAL [array={2:0}, numbers2={3:0}, numbers4={4:0}] [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=0, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=1, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=2, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=3, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=4, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=5, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=6, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=7, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=8, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L9] array[i] = i VAL [array={2:0}, i=9, numbers2={3:0}, numbers4={4:0}] [L8] ++i VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L8] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L12] return array; VAL [\result={2:0}, array={2:0}, i=10, numbers2={3:0}, numbers4={4:0}] [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=0, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=0] [L18] ++i VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=1, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=1] [L18] ++i VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=2, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=2] [L18] ++i VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=3, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=3] [L18] ++i VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=4, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=4] [L18] ++i VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=5, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=5] [L18] ++i VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=6, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=6] [L18] ++i VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=7, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=7] [L18] ++i VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=8, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=8] [L18] ++i VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L19] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L19] numbers2[i] = numbers[i] VAL [array={2:0}, i=9, numbers={2:0}, numbers2={3:0}, numbers4={4:0}, numbers[i]=9] [L18] ++i VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L18] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L21] return numbers2; VAL [\result={3:0}, array={2:0}, i=10, numbers={2:0}, numbers2={3:0}, numbers4={4:0}] [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=0, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=0] [L27] ++i VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=1, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=1] [L27] ++i VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=2, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=2] [L27] ++i VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=3, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=3] [L27] ++i VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=4, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=4] [L27] ++i VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=5, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=5] [L27] ++i VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=6, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=6] [L27] ++i VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=7, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=7] [L27] ++i VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=8, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=8] [L27] ++i VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND TRUE i < 10 VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L28] EXPR numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L28] numbers3[i] = numbers[i] VAL [array={2:0}, i=9, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}, numbers[i]=9] [L27] ++i VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L27] COND FALSE !(i < 10) VAL [array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers3={11:0}, numbers4={4:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={11:0}, array={2:0}, i=10, numbers={3:0}, numbers2={3:0}, numbers4={4:0}] [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L37] COND TRUE i < 10 VAL [array={2:0}, i=0, numbers={11:0}, numbers2={3:0}, numbers4={4:0}] [L38] numbers[i] - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3903 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3903 mSDsluCounter, 3683 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 194 IncrementalHoareTripleChecker+Unchecked, 2758 mSDsCounter, 504 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4100 IncrementalHoareTripleChecker+Invalid, 4798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 504 mSolverCounterUnsat, 925 mSDtfsCounter, 4100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2510 GetRequests, 2093 SyntacticMatches, 2 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=22, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 182 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 3112 NumberOfCodeBlocks, 2743 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3848 ConstructedInterpolants, 174 QuantifiedInterpolants, 33001 SizeOfPredicates, 44 NumberOfNonLiveVariables, 4132 ConjunctsInSsa, 240 ConjunctsInUnsatCore, 55 InterpolantComputations, 12 PerfectInterpolantSequences, 13374/14759 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 RESULT: Ultimate proved your program to be incorrect! [2021-12-14 19:54:37,403 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)