./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/960521-1_1-1.i --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/list-ext-properties/960521-1_1-1.i -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 1bdc21b2f61b0d69220994ec3f8dc9d2db928c146bd54c19e0632aa07d01871a --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:39:25,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:39:25,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:39:25,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:39:25,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:39:25,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:39:25,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:39:25,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:39:25,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:39:25,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:39:25,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:39:25,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:39:25,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:39:25,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:39:25,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:39:25,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:39:25,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:39:25,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:39:25,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:39:25,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:39:25,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:39:25,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:39:25,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:39:25,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:39:25,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:39:25,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:39:25,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:39:25,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:39:25,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:39:25,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:39:25,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:39:25,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:39:25,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:39:25,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:39:25,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:39:25,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:39:25,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:39:25,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:39:25,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:39:25,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:39:25,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:39:25,676 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:39:25,706 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:39:25,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:39:25,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:39:25,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:39:25,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:39:25,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:39:25,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:39:25,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:39:25,710 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:39:25,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:39:25,711 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:39:25,711 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:39:25,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:39:25,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:39:25,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:39:25,711 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:39:25,711 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:39:25,712 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:39:25,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:39:25,712 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:39:25,712 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:39:25,712 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:39:25,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:39:25,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:39:25,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:39:25,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:25,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:39:25,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:39:25,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:39:25,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:39:25,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:39:25,715 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 -> 1bdc21b2f61b0d69220994ec3f8dc9d2db928c146bd54c19e0632aa07d01871a [2021-12-14 19:39:25,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:39:25,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:39:25,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:39:25,943 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:39:25,944 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:39:25,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/960521-1_1-1.i [2021-12-14 19:39:25,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6821394b3/8b7d9fab11164b45b8d492cefbb891f2/FLAG13945b43b [2021-12-14 19:39:26,377 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:39:26,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/960521-1_1-1.i [2021-12-14 19:39:26,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6821394b3/8b7d9fab11164b45b8d492cefbb891f2/FLAG13945b43b [2021-12-14 19:39:26,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6821394b3/8b7d9fab11164b45b8d492cefbb891f2 [2021-12-14 19:39:26,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:39:26,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:39:26,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:26,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:39:26,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:39:26,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:26" (1/1) ... [2021-12-14 19:39:26,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d63e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:26, skipping insertion in model container [2021-12-14 19:39:26,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:26" (1/1) ... [2021-12-14 19:39:26,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:39:26,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:26,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:26,988 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:39:27,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:27,076 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:39:27,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27 WrapperNode [2021-12-14 19:39:27,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:27,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:39:27,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:39:27,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:39:27,084 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:39:27" (1/1) ... [2021-12-14 19:39:27,105 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:39:27" (1/1) ... [2021-12-14 19:39:27,117 INFO L137 Inliner]: procedures = 122, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2021-12-14 19:39:27,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:39:27,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:39:27,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:39:27,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:39:27,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (1/1) ... [2021-12-14 19:39:27,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (1/1) ... [2021-12-14 19:39:27,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (1/1) ... [2021-12-14 19:39:27,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (1/1) ... [2021-12-14 19:39:27,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (1/1) ... [2021-12-14 19:39:27,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (1/1) ... [2021-12-14 19:39:27,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (1/1) ... [2021-12-14 19:39:27,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:39:27,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:39:27,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:39:27,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:39:27,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (1/1) ... [2021-12-14 19:39:27,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:27,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:27,158 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:39:27,160 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:39:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:39:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:39:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:39:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:39:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:39:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:39:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:39:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:39:27,237 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:39:27,238 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:39:27,354 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:39:27,359 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:39:27,359 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 19:39:27,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:27 BoogieIcfgContainer [2021-12-14 19:39:27,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:39:27,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:39:27,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:39:27,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:39:27,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:39:26" (1/3) ... [2021-12-14 19:39:27,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad605f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:27, skipping insertion in model container [2021-12-14 19:39:27,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:27" (2/3) ... [2021-12-14 19:39:27,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad605f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:27, skipping insertion in model container [2021-12-14 19:39:27,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:27" (3/3) ... [2021-12-14 19:39:27,368 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1_1-1.i [2021-12-14 19:39:27,371 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:39:27,371 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-14 19:39:27,399 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:39:27,404 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:39:27,404 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-14 19:39:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.875) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 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:39:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:27,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:27,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:27,419 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash 28702701, now seen corresponding path program 1 times [2021-12-14 19:39:27,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:27,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748977343] [2021-12-14 19:39:27,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:27,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:27,562 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:39:27,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:27,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748977343] [2021-12-14 19:39:27,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748977343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:27,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:27,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:27,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091288366] [2021-12-14 19:39:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:27,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 19:39:27,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:27,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 19:39:27,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:39:27,600 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.875) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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:39:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:27,613 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2021-12-14 19:39:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:39:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-14 19:39:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:27,621 INFO L225 Difference]: With dead ends: 54 [2021-12-14 19:39:27,621 INFO L226 Difference]: Without dead ends: 52 [2021-12-14 19:39:27,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:39:27,628 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:27,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-14 19:39:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-14 19:39:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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:39:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-12-14 19:39:27,656 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 5 [2021-12-14 19:39:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:27,656 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-12-14 19:39:27,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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:39:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-12-14 19:39:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:39:27,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:27,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:39:27,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:39:27,657 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash 889569384, now seen corresponding path program 1 times [2021-12-14 19:39:27,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:27,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695066920] [2021-12-14 19:39:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:27,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:27,741 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:39:27,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:27,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695066920] [2021-12-14 19:39:27,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695066920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:27,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:27,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:27,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725083465] [2021-12-14 19:39:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:27,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:27,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:27,746 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:39:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:27,788 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-12-14 19:39:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:27,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-14 19:39:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:27,790 INFO L225 Difference]: With dead ends: 51 [2021-12-14 19:39:27,790 INFO L226 Difference]: Without dead ends: 51 [2021-12-14 19:39:27,791 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:39:27,794 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:27,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-14 19:39:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-14 19:39:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 50 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:39:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-12-14 19:39:27,805 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 6 [2021-12-14 19:39:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:27,806 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-12-14 19:39:27,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:39:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-12-14 19:39:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:39:27,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:27,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:39:27,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:39:27,809 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash 889569385, now seen corresponding path program 1 times [2021-12-14 19:39:27,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:27,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247695205] [2021-12-14 19:39:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:27,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:27,877 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:39:27,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:27,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247695205] [2021-12-14 19:39:27,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247695205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:27,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:27,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:27,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707267714] [2021-12-14 19:39:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:27,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:27,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:27,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:27,880 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:39:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:27,922 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2021-12-14 19:39:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:27,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-14 19:39:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:27,924 INFO L225 Difference]: With dead ends: 99 [2021-12-14 19:39:27,924 INFO L226 Difference]: Without dead ends: 99 [2021-12-14 19:39:27,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:39:27,925 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 49 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:27,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-14 19:39:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 55. [2021-12-14 19:39:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 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:39:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-12-14 19:39:27,930 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 6 [2021-12-14 19:39:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:27,930 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-12-14 19:39:27,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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:39:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-12-14 19:39:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:39:27,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:27,931 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:27,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:39:27,931 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 179257870, now seen corresponding path program 1 times [2021-12-14 19:39:27,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:27,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314940490] [2021-12-14 19:39:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:27,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:27,969 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:39:27,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:27,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314940490] [2021-12-14 19:39:27,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314940490] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:27,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273472725] [2021-12-14 19:39:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:27,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:27,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:27,972 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:39:27,973 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:39:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:28,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:28,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:28,086 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:28,087 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:28,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:28,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273472725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:28,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:28,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-12-14 19:39:28,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713972542] [2021-12-14 19:39:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:28,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:39:28,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:28,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:39:28,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:28,105 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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:39:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:28,148 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-12-14 19:39:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:39:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-14 19:39:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:28,149 INFO L225 Difference]: With dead ends: 98 [2021-12-14 19:39:28,149 INFO L226 Difference]: Without dead ends: 98 [2021-12-14 19:39:28,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:39:28,150 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 98 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:28,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 199 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-14 19:39:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 50. [2021-12-14 19:39:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 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:39:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-12-14 19:39:28,154 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 8 [2021-12-14 19:39:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:28,154 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-12-14 19:39:28,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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:39:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-12-14 19:39:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:39:28,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:28,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:28,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:28,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:28,371 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1213292751, now seen corresponding path program 1 times [2021-12-14 19:39:28,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:28,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417914745] [2021-12-14 19:39:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:28,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:28,432 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:39:28,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:28,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417914745] [2021-12-14 19:39:28,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417914745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:28,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:28,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:28,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467239196] [2021-12-14 19:39:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:28,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:28,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:28,435 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:28,471 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2021-12-14 19:39:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:28,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:39:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:28,474 INFO L225 Difference]: With dead ends: 47 [2021-12-14 19:39:28,475 INFO L226 Difference]: Without dead ends: 47 [2021-12-14 19:39:28,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:28,475 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:28,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-14 19:39:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-12-14 19:39:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2021-12-14 19:39:28,482 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2021-12-14 19:39:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:28,482 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2021-12-14 19:39:28,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2021-12-14 19:39:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:39:28,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:28,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:28,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:39:28,483 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:28,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1213292752, now seen corresponding path program 1 times [2021-12-14 19:39:28,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:28,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191087072] [2021-12-14 19:39:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:28,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:28,585 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:39:28,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:28,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191087072] [2021-12-14 19:39:28,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191087072] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:28,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:28,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:39:28,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588712585] [2021-12-14 19:39:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:28,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:39:28,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:28,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:39:28,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:39:28,588 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:28,667 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2021-12-14 19:39:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:39:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:28,668 INFO L225 Difference]: With dead ends: 89 [2021-12-14 19:39:28,668 INFO L226 Difference]: Without dead ends: 89 [2021-12-14 19:39:28,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:39:28,669 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 100 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:28,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 165 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:39:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-14 19:39:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2021-12-14 19:39:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2021-12-14 19:39:28,672 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 9 [2021-12-14 19:39:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:28,673 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2021-12-14 19:39:28,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2021-12-14 19:39:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:39:28,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:28,673 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:28,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:39:28,674 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:28,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1626816779, now seen corresponding path program 1 times [2021-12-14 19:39:28,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:28,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201488236] [2021-12-14 19:39:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:28,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:28,733 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:39:28,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:28,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201488236] [2021-12-14 19:39:28,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201488236] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:28,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746927911] [2021-12-14 19:39:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:28,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:28,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:28,735 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:39:28,736 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:39:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:28,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:39:28,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:28,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:28,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 19:39:28,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 19:39:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:28,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:28,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746927911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:28,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:28,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-14 19:39:28,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81966213] [2021-12-14 19:39:28,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:28,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:28,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:28,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:28,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:39:28,856 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:39:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:28,937 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2021-12-14 19:39:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 11 [2021-12-14 19:39:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:28,938 INFO L225 Difference]: With dead ends: 94 [2021-12-14 19:39:28,938 INFO L226 Difference]: Without dead ends: 94 [2021-12-14 19:39:28,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:39:28,939 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 149 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:28,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:39:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-14 19:39:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2021-12-14 19:39:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.434782608695652) internal successors, (66), 59 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:39:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2021-12-14 19:39:28,942 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 11 [2021-12-14 19:39:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:28,943 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2021-12-14 19:39:28,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:39:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2021-12-14 19:39:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:39:28,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:28,943 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:28,962 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:39:29,160 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,SelfDestructingSolverStorable6 [2021-12-14 19:39:29,160 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:29,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1240415274, now seen corresponding path program 1 times [2021-12-14 19:39:29,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:29,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508693840] [2021-12-14 19:39:29,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:29,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:29,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:29,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508693840] [2021-12-14 19:39:29,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508693840] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:29,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884869842] [2021-12-14 19:39:29,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:29,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:29,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:29,192 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:39:29,193 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:39:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:29,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:29,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:29,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:29,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884869842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:29,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:29,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-14 19:39:29,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642638988] [2021-12-14 19:39:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:29,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:39:29,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:39:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:29,273 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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:39:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:29,293 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-12-14 19:39:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:39:29,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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 12 [2021-12-14 19:39:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:29,295 INFO L225 Difference]: With dead ends: 87 [2021-12-14 19:39:29,295 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 19:39:29,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:29,296 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:29,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 109 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 19:39:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2021-12-14 19:39:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4) 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:39:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-12-14 19:39:29,298 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2021-12-14 19:39:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:29,298 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-12-14 19:39:29,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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:39:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-12-14 19:39:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:39:29,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:29,299 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:29,315 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:39:29,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:29,515 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 87668155, now seen corresponding path program 1 times [2021-12-14 19:39:29,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:29,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083102862] [2021-12-14 19:39:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:29,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:29,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:29,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083102862] [2021-12-14 19:39:29,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083102862] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:29,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207281922] [2021-12-14 19:39:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:29,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:29,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:29,607 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:39:29,608 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:39:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:29,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:39:29,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:29,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:29,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 19:39:29,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-14 19:39:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:29,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:29,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:29,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207281922] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:29,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:39:29,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2021-12-14 19:39:29,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102799783] [2021-12-14 19:39:29,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:29,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 19:39:29,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:29,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 19:39:29,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:39:29,803 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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:39:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:30,002 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2021-12-14 19:39:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:39:30,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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 14 [2021-12-14 19:39:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:30,003 INFO L225 Difference]: With dead ends: 128 [2021-12-14 19:39:30,003 INFO L226 Difference]: Without dead ends: 128 [2021-12-14 19:39:30,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-12-14 19:39:30,004 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 254 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:30,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 316 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:39:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-14 19:39:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 62. [2021-12-14 19:39:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 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:39:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-12-14 19:39:30,007 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 14 [2021-12-14 19:39:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:30,008 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-12-14 19:39:30,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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:39:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-12-14 19:39:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:39:30,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:30,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:30,024 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:39:30,218 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:39:30,219 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:30,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash 685561807, now seen corresponding path program 1 times [2021-12-14 19:39:30,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:30,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516194334] [2021-12-14 19:39:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:30,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:39:30,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:30,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516194334] [2021-12-14 19:39:30,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516194334] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:30,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:30,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:30,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930685538] [2021-12-14 19:39:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:30,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:30,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:30,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:30,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:30,281 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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:39:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:30,303 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-12-14 19:39:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:30,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-12-14 19:39:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:30,305 INFO L225 Difference]: With dead ends: 60 [2021-12-14 19:39:30,305 INFO L226 Difference]: Without dead ends: 60 [2021-12-14 19:39:30,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:39:30,305 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:30,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-14 19:39:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-14 19:39:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 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:39:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-12-14 19:39:30,307 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 15 [2021-12-14 19:39:30,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:30,307 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-12-14 19:39:30,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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:39:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-12-14 19:39:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:39:30,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:30,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:30,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:39:30,308 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-14 19:39:30,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:30,308 INFO L85 PathProgramCache]: Analyzing trace with hash 685561808, now seen corresponding path program 1 times [2021-12-14 19:39:30,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:30,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375646355] [2021-12-14 19:39:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:30,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:39:30,317 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 19:39:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 19:39:30,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 19:39:30,331 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 19:39:30,331 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (20 of 21 remaining) [2021-12-14 19:39:30,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (19 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (18 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (17 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (16 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (15 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (14 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (13 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2021-12-14 19:39:30,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2021-12-14 19:39:30,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2021-12-14 19:39:30,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2021-12-14 19:39:30,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2021-12-14 19:39:30,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:39:30,336 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:30,338 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 19:39:30,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:39:30 BoogieIcfgContainer [2021-12-14 19:39:30,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 19:39:30,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 19:39:30,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 19:39:30,352 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 19:39:30,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:27" (3/4) ... [2021-12-14 19:39:30,353 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 19:39:30,373 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 19:39:30,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 19:39:30,374 INFO L158 Benchmark]: Toolchain (without parser) took 3587.42ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 61.9MB in the beginning and 44.2MB in the end (delta: 17.7MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2021-12-14 19:39:30,374 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 83.9MB. Free memory was 58.0MB in the beginning and 58.0MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:39:30,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.03ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 57.6MB in the end (delta: 4.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 19:39:30,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.90ms. Allocated memory is still 83.9MB. Free memory was 57.4MB in the beginning and 55.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:39:30,374 INFO L158 Benchmark]: Boogie Preprocessor took 16.57ms. Allocated memory is still 83.9MB. Free memory was 55.6MB in the beginning and 54.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:39:30,374 INFO L158 Benchmark]: RCFGBuilder took 225.25ms. Allocated memory is still 83.9MB. Free memory was 54.2MB in the beginning and 42.2MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 19:39:30,374 INFO L158 Benchmark]: TraceAbstraction took 2989.85ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 41.8MB in the beginning and 46.3MB in the end (delta: -4.5MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2021-12-14 19:39:30,375 INFO L158 Benchmark]: Witness Printer took 21.18ms. Allocated memory is still 104.9MB. Free memory was 46.3MB in the beginning and 44.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:39:30,375 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.10ms. Allocated memory is still 83.9MB. Free memory was 58.0MB in the beginning and 58.0MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.03ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 57.6MB in the end (delta: 4.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.90ms. Allocated memory is still 83.9MB. Free memory was 57.4MB in the beginning and 55.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.57ms. Allocated memory is still 83.9MB. Free memory was 55.6MB in the beginning and 54.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 225.25ms. Allocated memory is still 83.9MB. Free memory was 54.2MB in the beginning and 42.2MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2989.85ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 41.8MB in the beginning and 46.3MB in the end (delta: -4.5MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 21.18ms. Allocated memory is still 104.9MB. Free memory was 46.3MB in the beginning and 44.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 544]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L536] n = 1 VAL [a={0:0}, b={0:0}, n=1] [L537] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L540] a = malloc(n * sizeof(*a)) [L541] b = malloc(n * sizeof(*b)) [L542] EXPR b++ VAL [a={-2:0}, b={-1:4}, b++={-1:0}, n=1] [L542] *b++ = 0 VAL [a={-2:0}, b={-1:4}, b++={-1:0}, n=1] [L543] CALL foo() [L528] int i; [L529] i = 0 VAL [a={-2:0}, b={-1:4}, i=0, n=1] [L529] COND TRUE i < n VAL [a={-2:0}, b={-1:4}, i=0, n=1] [L530] a[i] = n VAL [a={-2:0}, b={-1:4}, i=0, n=1] [L529] i++ VAL [a={-2:0}, b={-1:4}, i=1, n=1] [L529] COND FALSE !(i < n) VAL [a={-2:0}, b={-1:4}, i=1, n=1] [L531] i = 0 VAL [a={-2:0}, b={-1:4}, i=0, n=1] [L531] COND FALSE !(i < n - 1) VAL [a={-2:0}, b={-1:4}, i=0, n=1] [L543] RET foo() [L544] b[-2] - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: 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, 54 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 760 mSDsluCounter, 1321 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 791 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 530 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 245 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 797 SizeOfPredicates, 10 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 12/25 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:39:30,414 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)