./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bor5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/bor5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:35:17,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:35:17,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:35:17,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:35:17,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:35:17,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:35:17,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:35:17,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:35:17,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:35:17,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:35:17,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:35:17,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:35:17,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:35:17,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:35:17,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:35:17,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:35:17,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:35:17,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:35:17,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:35:17,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:35:17,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:35:17,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:35:17,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:35:17,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:35:17,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:35:17,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:35:17,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:35:17,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:35:17,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:35:17,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:35:17,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:35:17,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:35:17,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:35:17,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:35:17,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:35:17,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:35:17,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:35:17,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:35:17,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:35:17,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:35:17,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:35:17,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:35:17,816 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:35:17,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:35:17,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:35:17,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:35:17,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:35:17,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:35:17,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:35:17,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:35:17,819 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:35:17,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:35:17,820 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:35:17,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:35:17,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:35:17,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:35:17,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:35:17,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:35:17,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:35:17,821 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:35:17,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:35:17,821 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:35:17,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:35:17,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:35:17,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:35:17,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:35:17,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:35:17,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:35:17,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:35:17,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:35:17,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:35:17,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:35:17,823 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:35:17,823 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:35:17,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:35:17,824 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 [2021-12-27 21:35:18,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:35:18,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:35:18,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:35:18,082 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:35:18,082 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:35:18,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bor5.i [2021-12-27 21:35:18,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ce1e8b0/7300627b3771476683ee59cabb72e5b9/FLAG7625104a3 [2021-12-27 21:35:18,511 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:35:18,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i [2021-12-27 21:35:18,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ce1e8b0/7300627b3771476683ee59cabb72e5b9/FLAG7625104a3 [2021-12-27 21:35:18,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ce1e8b0/7300627b3771476683ee59cabb72e5b9 [2021-12-27 21:35:18,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:35:18,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:35:18,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:35:18,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:35:18,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:35:18,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee7edd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18, skipping insertion in model container [2021-12-27 21:35:18,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:35:18,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:35:18,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i[1364,1377] [2021-12-27 21:35:18,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:35:18,731 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:35:18,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i[1364,1377] [2021-12-27 21:35:18,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:35:18,771 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:35:18,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18 WrapperNode [2021-12-27 21:35:18,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:35:18,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:35:18,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:35:18,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:35:18,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,806 INFO L137 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2021-12-27 21:35:18,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:35:18,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:35:18,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:35:18,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:35:18,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:35:18,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:35:18,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:35:18,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:35:18,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (1/1) ... [2021-12-27 21:35:18,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:35:18,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:35:18,849 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-27 21:35:18,853 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-27 21:35:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:35:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2021-12-27 21:35:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2021-12-27 21:35:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:35:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 21:35:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-27 21:35:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:35:18,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:35:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 21:35:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 21:35:18,936 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:35:18,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:35:19,030 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:35:19,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:35:19,034 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-27 21:35:19,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:35:19 BoogieIcfgContainer [2021-12-27 21:35:19,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:35:19,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:35:19,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:35:19,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:35:19,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:35:18" (1/3) ... [2021-12-27 21:35:19,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482310a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:35:19, skipping insertion in model container [2021-12-27 21:35:19,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:18" (2/3) ... [2021-12-27 21:35:19,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1482310a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:35:19, skipping insertion in model container [2021-12-27 21:35:19,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:35:19" (3/3) ... [2021-12-27 21:35:19,041 INFO L111 eAbstractionObserver]: Analyzing ICFG bor5.i [2021-12-27 21:35:19,044 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:35:19,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:35:19,071 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:35:19,075 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:35:19,075 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:35:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:35:19,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:19,095 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:19,096 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash 310067850, now seen corresponding path program 1 times [2021-12-27 21:35:19,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:35:19,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686695894] [2021-12-27 21:35:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:19,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:35:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:35:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:35:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-27 21:35:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:35:19,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:35:19,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686695894] [2021-12-27 21:35:19,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686695894] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:35:19,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:35:19,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 21:35:19,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476816358] [2021-12-27 21:35:19,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:35:19,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 21:35:19,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:35:19,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 21:35:19,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:35:19,361 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-27 21:35:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:19,377 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-27 21:35:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 21:35:19,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-27 21:35:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:19,383 INFO L225 Difference]: With dead ends: 51 [2021-12-27 21:35:19,383 INFO L226 Difference]: Without dead ends: 23 [2021-12-27 21:35:19,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-27 21:35:19,401 INFO L933 BasicCegarLoop]: 33 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, 33 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-27 21:35:19,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:35:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-27 21:35:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-27 21:35:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-27 21:35:19,425 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-27 21:35:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:19,425 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-27 21:35:19,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-27 21:35:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-27 21:35:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:35:19,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:19,426 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:19,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:35:19,427 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:19,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:19,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244726, now seen corresponding path program 1 times [2021-12-27 21:35:19,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:35:19,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418388061] [2021-12-27 21:35:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:19,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:35:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:35:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:35:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-27 21:35:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:35:19,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:35:19,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418388061] [2021-12-27 21:35:19,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418388061] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:35:19,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:35:19,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:35:19,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186120990] [2021-12-27 21:35:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:35:19,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:35:19,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:35:19,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:35:19,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:35:19,493 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-27 21:35:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:19,509 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-27 21:35:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:35:19,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-27 21:35:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:19,510 INFO L225 Difference]: With dead ends: 43 [2021-12-27 21:35:19,510 INFO L226 Difference]: Without dead ends: 25 [2021-12-27 21:35:19,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-27 21:35:19,512 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:19,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:35:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-27 21:35:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-27 21:35:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-27 21:35:19,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-27 21:35:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:19,517 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-27 21:35:19,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-27 21:35:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-27 21:35:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:35:19,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:19,518 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:19,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 21:35:19,519 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -789530644, now seen corresponding path program 1 times [2021-12-27 21:35:19,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:35:19,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402291139] [2021-12-27 21:35:19,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:19,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:35:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-27 21:35:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-27 21:35:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:35:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-27 21:35:19,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:35:19,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402291139] [2021-12-27 21:35:19,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402291139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:35:19,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313138816] [2021-12-27 21:35:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:19,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:35:19,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:35:19,644 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-27 21:35:19,645 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-27 21:35:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:19,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:35:19,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:35:19,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:35:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:35:19,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313138816] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:35:19,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:35:19,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-27 21:35:19,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814333572] [2021-12-27 21:35:19,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:35:19,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:35:19,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:35:19,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:35:19,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:35:19,854 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-27 21:35:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:19,915 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2021-12-27 21:35:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:35:19,916 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2021-12-27 21:35:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:19,916 INFO L225 Difference]: With dead ends: 47 [2021-12-27 21:35:19,916 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 21:35:19,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:35:19,918 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:19,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:35:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 21:35:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-27 21:35:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-27 21:35:19,922 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2021-12-27 21:35:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:19,923 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-27 21:35:19,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-27 21:35:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-27 21:35:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-27 21:35:19,924 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:19,924 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:19,943 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-27 21:35:20,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:35:20,141 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash 343299212, now seen corresponding path program 1 times [2021-12-27 21:35:20,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:35:20,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441122463] [2021-12-27 21:35:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:20,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:35:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:20,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-27 21:35:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-27 21:35:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-27 21:35:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:35:20,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:35:20,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441122463] [2021-12-27 21:35:20,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441122463] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:35:20,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648897752] [2021-12-27 21:35:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:20,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:35:20,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:35:20,284 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-27 21:35:20,286 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-27 21:35:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:20,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:35:20,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-27 21:35:20,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:35:20,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648897752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:35:20,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:35:20,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-27 21:35:20,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864574075] [2021-12-27 21:35:20,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:35:20,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:35:20,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:35:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:35:20,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:35:20,434 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:35:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:20,457 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-12-27 21:35:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:35:20,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2021-12-27 21:35:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:20,459 INFO L225 Difference]: With dead ends: 42 [2021-12-27 21:35:20,459 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 21:35:20,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:35:20,460 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:20,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:35:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 21:35:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-27 21:35:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-27 21:35:20,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-27 21:35:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:20,466 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-27 21:35:20,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:35:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-27 21:35:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-27 21:35:20,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:20,468 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:20,487 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-27 21:35:20,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-27 21:35:20,687 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1487527882, now seen corresponding path program 1 times [2021-12-27 21:35:20,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:35:20,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568909081] [2021-12-27 21:35:20,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:20,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:35:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 21:35:20,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-27 21:35:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 21:35:20,763 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-27 21:35:20,763 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-27 21:35:20,764 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 21:35:20,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 21:35:20,767 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-12-27 21:35:20,769 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 21:35:20,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:35:20 BoogieIcfgContainer [2021-12-27 21:35:20,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 21:35:20,794 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 21:35:20,794 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 21:35:20,794 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 21:35:20,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:35:19" (3/4) ... [2021-12-27 21:35:20,796 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-27 21:35:20,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 21:35:20,797 INFO L158 Benchmark]: Toolchain (without parser) took 2265.51ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 48.6MB in the beginning and 34.7MB in the end (delta: 13.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2021-12-27 21:35:20,797 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory was 50.1MB in the beginning and 50.1MB in the end (delta: 50.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:35:20,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.70ms. Allocated memory is still 67.1MB. Free memory was 48.5MB in the beginning and 49.9MB in the end (delta: -1.5MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2021-12-27 21:35:20,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.55ms. Allocated memory is still 67.1MB. Free memory was 49.7MB in the beginning and 48.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 21:35:20,798 INFO L158 Benchmark]: Boogie Preprocessor took 17.22ms. Allocated memory is still 67.1MB. Free memory was 48.1MB in the beginning and 46.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:35:20,798 INFO L158 Benchmark]: RCFGBuilder took 210.72ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 36.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-27 21:35:20,799 INFO L158 Benchmark]: TraceAbstraction took 1756.69ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.5MB in the beginning and 35.0MB in the end (delta: 475.9kB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2021-12-27 21:35:20,799 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 81.8MB. Free memory was 35.0MB in the beginning and 34.7MB in the end (delta: 288.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:35:20,800 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.14ms. Allocated memory is still 67.1MB. Free memory was 50.1MB in the beginning and 50.1MB in the end (delta: 50.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.70ms. Allocated memory is still 67.1MB. Free memory was 48.5MB in the beginning and 49.9MB in the end (delta: -1.5MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.55ms. Allocated memory is still 67.1MB. Free memory was 49.7MB in the beginning and 48.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.22ms. Allocated memory is still 67.1MB. Free memory was 48.1MB in the beginning and 46.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 210.72ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 36.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1756.69ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.5MB in the beginning and 35.0MB in the end (delta: 475.9kB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 81.8MB. Free memory was 35.0MB in the beginning and 34.7MB in the end (delta: 288.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [i=0, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=1, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=2, N=2, x={9:0}] [L40] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}] [L45] CALL, EXPR bor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-2, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res | x[i] [L24] i++ VAL [i=2, N=2, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}, x={9:0}] [L27] return res; VAL [\result=-4, i=2, N=2, res=4294967292, x={9:0}, x={9:0}] [L45] RET, EXPR bor(x) VAL [bor(x)=-4, i=2, N=2, x={9:0}] [L45] ret = bor(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [i=2, N=2, ret=-4, temp=-2, x={9:0}] [L48] CALL, EXPR bor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-3, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res | x[i] [L24] i++ VAL [i=2, N=2, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}, x={9:0}] [L27] return res; VAL [\result=0, i=2, N=2, res=0, x={9:0}, x={9:0}] [L48] RET, EXPR bor(x) VAL [bor(x)=0, i=2, N=2, ret=-4, temp=-2, x={9:0}] [L48] ret2 = bor(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [i=0, i=2, N=2, ret=-4, ret2=0, temp=-3, x={9:0}] [L50] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a4987addfe5f74a2ffcc1ac07d342e5a630d26b982b6fa887540d0e2c4f5965 [2021-12-27 21:35:22,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:35:22,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:35:22,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:35:22,897 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:35:22,897 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:35:22,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bor5.i [2021-12-27 21:35:22,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7804de2d/4b1352604ca944029a4b37730571cca2/FLAGbfb8ad165 [2021-12-27 21:35:23,276 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:35:23,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i [2021-12-27 21:35:23,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7804de2d/4b1352604ca944029a4b37730571cca2/FLAGbfb8ad165 [2021-12-27 21:35:23,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7804de2d/4b1352604ca944029a4b37730571cca2 [2021-12-27 21:35:23,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:35:23,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:35:23,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:35:23,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:35:23,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:35:23,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486204dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23, skipping insertion in model container [2021-12-27 21:35:23,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:35:23,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:35:23,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i[1364,1377] [2021-12-27 21:35:23,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:35:23,835 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:35:23,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bor5.i[1364,1377] [2021-12-27 21:35:23,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:35:23,914 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:35:23,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23 WrapperNode [2021-12-27 21:35:23,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:35:23,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:35:23,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:35:23,916 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:35:23,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,950 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2021-12-27 21:35:23,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:35:23,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:35:23,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:35:23,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:35:23,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:35:23,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:35:23,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:35:23,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:35:23,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (1/1) ... [2021-12-27 21:35:23,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:35:24,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:35:24,024 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-27 21:35:24,055 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-27 21:35:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:35:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2021-12-27 21:35:24,080 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2021-12-27 21:35:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-27 21:35:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 21:35:24,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-27 21:35:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:35:24,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:35:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 21:35:24,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-27 21:35:24,148 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:35:24,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:35:24,344 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:35:24,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:35:24,349 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-27 21:35:24,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:35:24 BoogieIcfgContainer [2021-12-27 21:35:24,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:35:24,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:35:24,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:35:24,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:35:24,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:35:23" (1/3) ... [2021-12-27 21:35:24,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d17909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:35:24, skipping insertion in model container [2021-12-27 21:35:24,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:23" (2/3) ... [2021-12-27 21:35:24,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d17909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:35:24, skipping insertion in model container [2021-12-27 21:35:24,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:35:24" (3/3) ... [2021-12-27 21:35:24,358 INFO L111 eAbstractionObserver]: Analyzing ICFG bor5.i [2021-12-27 21:35:24,362 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:35:24,362 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:35:24,409 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:35:24,422 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:35:24,423 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:35:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:35:24,439 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:24,440 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:24,440 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash 310067850, now seen corresponding path program 1 times [2021-12-27 21:35:24,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:24,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508140029] [2021-12-27 21:35:24,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:24,455 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:24,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:24,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:24,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-27 21:35:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:24,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-27 21:35:24,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-27 21:35:24,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:35:24,597 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:24,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508140029] [2021-12-27 21:35:24,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508140029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:35:24,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:35:24,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 21:35:24,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747457926] [2021-12-27 21:35:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:35:24,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 21:35:24,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:24,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 21:35:24,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 21:35:24,626 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:35:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:24,638 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-27 21:35:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 21:35:24,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-12-27 21:35:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:24,643 INFO L225 Difference]: With dead ends: 51 [2021-12-27 21:35:24,643 INFO L226 Difference]: Without dead ends: 23 [2021-12-27 21:35:24,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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-27 21:35:24,649 INFO L933 BasicCegarLoop]: 33 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, 33 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-27 21:35:24,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:35:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-27 21:35:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-27 21:35:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-27 21:35:24,683 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-27 21:35:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:24,683 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-27 21:35:24,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:35:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-27 21:35:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:35:24,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:24,687 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:24,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-27 21:35:24,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:24,894 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1979244726, now seen corresponding path program 1 times [2021-12-27 21:35:24,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:24,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566691361] [2021-12-27 21:35:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:24,896 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:24,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:24,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:24,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-27 21:35:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:24,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:35:24,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:35:25,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:35:25,035 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566691361] [2021-12-27 21:35:25,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566691361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:35:25,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:35:25,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:35:25,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130065483] [2021-12-27 21:35:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:35:25,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:35:25,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:35:25,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:35:25,038 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-27 21:35:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:25,062 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-27 21:35:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:35:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-27 21:35:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:25,065 INFO L225 Difference]: With dead ends: 43 [2021-12-27 21:35:25,065 INFO L226 Difference]: Without dead ends: 25 [2021-12-27 21:35:25,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-27 21:35:25,066 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:25,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:35:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-27 21:35:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-27 21:35:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-27 21:35:25,071 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-27 21:35:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:25,071 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-27 21:35:25,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-27 21:35:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-27 21:35:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:35:25,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:25,073 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:25,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-27 21:35:25,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:25,280 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash -789530644, now seen corresponding path program 1 times [2021-12-27 21:35:25,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:25,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029138281] [2021-12-27 21:35:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:25,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:25,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:25,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:25,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-27 21:35:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:25,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 21:35:25,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:35:25,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:35:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:35:25,525 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:25,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029138281] [2021-12-27 21:35:25,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029138281] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:35:25,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:35:25,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-27 21:35:25,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775883245] [2021-12-27 21:35:25,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:35:25,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:35:25,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:35:25,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:35:25,528 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-27 21:35:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:25,578 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-27 21:35:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:35:25,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2021-12-27 21:35:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:25,580 INFO L225 Difference]: With dead ends: 45 [2021-12-27 21:35:25,580 INFO L226 Difference]: Without dead ends: 27 [2021-12-27 21:35:25,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:35:25,581 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:25,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:35:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-27 21:35:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-12-27 21:35:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-27 21:35:25,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 31 [2021-12-27 21:35:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:25,586 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-27 21:35:25,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-27 21:35:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-27 21:35:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-27 21:35:25,587 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:25,587 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:25,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-27 21:35:25,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:25,793 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash 64401422, now seen corresponding path program 2 times [2021-12-27 21:35:25,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:25,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313554803] [2021-12-27 21:35:25,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:35:25,795 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:25,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:25,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:25,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-27 21:35:25,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-27 21:35:25,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:35:25,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:35:25,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-27 21:35:25,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:35:25,931 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:25,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313554803] [2021-12-27 21:35:25,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313554803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:35:25,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:35:25,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:35:25,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034635567] [2021-12-27 21:35:25,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:35:25,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:35:25,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:25,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:35:25,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:35:25,937 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-27 21:35:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:25,978 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2021-12-27 21:35:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:35:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-12-27 21:35:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:25,979 INFO L225 Difference]: With dead ends: 45 [2021-12-27 21:35:25,979 INFO L226 Difference]: Without dead ends: 28 [2021-12-27 21:35:25,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-27 21:35:25,981 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:25,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:35:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-27 21:35:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-27 21:35:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-27 21:35:25,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2021-12-27 21:35:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:25,986 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-27 21:35:25,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-27 21:35:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-27 21:35:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-27 21:35:25,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:25,987 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:25,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-27 21:35:26,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:26,194 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash 343299212, now seen corresponding path program 1 times [2021-12-27 21:35:26,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:26,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095614276] [2021-12-27 21:35:26,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:26,198 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:26,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:26,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:26,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-27 21:35:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:26,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-27 21:35:26,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-27 21:35:26,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:35:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-27 21:35:26,685 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:26,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095614276] [2021-12-27 21:35:26,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095614276] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:35:26,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:35:26,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-27 21:35:26,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581149106] [2021-12-27 21:35:26,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:35:26,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-27 21:35:26,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-27 21:35:26,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:35:26,687 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-27 21:35:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:26,876 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2021-12-27 21:35:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:35:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2021-12-27 21:35:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:26,877 INFO L225 Difference]: With dead ends: 65 [2021-12-27 21:35:26,877 INFO L226 Difference]: Without dead ends: 52 [2021-12-27 21:35:26,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-12-27 21:35:26,878 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:26,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:35:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-27 21:35:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2021-12-27 21:35:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-27 21:35:26,884 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-27 21:35:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:26,885 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-27 21:35:26,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-27 21:35:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-27 21:35:26,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-27 21:35:26,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:26,886 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:26,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-27 21:35:27,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:27,093 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1487527882, now seen corresponding path program 1 times [2021-12-27 21:35:27,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:27,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777132505] [2021-12-27 21:35:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:35:27,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:27,096 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:27,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-27 21:35:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:35:27,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-27 21:35:27,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:27,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:27,513 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:35:27,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-12-27 21:35:27,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:27,751 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:35:27,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2021-12-27 21:35:27,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:27,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 21:35:27,856 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:35:27,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2021-12-27 21:35:28,038 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:35:28,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2021-12-27 21:35:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-27 21:35:28,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:35:29,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 143 treesize of output 111 [2021-12-27 21:35:29,523 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-27 21:35:29,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 173 [2021-12-27 21:35:29,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 37 [2021-12-27 21:35:29,558 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-27 21:35:29,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2021-12-27 21:35:34,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 143 treesize of output 111 [2021-12-27 21:35:34,116 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-27 21:35:34,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 1 [2021-12-27 21:35:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 14 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-27 21:35:34,424 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:34,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777132505] [2021-12-27 21:35:34,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777132505] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:35:34,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:35:34,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2021-12-27 21:35:34,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126667228] [2021-12-27 21:35:34,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:35:34,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-27 21:35:34,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:34,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-27 21:35:34,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1455, Unknown=1, NotChecked=0, Total=1640 [2021-12-27 21:35:34,426 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-27 21:35:36,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-27 21:35:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:39,423 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2021-12-27 21:35:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-27 21:35:39,424 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2021-12-27 21:35:39,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:39,426 INFO L225 Difference]: With dead ends: 87 [2021-12-27 21:35:39,426 INFO L226 Difference]: Without dead ends: 83 [2021-12-27 21:35:39,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=396, Invalid=2683, Unknown=1, NotChecked=0, Total=3080 [2021-12-27 21:35:39,427 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 97 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:39,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 233 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 678 Invalid, 1 Unknown, 66 Unchecked, 3.7s Time] [2021-12-27 21:35:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-27 21:35:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2021-12-27 21:35:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2021-12-27 21:35:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2021-12-27 21:35:39,450 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2021-12-27 21:35:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:39,452 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-27 21:35:39,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-27 21:35:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2021-12-27 21:35:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-27 21:35:39,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:39,455 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:39,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-27 21:35:39,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:39,663 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:39,665 INFO L85 PathProgramCache]: Analyzing trace with hash 380877448, now seen corresponding path program 2 times [2021-12-27 21:35:39,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:39,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051062502] [2021-12-27 21:35:39,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:35:39,667 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:39,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:39,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-27 21:35:39,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:35:39,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:35:39,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-27 21:35:39,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:35:39,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:35:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:35:40,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:40,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051062502] [2021-12-27 21:35:40,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051062502] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:35:40,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:35:40,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2021-12-27 21:35:40,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702663428] [2021-12-27 21:35:40,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:35:40,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:35:40,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:40,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:35:40,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:35:40,341 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-27 21:35:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:40,732 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2021-12-27 21:35:40,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-27 21:35:40,733 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2021-12-27 21:35:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:40,734 INFO L225 Difference]: With dead ends: 104 [2021-12-27 21:35:40,734 INFO L226 Difference]: Without dead ends: 78 [2021-12-27 21:35:40,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-12-27 21:35:40,735 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 77 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:40,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 172 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:35:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-27 21:35:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2021-12-27 21:35:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-27 21:35:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-12-27 21:35:40,745 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2021-12-27 21:35:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:40,745 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-12-27 21:35:40,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-27 21:35:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-12-27 21:35:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-27 21:35:40,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:40,750 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:40,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-27 21:35:40,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:40,957 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1155110252, now seen corresponding path program 3 times [2021-12-27 21:35:40,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:40,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648639703] [2021-12-27 21:35:40,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:35:40,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:40,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:40,969 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:40,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-27 21:35:41,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-27 21:35:41,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:35:41,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-27 21:35:41,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:35:41,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:35:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:35:41,353 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:41,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648639703] [2021-12-27 21:35:41,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648639703] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:35:41,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:35:41,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-12-27 21:35:41,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596445962] [2021-12-27 21:35:41,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:35:41,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-27 21:35:41,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:41,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-27 21:35:41,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:35:41,354 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-27 21:35:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:41,571 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2021-12-27 21:35:41,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:35:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2021-12-27 21:35:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:41,572 INFO L225 Difference]: With dead ends: 77 [2021-12-27 21:35:41,572 INFO L226 Difference]: Without dead ends: 58 [2021-12-27 21:35:41,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:35:41,573 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:41,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 125 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:35:41,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-27 21:35:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-27 21:35:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-27 21:35:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-12-27 21:35:41,579 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2021-12-27 21:35:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:41,580 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-12-27 21:35:41,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-27 21:35:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-12-27 21:35:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-27 21:35:41,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:41,581 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:41,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-27 21:35:41,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:41,788 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash -83406906, now seen corresponding path program 4 times [2021-12-27 21:35:41,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:41,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349349043] [2021-12-27 21:35:41,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-27 21:35:41,789 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:41,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:41,790 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:41,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-27 21:35:41,846 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-27 21:35:41,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:35:41,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-27 21:35:41,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-27 21:35:42,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:35:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-27 21:35:42,499 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:42,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349349043] [2021-12-27 21:35:42,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349349043] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:35:42,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:35:42,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-12-27 21:35:42,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960755408] [2021-12-27 21:35:42,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:35:42,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-27 21:35:42,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-27 21:35:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-12-27 21:35:42,501 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-27 21:35:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:42,690 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-27 21:35:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:35:42,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2021-12-27 21:35:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:42,691 INFO L225 Difference]: With dead ends: 64 [2021-12-27 21:35:42,691 INFO L226 Difference]: Without dead ends: 33 [2021-12-27 21:35:42,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-12-27 21:35:42,692 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:42,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 102 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:35:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-27 21:35:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-27 21:35:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-27 21:35:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-27 21:35:42,696 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2021-12-27 21:35:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:42,696 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-27 21:35:42,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-27 21:35:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-27 21:35:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-27 21:35:42,697 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:42,697 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:42,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-27 21:35:42,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:42,906 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1254464106, now seen corresponding path program 5 times [2021-12-27 21:35:42,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:42,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254583778] [2021-12-27 21:35:42,907 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-27 21:35:42,908 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:42,909 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-27 21:35:42,980 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-27 21:35:42,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:35:42,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-27 21:35:42,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-27 21:35:43,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:35:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-27 21:35:43,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:35:43,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254583778] [2021-12-27 21:35:43,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254583778] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:35:43,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:35:43,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2021-12-27 21:35:43,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047305157] [2021-12-27 21:35:43,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:35:43,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-27 21:35:43,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:35:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-27 21:35:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-27 21:35:43,436 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-27 21:35:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:35:43,890 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2021-12-27 21:35:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-27 21:35:43,891 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2021-12-27 21:35:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:35:43,892 INFO L225 Difference]: With dead ends: 101 [2021-12-27 21:35:43,892 INFO L226 Difference]: Without dead ends: 82 [2021-12-27 21:35:43,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2021-12-27 21:35:43,892 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 104 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:35:43,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 152 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:35:43,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-27 21:35:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2021-12-27 21:35:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-27 21:35:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2021-12-27 21:35:43,899 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 49 [2021-12-27 21:35:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:35:43,905 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-12-27 21:35:43,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-27 21:35:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2021-12-27 21:35:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-27 21:35:43,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:35:43,907 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:35:43,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-27 21:35:44,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:35:44,115 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:35:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:35:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash 715974184, now seen corresponding path program 6 times [2021-12-27 21:35:44,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:35:44,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290752633] [2021-12-27 21:35:44,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-27 21:35:44,116 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:35:44,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:35:44,117 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:35:44,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-27 21:35:44,302 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-12-27 21:35:44,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:35:44,309 WARN L261 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-27 21:35:44,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:35:44,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-27 21:35:44,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:44,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:44,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:44,780 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:35:44,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 37 [2021-12-27 21:35:45,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 21:35:45,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 21:35:45,076 INFO L353 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-27 21:35:45,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 74 [2021-12-27 21:35:45,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,249 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:35:45,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 51 [2021-12-27 21:35:45,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 21:35:45,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 21:35:45,369 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:35:45,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 63 [2021-12-27 21:35:45,760 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 21:35:45,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 34 [2021-12-27 21:35:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-27 21:35:45,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:36:11,197 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-27 21:36:11,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52882502 treesize of output 34591430