./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/reducercommutativity/rangesum20.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 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 22:16:53,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 22:16:53,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 22:16:53,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 22:16:53,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 22:16:53,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 22:16:53,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 22:16:53,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 22:16:53,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 22:16:53,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 22:16:53,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 22:16:53,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 22:16:53,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 22:16:53,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 22:16:53,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 22:16:53,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 22:16:53,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 22:16:53,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 22:16:53,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 22:16:53,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 22:16:53,655 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 22:16:53,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 22:16:53,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 22:16:53,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 22:16:53,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 22:16:53,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 22:16:53,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 22:16:53,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 22:16:53,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 22:16:53,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 22:16:53,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 22:16:53,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 22:16:53,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 22:16:53,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 22:16:53,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 22:16:53,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 22:16:53,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 22:16:53,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 22:16:53,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 22:16:53,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 22:16:53,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 22:16:53,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 22:16:53,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 22:16:53,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 22:16:53,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 22:16:53,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 22:16:53,697 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 22:16:53,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 22:16:53,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 22:16:53,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 22:16:53,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 22:16:53,698 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 22:16:53,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 22:16:53,698 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 22:16:53,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 22:16:53,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 22:16:53,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 22:16:53,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 22:16:53,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 22:16:53,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 22:16:53,699 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 22:16:53,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 22:16:53,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 22:16:53,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 22:16:53,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 22:16:53,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 22:16:53,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 22:16:53,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:16:53,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 22:16:53,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 22:16:53,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 22:16:53,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 22:16:53,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 22:16:53,701 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 22:16:53,701 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 22:16:53,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 22:16:53,702 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 -> 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a [2022-07-11 22:16:53,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 22:16:53,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 22:16:53,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 22:16:53,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 22:16:53,931 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 22:16:53,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum20.i [2022-07-11 22:16:53,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fcd5e48/b1d5d92c89414472b426aa329127608a/FLAGbf5c21adf [2022-07-11 22:16:54,346 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 22:16:54,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i [2022-07-11 22:16:54,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fcd5e48/b1d5d92c89414472b426aa329127608a/FLAGbf5c21adf [2022-07-11 22:16:54,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66fcd5e48/b1d5d92c89414472b426aa329127608a [2022-07-11 22:16:54,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 22:16:54,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 22:16:54,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 22:16:54,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 22:16:54,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 22:16:54,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@faa6c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54, skipping insertion in model container [2022-07-11 22:16:54,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 22:16:54,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 22:16:54,511 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/reducercommutativity/rangesum20.i[1465,1478] [2022-07-11 22:16:54,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:16:54,523 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 22:16:54,536 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/reducercommutativity/rangesum20.i[1465,1478] [2022-07-11 22:16:54,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:16:54,545 INFO L208 MainTranslator]: Completed translation [2022-07-11 22:16:54,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54 WrapperNode [2022-07-11 22:16:54,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 22:16:54,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 22:16:54,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 22:16:54,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 22:16:54,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,568 INFO L137 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-07-11 22:16:54,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 22:16:54,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 22:16:54,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 22:16:54,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 22:16:54,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 22:16:54,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 22:16:54,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 22:16:54,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 22:16:54,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (1/1) ... [2022-07-11 22:16:54,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:16:54,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:54,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 22:16:54,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 22:16:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 22:16:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 22:16:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 22:16:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 22:16:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 22:16:54,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 22:16:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 22:16:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2022-07-11 22:16:54,655 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2022-07-11 22:16:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 22:16:54,704 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 22:16:54,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 22:16:54,808 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 22:16:54,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 22:16:54,813 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 22:16:54,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:16:54 BoogieIcfgContainer [2022-07-11 22:16:54,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 22:16:54,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 22:16:54,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 22:16:54,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 22:16:54,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 10:16:54" (1/3) ... [2022-07-11 22:16:54,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331f7133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:16:54, skipping insertion in model container [2022-07-11 22:16:54,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:16:54" (2/3) ... [2022-07-11 22:16:54,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331f7133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:16:54, skipping insertion in model container [2022-07-11 22:16:54,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:16:54" (3/3) ... [2022-07-11 22:16:54,820 INFO L111 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2022-07-11 22:16:54,830 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 22:16:54,830 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 22:16:54,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 22:16:54,866 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58f95e3a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@220a52f0 [2022-07-11 22:16:54,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 22:16:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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) [2022-07-11 22:16:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 22:16:54,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:54,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:16:54,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2022-07-11 22:16:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:54,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094520095] [2022-07-11 22:16:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 22:16:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 22:16:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 22:16:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:16:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:55,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094520095] [2022-07-11 22:16:55,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094520095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:16:55,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:16:55,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:16:55,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277286625] [2022-07-11 22:16:55,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:16:55,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:16:55,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:55,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:16:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:16:55,076 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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 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) [2022-07-11 22:16:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:55,104 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2022-07-11 22:16:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:16:55,107 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 [2022-07-11 22:16:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:55,115 INFO L225 Difference]: With dead ends: 54 [2022-07-11 22:16:55,115 INFO L226 Difference]: Without dead ends: 26 [2022-07-11 22:16:55,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:16:55,124 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:55,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-11 22:16:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-11 22:16:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 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) [2022-07-11 22:16:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-07-11 22:16:55,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2022-07-11 22:16:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:55,154 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-11 22:16:55,155 INFO L496 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) [2022-07-11 22:16:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-07-11 22:16:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 22:16:55,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:55,156 INFO L195 NwaCegarLoop]: 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] [2022-07-11 22:16:55,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 22:16:55,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2022-07-11 22:16:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:55,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817588048] [2022-07-11 22:16:55,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:55,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-11 22:16:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:55,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817588048] [2022-07-11 22:16:55,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-11 22:16:55,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215984986] [2022-07-11 22:16:55,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:55,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:55,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:55,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:55,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 22:16:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 22:16:55,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 22:16:55,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:16:55,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215984986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:16:55,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:16:55,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:16:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427831323] [2022-07-11 22:16:55,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:16:55,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:16:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:55,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:16:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:16:55,318 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 22:16:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:55,330 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-07-11 22:16:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:16:55,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-07-11 22:16:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:55,331 INFO L225 Difference]: With dead ends: 46 [2022-07-11 22:16:55,331 INFO L226 Difference]: Without dead ends: 28 [2022-07-11 22:16:55,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:16:55,332 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:55,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:55,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-11 22:16:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-11 22:16:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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) [2022-07-11 22:16:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-07-11 22:16:55,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2022-07-11 22:16:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:55,337 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-07-11 22:16:55,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 22:16:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-07-11 22:16:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 22:16:55,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:55,339 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-11 22:16:55,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:55,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:55,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2022-07-11 22:16:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118906639] [2022-07-11 22:16:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-11 22:16:55,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:55,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118906639] [2022-07-11 22:16:55,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-11 22:16:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545670941] [2022-07-11 22:16:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:55,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:55,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 22:16:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 22:16:55,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-11 22:16:55,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:16:55,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545670941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:16:55,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:16:55,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:16:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921539865] [2022-07-11 22:16:55,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:16:55,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:16:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:55,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:16:55,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:16:55,717 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-07-11 22:16:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:55,725 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-07-11 22:16:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:16:55,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 40 [2022-07-11 22:16:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:55,727 INFO L225 Difference]: With dead ends: 44 [2022-07-11 22:16:55,727 INFO L226 Difference]: Without dead ends: 29 [2022-07-11 22:16:55,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:16:55,728 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:55,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-11 22:16:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-11 22:16:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2022-07-11 22:16:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-11 22:16:55,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2022-07-11 22:16:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:55,733 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-11 22:16:55,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-07-11 22:16:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-11 22:16:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-11 22:16:55,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:55,735 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-07-11 22:16:55,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:55,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-11 22:16:55,952 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2022-07-11 22:16:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:55,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743588989] [2022-07-11 22:16:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-11 22:16:55,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:55,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743588989] [2022-07-11 22:16:55,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-11 22:16:55,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748645784] [2022-07-11 22:16:55,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:55,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:55,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:55,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 22:16:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 22:16:56,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-11 22:16:56,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:16:56,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748645784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:16:56,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:16:56,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:16:56,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961610211] [2022-07-11 22:16:56,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:16:56,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:16:56,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:56,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:16:56,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:16:56,062 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 22:16:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:56,070 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-07-11 22:16:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:16:56,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-07-11 22:16:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:56,073 INFO L225 Difference]: With dead ends: 55 [2022-07-11 22:16:56,073 INFO L226 Difference]: Without dead ends: 34 [2022-07-11 22:16:56,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:16:56,074 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:56,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-11 22:16:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-11 22:16:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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) [2022-07-11 22:16:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-07-11 22:16:56,080 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2022-07-11 22:16:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:56,080 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-07-11 22:16:56,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 22:16:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-07-11 22:16:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-11 22:16:56,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:56,081 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-07-11 22:16:56,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:56,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:56,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2022-07-11 22:16:56,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:56,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597648620] [2022-07-11 22:16:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-11 22:16:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 22:16:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-11 22:16:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:16:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:56,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597648620] [2022-07-11 22:16:56,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597648620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:16:56,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210086579] [2022-07-11 22:16:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:56,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:56,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:56,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 22:16:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 22:16:56,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 22:16:56,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:16:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-11 22:16:56,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210086579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:16:56,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:16:56,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-07-11 22:16:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437065032] [2022-07-11 22:16:56,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:16:56,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 22:16:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:56,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 22:16:56,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-11 22:16:56,494 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-07-11 22:16:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:56,526 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-07-11 22:16:56,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 22:16:56,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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 42 [2022-07-11 22:16:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:56,527 INFO L225 Difference]: With dead ends: 69 [2022-07-11 22:16:56,527 INFO L226 Difference]: Without dead ends: 42 [2022-07-11 22:16:56,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-11 22:16:56,529 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:56,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-11 22:16:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-07-11 22:16:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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) [2022-07-11 22:16:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-07-11 22:16:56,537 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2022-07-11 22:16:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:56,537 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-07-11 22:16:56,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-07-11 22:16:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-07-11 22:16:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 22:16:56,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:56,540 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:16:56,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:56,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:56,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash -604386836, now seen corresponding path program 2 times [2022-07-11 22:16:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:56,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290725711] [2022-07-11 22:16:56,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 22:16:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-11 22:16:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-11 22:16:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-11 22:16:56,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:56,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290725711] [2022-07-11 22:16:56,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290725711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:16:56,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062879434] [2022-07-11 22:16:56,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:16:56,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:56,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:56,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:56,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 22:16:56,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:16:56,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:16:56,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 22:16:56,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-11 22:16:56,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:16:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-11 22:16:56,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062879434] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:16:56,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:16:56,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2022-07-11 22:16:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254023217] [2022-07-11 22:16:56,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:16:56,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 22:16:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:56,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 22:16:56,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-11 22:16:56,999 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-11 22:16:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:57,059 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-07-11 22:16:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 22:16:57,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2022-07-11 22:16:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:57,062 INFO L225 Difference]: With dead ends: 86 [2022-07-11 22:16:57,062 INFO L226 Difference]: Without dead ends: 56 [2022-07-11 22:16:57,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-11 22:16:57,065 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:57,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-11 22:16:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-07-11 22:16:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 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) [2022-07-11 22:16:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-07-11 22:16:57,079 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 57 [2022-07-11 22:16:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:57,081 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-07-11 22:16:57,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-11 22:16:57,082 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-07-11 22:16:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-11 22:16:57,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:57,085 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:16:57,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:57,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:57,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:57,286 INFO L85 PathProgramCache]: Analyzing trace with hash 948362870, now seen corresponding path program 1 times [2022-07-11 22:16:57,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:57,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820643304] [2022-07-11 22:16:57,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:57,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:57,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:16:57,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114502888] [2022-07-11 22:16:57,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:57,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:57,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:57,313 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:57,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 22:16:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:16:57,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 22:16:57,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-11 22:16:57,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:16:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-11 22:16:57,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:57,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820643304] [2022-07-11 22:16:57,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:16:57,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114502888] [2022-07-11 22:16:57,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114502888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:16:57,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:16:57,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-07-11 22:16:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725005024] [2022-07-11 22:16:57,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:16:57,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-11 22:16:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-11 22:16:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-07-11 22:16:57,658 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 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) [2022-07-11 22:16:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:57,718 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-07-11 22:16:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-11 22:16:57,718 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 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 78 [2022-07-11 22:16:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:57,719 INFO L225 Difference]: With dead ends: 99 [2022-07-11 22:16:57,719 INFO L226 Difference]: Without dead ends: 71 [2022-07-11 22:16:57,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-07-11 22:16:57,720 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:57,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 210 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-11 22:16:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-11 22:16:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 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) [2022-07-11 22:16:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-07-11 22:16:57,727 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 78 [2022-07-11 22:16:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:57,727 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-07-11 22:16:57,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 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) [2022-07-11 22:16:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-07-11 22:16:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-11 22:16:57,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:57,728 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:16:57,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:57,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:57,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -102117622, now seen corresponding path program 2 times [2022-07-11 22:16:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152658021] [2022-07-11 22:16:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:57,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:16:57,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791826351] [2022-07-11 22:16:57,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:16:57,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:57,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:57,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:57,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 22:16:58,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:16:58,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:16:58,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 22:16:58,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2022-07-11 22:16:58,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:16:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-07-11 22:16:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:58,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152658021] [2022-07-11 22:16:58,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:16:58,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791826351] [2022-07-11 22:16:58,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791826351] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:16:58,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:16:58,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-11 22:16:58,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248528299] [2022-07-11 22:16:58,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:16:58,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 22:16:58,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:58,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 22:16:58,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-11 22:16:58,149 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:16:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:58,176 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2022-07-11 22:16:58,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 22:16:58,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 98 [2022-07-11 22:16:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:58,178 INFO L225 Difference]: With dead ends: 109 [2022-07-11 22:16:58,178 INFO L226 Difference]: Without dead ends: 83 [2022-07-11 22:16:58,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-11 22:16:58,179 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:58,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-11 22:16:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-11 22:16:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 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) [2022-07-11 22:16:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-11 22:16:58,185 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 98 [2022-07-11 22:16:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:58,185 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-11 22:16:58,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:16:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-11 22:16:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-11 22:16:58,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:58,186 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 18, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:16:58,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:58,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:58,399 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash 944957770, now seen corresponding path program 3 times [2022-07-11 22:16:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:58,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689963064] [2022-07-11 22:16:58,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:58,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:58,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:16:58,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606077514] [2022-07-11 22:16:58,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:16:58,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:58,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:58,425 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:58,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 22:16:58,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 22:16:58,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:16:58,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 22:16:58,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 332 proven. 1 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-07-11 22:16:58,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:16:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2022-07-11 22:16:58,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:58,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689963064] [2022-07-11 22:16:58,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:16:58,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606077514] [2022-07-11 22:16:58,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606077514] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:16:58,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:16:58,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-11 22:16:58,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627868558] [2022-07-11 22:16:58,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:16:58,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 22:16:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:58,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 22:16:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-11 22:16:58,558 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 22:16:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:58,572 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-07-11 22:16:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 22:16:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 134 [2022-07-11 22:16:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:58,574 INFO L225 Difference]: With dead ends: 121 [2022-07-11 22:16:58,574 INFO L226 Difference]: Without dead ends: 89 [2022-07-11 22:16:58,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-11 22:16:58,577 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:58,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-11 22:16:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-11 22:16:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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) [2022-07-11 22:16:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-07-11 22:16:58,599 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 134 [2022-07-11 22:16:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:58,600 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-07-11 22:16:58,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 22:16:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-07-11 22:16:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-11 22:16:58,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:58,601 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 18, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:16:58,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:58,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-11 22:16:58,802 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1134191088, now seen corresponding path program 4 times [2022-07-11 22:16:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:58,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116862239] [2022-07-11 22:16:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:58,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:16:58,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422972417] [2022-07-11 22:16:58,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 22:16:58,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:58,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:58,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:58,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-11 22:16:58,915 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 22:16:58,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:16:58,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 22:16:58,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 309 proven. 57 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2022-07-11 22:16:58,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:16:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2022-07-11 22:16:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:59,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116862239] [2022-07-11 22:16:59,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:16:59,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422972417] [2022-07-11 22:16:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422972417] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:16:59,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:16:59,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-07-11 22:16:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277461540] [2022-07-11 22:16:59,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:16:59,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-11 22:16:59,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-11 22:16:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-11 22:16:59,032 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:16:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:59,067 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2022-07-11 22:16:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 22:16:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 140 [2022-07-11 22:16:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:59,068 INFO L225 Difference]: With dead ends: 148 [2022-07-11 22:16:59,068 INFO L226 Difference]: Without dead ends: 104 [2022-07-11 22:16:59,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-11 22:16:59,070 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:59,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-11 22:16:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-11 22:16:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 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) [2022-07-11 22:16:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2022-07-11 22:16:59,086 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 140 [2022-07-11 22:16:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:59,087 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2022-07-11 22:16:59,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:16:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-07-11 22:16:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-11 22:16:59,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:59,090 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 33, 20, 20, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:16:59,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:59,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-11 22:16:59,303 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:59,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:59,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1554862939, now seen corresponding path program 5 times [2022-07-11 22:16:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:59,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168885470] [2022-07-11 22:16:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:59,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:16:59,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023090877] [2022-07-11 22:16:59,326 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 22:16:59,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:59,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:59,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:59,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 22:16:59,402 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-11 22:16:59,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:16:59,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 22:16:59,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 1023 proven. 26 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2022-07-11 22:16:59,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:16:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 107 proven. 378 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2022-07-11 22:16:59,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:16:59,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168885470] [2022-07-11 22:16:59,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:16:59,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023090877] [2022-07-11 22:16:59,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023090877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:16:59,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:16:59,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-07-11 22:16:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118312868] [2022-07-11 22:16:59,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:16:59,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 22:16:59,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:16:59,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 22:16:59,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-11 22:16:59,501 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:16:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:16:59,536 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2022-07-11 22:16:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 22:16:59,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 185 [2022-07-11 22:16:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:16:59,537 INFO L225 Difference]: With dead ends: 187 [2022-07-11 22:16:59,538 INFO L226 Difference]: Without dead ends: 128 [2022-07-11 22:16:59,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-11 22:16:59,538 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:16:59,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 122 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:16:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-11 22:16:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-11 22:16:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.1056910569105691) internal successors, (136), 123 states have internal predecessors, (136), 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) [2022-07-11 22:16:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2022-07-11 22:16:59,544 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 185 [2022-07-11 22:16:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:16:59,544 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2022-07-11 22:16:59,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 22:16:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2022-07-11 22:16:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-11 22:16:59,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:16:59,546 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:16:59,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-11 22:16:59,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-11 22:16:59,759 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:16:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:16:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash -290085595, now seen corresponding path program 6 times [2022-07-11 22:16:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:16:59,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708943600] [2022-07-11 22:16:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:16:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:16:59,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:16:59,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744653150] [2022-07-11 22:16:59,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 22:16:59,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:16:59,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:16:59,784 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:16:59,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 22:16:59,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-07-11 22:16:59,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:16:59,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 22:16:59,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:16:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5921 backedges. 2490 proven. 16 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2022-07-11 22:16:59,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:17:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5921 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2022-07-11 22:17:00,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:17:00,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708943600] [2022-07-11 22:17:00,016 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:17:00,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744653150] [2022-07-11 22:17:00,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744653150] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:17:00,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:17:00,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-11 22:17:00,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297141727] [2022-07-11 22:17:00,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:17:00,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 22:17:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:17:00,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 22:17:00,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-11 22:17:00,018 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 22:17:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:17:00,044 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2022-07-11 22:17:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 22:17:00,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 257 [2022-07-11 22:17:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:17:00,046 INFO L225 Difference]: With dead ends: 211 [2022-07-11 22:17:00,046 INFO L226 Difference]: Without dead ends: 140 [2022-07-11 22:17:00,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-11 22:17:00,047 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:17:00,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 178 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:17:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-11 22:17:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-11 22:17:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.0962962962962963) internal successors, (148), 135 states have internal predecessors, (148), 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) [2022-07-11 22:17:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2022-07-11 22:17:00,051 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 257 [2022-07-11 22:17:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:17:00,052 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2022-07-11 22:17:00,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 22:17:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2022-07-11 22:17:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-11 22:17:00,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:17:00,054 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:17:00,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-11 22:17:00,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-11 22:17:00,271 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:17:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:17:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1965956505, now seen corresponding path program 7 times [2022-07-11 22:17:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:17:00,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439339203] [2022-07-11 22:17:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:17:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:17:00,295 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:17:00,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067868573] [2022-07-11 22:17:00,295 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 22:17:00,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:17:00,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:17:00,296 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:17:00,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-11 22:17:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:17:00,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 22:17:00,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:17:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 2490 proven. 100 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2022-07-11 22:17:00,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:17:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2022-07-11 22:17:00,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:17:00,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439339203] [2022-07-11 22:17:00,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 22:17:00,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067868573] [2022-07-11 22:17:00,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067868573] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:17:00,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:17:00,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-07-11 22:17:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733204614] [2022-07-11 22:17:00,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:17:00,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-11 22:17:00,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:17:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-11 22:17:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2022-07-11 22:17:00,664 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 22:17:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:17:00,704 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2022-07-11 22:17:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-11 22:17:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 269 [2022-07-11 22:17:00,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:17:00,705 INFO L225 Difference]: With dead ends: 229 [2022-07-11 22:17:00,705 INFO L226 Difference]: Without dead ends: 158 [2022-07-11 22:17:00,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 516 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2022-07-11 22:17:00,706 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:17:00,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 103 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:17:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-11 22:17:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-07-11 22:17:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0849673202614378) internal successors, (166), 153 states have internal predecessors, (166), 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) [2022-07-11 22:17:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2022-07-11 22:17:00,711 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 269 [2022-07-11 22:17:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:17:00,712 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2022-07-11 22:17:00,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 22:17:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2022-07-11 22:17:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-07-11 22:17:00,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:17:00,714 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:17:00,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 22:17:00,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-11 22:17:00,924 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:17:00,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:17:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1541531655, now seen corresponding path program 8 times [2022-07-11 22:17:00,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:17:00,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494706032] [2022-07-11 22:17:00,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:17:00,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:17:00,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 22:17:00,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597924441] [2022-07-11 22:17:00,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:17:00,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:17:00,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:17:00,948 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 22:17:00,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-11 22:17:06,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:17:06,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-11 22:17:06,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 22:17:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 22:17:13,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-11 22:17:13,215 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 22:17:13,215 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 22:17:13,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-11 22:17:13,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-11 22:17:13,441 INFO L356 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1, 1, 1] [2022-07-11 22:17:13,443 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 22:17:13,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 10:17:13 BoogieIcfgContainer [2022-07-11 22:17:13,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 22:17:13,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 22:17:13,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 22:17:13,574 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 22:17:13,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:16:54" (3/4) ... [2022-07-11 22:17:13,575 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-11 22:17:13,662 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 22:17:13,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 22:17:13,662 INFO L158 Benchmark]: Toolchain (without parser) took 19299.07ms. Allocated memory was 86.0MB in the beginning and 180.4MB in the end (delta: 94.4MB). Free memory was 47.0MB in the beginning and 105.4MB in the end (delta: -58.4MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2022-07-11 22:17:13,663 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 22:17:13,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.63ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 46.8MB in the beginning and 99.4MB in the end (delta: -52.6MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-07-11 22:17:13,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.60ms. Allocated memory is still 123.7MB. Free memory was 99.4MB in the beginning and 97.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 22:17:13,664 INFO L158 Benchmark]: Boogie Preprocessor took 29.85ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 96.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 22:17:13,664 INFO L158 Benchmark]: RCFGBuilder took 214.53ms. Allocated memory is still 123.7MB. Free memory was 96.5MB in the beginning and 84.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-11 22:17:13,664 INFO L158 Benchmark]: TraceAbstraction took 18757.34ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 84.0MB in the beginning and 119.0MB in the end (delta: -35.0MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2022-07-11 22:17:13,665 INFO L158 Benchmark]: Witness Printer took 88.72ms. Allocated memory is still 180.4MB. Free memory was 119.0MB in the beginning and 105.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-11 22:17:13,670 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.16ms. Allocated memory is still 86.0MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.63ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 46.8MB in the beginning and 99.4MB in the end (delta: -52.6MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.60ms. Allocated memory is still 123.7MB. Free memory was 99.4MB in the beginning and 97.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.85ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 96.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 214.53ms. Allocated memory is still 123.7MB. Free memory was 96.5MB in the beginning and 84.8MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18757.34ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 84.0MB in the beginning and 119.0MB in the end (delta: -35.0MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 88.72ms. Allocated memory is still 180.4MB. Free memory was 119.0MB in the beginning and 105.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={3:0}, x={3:0}] [L17] COND FALSE !(i < 20) VAL [i=20, x={3:0}, x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=2147483633, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=2147483633, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=2147483633, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=4294967265, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=4294967265, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=4294967265, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=4294967294, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=4294967294, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=4294967294, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=6442450929, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=6442450929, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=6442450929, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=8589934563, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=8589934563, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=8589934563, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=6442450915, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=6442450915, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=6442450915, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=4294967268, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=4294967268, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=4294967268, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=2147483622, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=2147483622, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=2147483622, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-26, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=-26, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-26, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-2, cnt=9, i=20, ret=-26, x={3:0}, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [rangesum(x)=-2, x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=-2, temp=2147483643, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=2147483633, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=2147483633, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=2147483633, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=4294967265, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=4294967265, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=4294967265, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=4294967294, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=4294967294, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=4294967294, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=6442450929, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=6442450929, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=6442450929, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=8589934563, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=8589934563, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=8589934563, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=6442450915, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=6442450915, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=6442450915, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=4294967268, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=4294967268, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=4294967268, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=2147483622, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=2147483622, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=2147483622, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-26, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=-26, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-26, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-2, cnt=9, i=20, ret=-26, x={3:0}, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [rangesum(x)=-2, ret=-2, temp=2147483643, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L54] COND FALSE !(i<20 -1) VAL [i=19, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L57] x[20 -1] = temp VAL [i=19, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L58] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=2147483632, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=2147483632, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=2147483632, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=2147483661, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=2147483661, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=2147483661, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=4294967296, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=4294967296, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=4294967296, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=6442450930, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=6442450930, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=6442450930, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=4294967282, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=4294967282, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=4294967282, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=2147483635, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=2147483635, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=2147483635, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=-11, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=-11, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=-11, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=-2147483659, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=-2147483659, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-2147483659, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-17, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=-17, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-17, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-1, cnt=9, i=20, ret=-17, x={3:0}, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [i=19, rangesum(x)=-1, ret=-2, ret2=-2, temp=2147483642, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [i=19, ret=-2, ret2=-2, ret5=-1, temp=2147483642, x={3:0}] [L61] reach_error() VAL [i=19, ret=-2, ret2=-2, ret5=-1, temp=2147483642, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 14, TraceHistogramMax: 60, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 1383 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1027 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 354 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 356 mSDtfsCounter, 354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2662 GetRequests, 2550 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=13, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 11 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1901 NumberOfCodeBlocks, 1412 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2737 ConstructedInterpolants, 0 QuantifiedInterpolants, 3208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2994 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 24 InterpolantComputations, 4 PerfectInterpolantSequences, 33830/35270 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-11 22:17:13,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE