./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/verifythis/prefixsum_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 17:48:10,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 17:48:10,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 17:48:10,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 17:48:10,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 17:48:10,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 17:48:10,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 17:48:10,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 17:48:10,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 17:48:10,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 17:48:10,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 17:48:10,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 17:48:10,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 17:48:10,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 17:48:10,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 17:48:10,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 17:48:10,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 17:48:10,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 17:48:10,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 17:48:10,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 17:48:10,767 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 17:48:10,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 17:48:10,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 17:48:10,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 17:48:10,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 17:48:10,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 17:48:10,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 17:48:10,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 17:48:10,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 17:48:10,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 17:48:10,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 17:48:10,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 17:48:10,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 17:48:10,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 17:48:10,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 17:48:10,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 17:48:10,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 17:48:10,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 17:48:10,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 17:48:10,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 17:48:10,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 17:48:10,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 17:48:10,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 17:48:10,815 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 17:48:10,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 17:48:10,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 17:48:10,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 17:48:10,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 17:48:10,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 17:48:10,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 17:48:10,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 17:48:10,817 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 17:48:10,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 17:48:10,817 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 17:48:10,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 17:48:10,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 17:48:10,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 17:48:10,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 17:48:10,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 17:48:10,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 17:48:10,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 17:48:10,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 17:48:10,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 17:48:10,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 17:48:10,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 17:48:10,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 17:48:10,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 17:48:10,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:48:10,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 17:48:10,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 17:48:10,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 17:48:10,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 17:48:10,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 17:48:10,820 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 17:48:10,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 17:48:10,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 17:48:10,821 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2022-07-22 17:48:11,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 17:48:11,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 17:48:11,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 17:48:11,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 17:48:11,060 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 17:48:11,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-22 17:48:11,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74e4e6d9/c87d9d7dd52543ecbb3882d06aeb9081/FLAGfacf342d3 [2022-07-22 17:48:11,537 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 17:48:11,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-22 17:48:11,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74e4e6d9/c87d9d7dd52543ecbb3882d06aeb9081/FLAGfacf342d3 [2022-07-22 17:48:11,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74e4e6d9/c87d9d7dd52543ecbb3882d06aeb9081 [2022-07-22 17:48:11,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 17:48:11,562 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 17:48:11,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 17:48:11,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 17:48:11,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 17:48:11,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6f4a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11, skipping insertion in model container [2022-07-22 17:48:11,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 17:48:11,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 17:48:11,727 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/verifythis/prefixsum_rec.c[525,538] [2022-07-22 17:48:11,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:48:11,782 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 17:48:11,796 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/verifythis/prefixsum_rec.c[525,538] [2022-07-22 17:48:11,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 17:48:11,827 INFO L208 MainTranslator]: Completed translation [2022-07-22 17:48:11,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11 WrapperNode [2022-07-22 17:48:11,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 17:48:11,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 17:48:11,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 17:48:11,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 17:48:11,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,865 INFO L137 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-07-22 17:48:11,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 17:48:11,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 17:48:11,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 17:48:11,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 17:48:11,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 17:48:11,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 17:48:11,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 17:48:11,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 17:48:11,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (1/1) ... [2022-07-22 17:48:11,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 17:48:11,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:11,920 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-22 17:48:11,927 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-22 17:48:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 17:48:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 17:48:11,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 17:48:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 17:48:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-07-22 17:48:11,951 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-07-22 17:48:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 17:48:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 17:48:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-07-22 17:48:11,951 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-07-22 17:48:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 17:48:11,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 17:48:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 17:48:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-22 17:48:11,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-22 17:48:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 17:48:12,016 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 17:48:12,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 17:48:14,362 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 17:48:14,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 17:48:14,373 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 17:48:14,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:48:14 BoogieIcfgContainer [2022-07-22 17:48:14,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 17:48:14,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 17:48:14,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 17:48:14,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 17:48:14,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 05:48:11" (1/3) ... [2022-07-22 17:48:14,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f3979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:48:14, skipping insertion in model container [2022-07-22 17:48:14,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 05:48:11" (2/3) ... [2022-07-22 17:48:14,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f3979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 05:48:14, skipping insertion in model container [2022-07-22 17:48:14,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 05:48:14" (3/3) ... [2022-07-22 17:48:14,383 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2022-07-22 17:48:14,400 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 17:48:14,400 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 17:48:14,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 17:48:14,453 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@788b7e9b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@744a6c03 [2022-07-22 17:48:14,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 17:48:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-22 17:48:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 17:48:14,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:14,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:48:14,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330660, now seen corresponding path program 1 times [2022-07-22 17:48:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:14,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904546516] [2022-07-22 17:48:14,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:14,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:48:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:14,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 17:48:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:48:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:14,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:48:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:14,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 17:48:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:48:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:14,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904546516] [2022-07-22 17:48:14,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904546516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:14,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:48:14,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 17:48:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667797568] [2022-07-22 17:48:14,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:14,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 17:48:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 17:48:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 17:48:14,792 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-22 17:48:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:14,898 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2022-07-22 17:48:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 17:48:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-22 17:48:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:14,911 INFO L225 Difference]: With dead ends: 96 [2022-07-22 17:48:14,911 INFO L226 Difference]: Without dead ends: 46 [2022-07-22 17:48:14,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-22 17:48:14,918 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:48:14,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:48:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-22 17:48:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-22 17:48:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-22 17:48:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-07-22 17:48:14,960 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2022-07-22 17:48:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:14,961 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-07-22 17:48:14,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-22 17:48:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-07-22 17:48:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 17:48:14,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:14,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:48:14,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 17:48:14,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1439199646, now seen corresponding path program 1 times [2022-07-22 17:48:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:14,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932232113] [2022-07-22 17:48:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:15,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:48:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:15,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 17:48:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:15,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:48:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:15,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 17:48:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:15,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 17:48:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:48:15,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:15,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932232113] [2022-07-22 17:48:15,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932232113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 17:48:15,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 17:48:15,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 17:48:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972879145] [2022-07-22 17:48:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 17:48:15,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 17:48:15,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:15,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 17:48:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 17:48:15,160 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-22 17:48:17,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 17:48:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:17,624 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-07-22 17:48:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 17:48:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-22 17:48:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:17,627 INFO L225 Difference]: With dead ends: 87 [2022-07-22 17:48:17,627 INFO L226 Difference]: Without dead ends: 71 [2022-07-22 17:48:17,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-22 17:48:17,628 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:48:17,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 213 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-22 17:48:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-22 17:48:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-07-22 17:48:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-22 17:48:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-07-22 17:48:17,639 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2022-07-22 17:48:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:17,640 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-22 17:48:17,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-22 17:48:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-07-22 17:48:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 17:48:17,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:17,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:48:17,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 17:48:17,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1012024996, now seen corresponding path program 1 times [2022-07-22 17:48:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:17,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257980590] [2022-07-22 17:48:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:17,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:48:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 17:48:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:48:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:17,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 17:48:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:17,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:48:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:48:17,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:17,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257980590] [2022-07-22 17:48:17,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257980590] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:17,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283238292] [2022-07-22 17:48:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:17,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:17,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:17,904 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-22 17:48:17,914 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-22 17:48:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:18,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 17:48:18,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:48:18,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:48:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 17:48:18,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283238292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:48:18,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:48:18,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-22 17:48:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95203293] [2022-07-22 17:48:18,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:48:18,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 17:48:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:18,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 17:48:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:48:18,446 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-22 17:48:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:18,708 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-07-22 17:48:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 17:48:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 46 [2022-07-22 17:48:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:18,710 INFO L225 Difference]: With dead ends: 73 [2022-07-22 17:48:18,710 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 17:48:18,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-22 17:48:18,712 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:48:18,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:48:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 17:48:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-22 17:48:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-22 17:48:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-07-22 17:48:18,725 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2022-07-22 17:48:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:18,726 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-07-22 17:48:18,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-22 17:48:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-07-22 17:48:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 17:48:18,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:18,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:48:18,762 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-22 17:48:18,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:18,960 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139546, now seen corresponding path program 2 times [2022-07-22 17:48:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:18,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139119483] [2022-07-22 17:48:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:19,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:48:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:19,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 17:48:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:48:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:48:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 17:48:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:19,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 17:48:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:48:19,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:19,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139119483] [2022-07-22 17:48:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139119483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:19,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287436207] [2022-07-22 17:48:19,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:48:19,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:19,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:19,248 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-22 17:48:19,252 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-22 17:48:19,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:48:19,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:48:19,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-22 17:48:19,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:19,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-22 17:48:20,368 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-22 17:48:20,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 27 [2022-07-22 17:48:20,571 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-22 17:48:20,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2022-07-22 17:48:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:48:20,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:48:22,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287436207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:22,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:48:22,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2022-07-22 17:48:22,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55046006] [2022-07-22 17:48:22,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:48:22,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 17:48:22,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:22,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 17:48:22,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=408, Unknown=1, NotChecked=0, Total=462 [2022-07-22 17:48:22,603 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-22 17:48:24,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 17:48:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:48:25,794 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2022-07-22 17:48:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 17:48:25,799 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2022-07-22 17:48:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:48:25,801 INFO L225 Difference]: With dead ends: 99 [2022-07-22 17:48:25,801 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 17:48:25,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=187, Invalid=1002, Unknown=1, NotChecked=0, Total=1190 [2022-07-22 17:48:25,803 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 38 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-22 17:48:25,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 377 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 363 Invalid, 1 Unknown, 149 Unchecked, 2.5s Time] [2022-07-22 17:48:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 17:48:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-07-22 17:48:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-22 17:48:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-07-22 17:48:25,826 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 48 [2022-07-22 17:48:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:48:25,828 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-07-22 17:48:25,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-22 17:48:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-07-22 17:48:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-22 17:48:25,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:48:25,832 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:48:25,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 17:48:26,047 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,SelfDestructingSolverStorable3 [2022-07-22 17:48:26,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:48:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:48:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1879560803, now seen corresponding path program 1 times [2022-07-22 17:48:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:48:26,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765683014] [2022-07-22 17:48:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:48:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:48:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:48:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:27,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 17:48:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:27,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:48:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:48:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:28,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 17:48:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 17:48:28,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:48:28,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765683014] [2022-07-22 17:48:28,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765683014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:28,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765138391] [2022-07-22 17:48:28,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:48:28,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:48:28,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:48:28,312 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-22 17:48:28,313 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-22 17:48:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:48:28,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-22 17:48:28,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:48:28,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 17:48:28,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-22 17:48:28,635 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 17:48:28,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 17:48:28,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2022-07-22 17:48:28,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-07-22 17:48:28,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-07-22 17:48:33,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-07-22 17:48:35,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-22 17:48:36,618 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_181 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_181))) |c_#memory_int|)) is different from true [2022-07-22 17:48:36,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-07-22 17:48:43,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2022-07-22 17:48:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 17:48:43,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:48:58,025 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse5 (= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0))) (and (or (forall ((|v_ULTIMATE.start_check_~a0#1.offset_6| Int) (v_ArrVal_188 Int)) (or (let ((.cse0 (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse3) (select .cse1 .cse2)))) .cse3 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_6|))) (not .cse4) .cse5) (or (and .cse4 (not .cse5)) (forall ((|v_ULTIMATE.start_check_~a0#1.offset_6| Int) (v_ArrVal_188 Int)) (or (let ((.cse6 (let ((.cse9 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse9) (select .cse7 .cse8)))) .cse9 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_6|)))))) is different from false [2022-07-22 17:48:58,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765138391] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:48:58,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:48:58,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-07-22 17:48:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177547122] [2022-07-22 17:48:58,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:48:58,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-22 17:48:58,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:48:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-22 17:48:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2006, Unknown=12, NotChecked=182, Total=2352 [2022-07-22 17:48:58,034 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-22 17:49:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:29,253 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-07-22 17:49:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 17:49:29,254 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2022-07-22 17:49:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:29,255 INFO L225 Difference]: With dead ends: 91 [2022-07-22 17:49:29,255 INFO L226 Difference]: Without dead ends: 89 [2022-07-22 17:49:29,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=327, Invalid=3688, Unknown=25, NotChecked=250, Total=4290 [2022-07-22 17:49:29,258 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:29,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 491 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 478 Invalid, 0 Unknown, 259 Unchecked, 0.6s Time] [2022-07-22 17:49:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-22 17:49:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-07-22 17:49:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-22 17:49:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-07-22 17:49:29,273 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 53 [2022-07-22 17:49:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:29,274 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-07-22 17:49:29,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-22 17:49:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-07-22 17:49:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-22 17:49:29,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:29,275 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:49:29,306 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-22 17:49:29,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:29,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash -362686961, now seen corresponding path program 1 times [2022-07-22 17:49:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:29,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738290570] [2022-07-22 17:49:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:29,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 17:49:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:49:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:49:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 17:49:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 17:49:29,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:29,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738290570] [2022-07-22 17:49:29,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738290570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:29,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039982844] [2022-07-22 17:49:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:29,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:29,648 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-22 17:49:29,652 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-22 17:49:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:29,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 17:49:29,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 17:49:29,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:49:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 17:49:30,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039982844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:49:30,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:49:30,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2022-07-22 17:49:30,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594516043] [2022-07-22 17:49:30,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:49:30,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 17:49:30,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:30,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 17:49:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-22 17:49:30,012 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-22 17:49:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:30,243 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2022-07-22 17:49:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 17:49:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 54 [2022-07-22 17:49:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:30,244 INFO L225 Difference]: With dead ends: 115 [2022-07-22 17:49:30,245 INFO L226 Difference]: Without dead ends: 95 [2022-07-22 17:49:30,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-22 17:49:30,246 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:30,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 243 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:49:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-22 17:49:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-07-22 17:49:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-22 17:49:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2022-07-22 17:49:30,261 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 54 [2022-07-22 17:49:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:30,261 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2022-07-22 17:49:30,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-22 17:49:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2022-07-22 17:49:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 17:49:30,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:30,263 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:49:30,287 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-22 17:49:30,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:30,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:30,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958502, now seen corresponding path program 2 times [2022-07-22 17:49:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:30,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508235957] [2022-07-22 17:49:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:49:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 17:49:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:49:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:49:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 17:49:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 17:49:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:30,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508235957] [2022-07-22 17:49:30,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508235957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:30,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996156142] [2022-07-22 17:49:30,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:49:30,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:30,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:30,632 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-22 17:49:30,681 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-22 17:49:30,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:49:30,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:49:30,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 17:49:30,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 17:49:30,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:49:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 17:49:30,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996156142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:49:30,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:49:30,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-07-22 17:49:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909038104] [2022-07-22 17:49:30,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:49:30,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 17:49:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:30,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 17:49:30,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-22 17:49:30,942 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-22 17:49:32,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 17:49:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:33,368 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2022-07-22 17:49:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 17:49:33,369 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-07-22 17:49:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:33,371 INFO L225 Difference]: With dead ends: 127 [2022-07-22 17:49:33,371 INFO L226 Difference]: Without dead ends: 111 [2022-07-22 17:49:33,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-07-22 17:49:33,372 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:33,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 421 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 326 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 17:49:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-22 17:49:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-07-22 17:49:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2022-07-22 17:49:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-07-22 17:49:33,387 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 57 [2022-07-22 17:49:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:33,388 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-07-22 17:49:33,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-22 17:49:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-07-22 17:49:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 17:49:33,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:33,389 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:49:33,413 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-22 17:49:33,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:33,612 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash 33191180, now seen corresponding path program 1 times [2022-07-22 17:49:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:33,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684405906] [2022-07-22 17:49:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:49:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 17:49:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:49:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:49:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 17:49:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 17:49:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 17:49:33,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:33,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684405906] [2022-07-22 17:49:33,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684405906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:33,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489074750] [2022-07-22 17:49:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:33,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:33,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:33,748 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-22 17:49:33,777 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-22 17:49:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:33,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 17:49:33,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 17:49:34,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:49:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 17:49:34,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489074750] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:49:34,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:49:34,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-07-22 17:49:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21426828] [2022-07-22 17:49:34,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:49:34,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 17:49:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 17:49:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-22 17:49:34,488 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-22 17:49:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:35,092 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-07-22 17:49:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 17:49:35,093 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 59 [2022-07-22 17:49:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:35,094 INFO L225 Difference]: With dead ends: 106 [2022-07-22 17:49:35,094 INFO L226 Difference]: Without dead ends: 95 [2022-07-22 17:49:35,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-07-22 17:49:35,096 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 84 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:35,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 298 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 17:49:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-22 17:49:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-22 17:49:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.121212121212121) internal successors, (74), 67 states have internal predecessors, (74), 17 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-22 17:49:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-07-22 17:49:35,115 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 59 [2022-07-22 17:49:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:35,116 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-07-22 17:49:35,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-22 17:49:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-07-22 17:49:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 17:49:35,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:35,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:49:35,146 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-22 17:49:35,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:35,331 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1099509749, now seen corresponding path program 1 times [2022-07-22 17:49:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455428094] [2022-07-22 17:49:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:49:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 17:49:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:49:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 17:49:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 17:49:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 17:49:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 17:49:35,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:35,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455428094] [2022-07-22 17:49:35,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455428094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:35,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095946150] [2022-07-22 17:49:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:35,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:35,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:35,496 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-22 17:49:35,523 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-22 17:49:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:35,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 17:49:35,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 17:49:35,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:49:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 17:49:36,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095946150] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:49:36,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:49:36,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-07-22 17:49:36,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432292337] [2022-07-22 17:49:36,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:49:36,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 17:49:36,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:36,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 17:49:36,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-22 17:49:36,167 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-22 17:49:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:36,402 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-07-22 17:49:36,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 17:49:36,403 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) Word has length 65 [2022-07-22 17:49:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:36,404 INFO L225 Difference]: With dead ends: 103 [2022-07-22 17:49:36,404 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 17:49:36,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-07-22 17:49:36,405 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:36,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 202 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:49:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 17:49:36,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2022-07-22 17:49:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-22 17:49:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-07-22 17:49:36,416 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 65 [2022-07-22 17:49:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:36,417 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-07-22 17:49:36,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-22 17:49:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-07-22 17:49:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 17:49:36,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:36,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:49:36,435 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-22 17:49:36,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:36,620 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:36,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:36,620 INFO L85 PathProgramCache]: Analyzing trace with hash -838921823, now seen corresponding path program 1 times [2022-07-22 17:49:36,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:36,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764142102] [2022-07-22 17:49:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:36,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 17:49:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:49:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:49:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 17:49:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:49:36,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:36,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764142102] [2022-07-22 17:49:36,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764142102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:36,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612109601] [2022-07-22 17:49:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:36,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:36,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:36,756 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-22 17:49:36,779 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-22 17:49:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:36,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 17:49:36,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:49:36,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:49:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 17:49:37,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612109601] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:49:37,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:49:37,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-07-22 17:49:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966376870] [2022-07-22 17:49:37,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:49:37,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 17:49:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:49:37,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 17:49:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-22 17:49:37,114 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 17:49:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:49:37,279 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-22 17:49:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 17:49:37,280 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2022-07-22 17:49:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:49:37,281 INFO L225 Difference]: With dead ends: 67 [2022-07-22 17:49:37,281 INFO L226 Difference]: Without dead ends: 58 [2022-07-22 17:49:37,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-22 17:49:37,282 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 17:49:37,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 17:49:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-22 17:49:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-22 17:49:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-22 17:49:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-07-22 17:49:37,289 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 66 [2022-07-22 17:49:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:49:37,289 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-07-22 17:49:37,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 17:49:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-07-22 17:49:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 17:49:37,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:49:37,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:49:37,309 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-22 17:49:37,499 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,SelfDestructingSolverStorable9 [2022-07-22 17:49:37,499 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:49:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:49:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650442, now seen corresponding path program 1 times [2022-07-22 17:49:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:49:37,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288117286] [2022-07-22 17:49:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:49:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 17:49:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:49:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:49:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 17:49:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 17:49:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 17:49:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:49:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 17:49:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-22 17:49:37,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:49:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288117286] [2022-07-22 17:49:37,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288117286] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:49:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207881810] [2022-07-22 17:49:37,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:49:37,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:49:37,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:49:37,874 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-22 17:49:37,902 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-22 17:49:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:49:38,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 170 conjunts are in the unsatisfiable core [2022-07-22 17:49:38,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:49:38,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 17:49:38,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-22 17:49:38,180 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 17:49:38,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 17:49:38,223 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_545 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_545) |c_#memory_int|)) is different from true [2022-07-22 17:49:38,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:49:38,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:49:38,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:49:38,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:49:43,420 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_552 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_552)))) is different from true [2022-07-22 17:49:55,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-22 17:49:55,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2022-07-22 17:50:01,401 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2022-07-22 17:50:07,101 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) is different from true [2022-07-22 17:50:11,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 143 [2022-07-22 17:50:20,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 133 [2022-07-22 17:50:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 15 not checked. [2022-07-22 17:50:20,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:50:25,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207881810] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:50:25,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:50:25,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 36] total 47 [2022-07-22 17:50:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271825572] [2022-07-22 17:50:25,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:50:25,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-22 17:50:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:50:25,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-22 17:50:25,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1926, Unknown=20, NotChecked=364, Total=2450 [2022-07-22 17:50:25,730 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-22 17:50:41,592 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|)))) is different from true [2022-07-22 17:50:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:50:41,623 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2022-07-22 17:50:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-22 17:50:41,624 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 72 [2022-07-22 17:50:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:50:41,625 INFO L225 Difference]: With dead ends: 125 [2022-07-22 17:50:41,625 INFO L226 Difference]: Without dead ends: 97 [2022-07-22 17:50:41,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 60.5s TimeCoverageRelationStatistics Valid=395, Invalid=5148, Unknown=27, NotChecked=750, Total=6320 [2022-07-22 17:50:41,627 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1036 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 17:50:41,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 483 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 848 Invalid, 0 Unknown, 1036 Unchecked, 0.6s Time] [2022-07-22 17:50:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-22 17:50:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-07-22 17:50:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 17 states have call successors, (17), 5 states have call predecessors, (17), 9 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2022-07-22 17:50:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2022-07-22 17:50:41,640 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 72 [2022-07-22 17:50:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:50:41,640 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2022-07-22 17:50:41,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-22 17:50:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-07-22 17:50:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 17:50:41,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:50:41,641 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:50:41,658 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-22 17:50:41,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:50:41,842 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:50:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:50:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1763257480, now seen corresponding path program 2 times [2022-07-22 17:50:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:50:41,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741812916] [2022-07-22 17:50:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:50:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:50:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:50:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 17:50:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 17:50:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 17:50:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-22 17:50:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:50:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 17:50:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 17:50:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:50:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 17:50:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:50:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 17:50:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:50:42,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741812916] [2022-07-22 17:50:42,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741812916] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:50:42,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445414265] [2022-07-22 17:50:42,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:50:42,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:50:42,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:50:42,090 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-22 17:50:42,094 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-22 17:50:42,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:50:42,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:50:42,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 172 conjunts are in the unsatisfiable core [2022-07-22 17:50:42,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:50:42,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 17:50:42,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-22 17:50:42,374 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 17:50:42,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 17:50:42,408 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_683 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_683) |c_#memory_int|)) is different from true [2022-07-22 17:50:42,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:50:42,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:50:42,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:50:42,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:50:42,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-22 17:50:43,386 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|)) is different from true [2022-07-22 17:50:46,192 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) is different from true [2022-07-22 17:50:51,530 WARN L855 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_ArrVal_693 Int) (v_ArrVal_688 Int)) (and (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* 4 |c_upsweep_#in~left|)) v_ArrVal_688) (+ (* upsweep_~right 4) |c_upsweep_#in~a.offset|) v_ArrVal_693)) |c_#memory_int|) (<= |c_upsweep_#in~right| upsweep_~right))) is different from true [2022-07-22 17:50:51,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-07-22 17:50:54,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2022-07-22 17:50:59,972 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|)) is different from true [2022-07-22 17:51:04,493 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) is different from true [2022-07-22 17:51:06,609 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2) 0)) (.cse0 (< |c_downsweep_#in~right| |c_downsweep_#in~left|))) (or (and .cse0 (not .cse1) (exists ((v_ArrVal_697 Int) (v_downsweep_~left_61 Int) (downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (let ((.cse3 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (let ((.cse2 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store (store (store .cse2 .cse3 v_ArrVal_697) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* 4 v_downsweep_~left_61)) (select .cse2 .cse3))) .cse3 v_ArrVal_704)) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703)) |c_#memory_int|) (<= |c_downsweep_#in~right| (+ (div (+ |c_downsweep_#in~right| (* (- 1) |c_downsweep_#in~left|)) 2) downsweep_~left 1))))) (and (exists ((v_ArrVal_697 Int) (v_downsweep_~left_61 Int) (downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (let ((.cse5 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (let ((.cse4 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store (store (store .cse4 .cse5 v_ArrVal_697) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* 4 v_downsweep_~left_61)) (select .cse4 .cse5))) .cse5 v_ArrVal_704)) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703)) |c_#memory_int|) (<= |c_downsweep_#in~right| (+ (div (+ |c_downsweep_#in~right| (* (- 1) |c_downsweep_#in~left|)) 2) downsweep_~left)))) (or .cse1 (not .cse0))))) is different from true [2022-07-22 17:51:06,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 210 [2022-07-22 17:51:06,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2022-07-22 17:51:16,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 102 [2022-07-22 17:51:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 17 not checked. [2022-07-22 17:51:16,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:51:24,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445414265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:24,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 17:51:24,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 41 [2022-07-22 17:51:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431496050] [2022-07-22 17:51:24,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 17:51:24,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-22 17:51:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:24,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-22 17:51:24,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1219, Unknown=26, NotChecked=532, Total=1892 [2022-07-22 17:51:24,515 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-22 17:51:36,676 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|))) is different from true [2022-07-22 17:51:43,743 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|))) is different from true [2022-07-22 17:51:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:43,770 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2022-07-22 17:51:43,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-22 17:51:43,771 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) Word has length 74 [2022-07-22 17:51:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:43,772 INFO L225 Difference]: With dead ends: 137 [2022-07-22 17:51:43,772 INFO L226 Difference]: Without dead ends: 102 [2022-07-22 17:51:43,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 59.6s TimeCoverageRelationStatistics Valid=459, Invalid=4095, Unknown=38, NotChecked=1260, Total=5852 [2022-07-22 17:51:43,774 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1253 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:43,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 395 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 582 Invalid, 0 Unknown, 1253 Unchecked, 0.4s Time] [2022-07-22 17:51:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-22 17:51:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-07-22 17:51:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2022-07-22 17:51:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2022-07-22 17:51:43,788 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 74 [2022-07-22 17:51:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:43,789 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2022-07-22 17:51:43,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-22 17:51:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2022-07-22 17:51:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-22 17:51:43,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:43,790 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:43,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-22 17:51:44,011 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,SelfDestructingSolverStorable11 [2022-07-22 17:51:44,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:44,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash 844735882, now seen corresponding path program 1 times [2022-07-22 17:51:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:44,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522282082] [2022-07-22 17:51:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:51:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 17:51:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:51:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 17:51:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 17:51:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 17:51:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 17:51:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 17:51:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-22 17:51:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:44,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522282082] [2022-07-22 17:51:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522282082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:44,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892191316] [2022-07-22 17:51:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:44,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:44,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:44,348 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-22 17:51:44,349 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-22 17:51:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:44,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-22 17:51:44,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-22 17:51:44,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:51:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-22 17:51:45,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892191316] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:51:45,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:51:45,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 12] total 33 [2022-07-22 17:51:45,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116966937] [2022-07-22 17:51:45,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:51:45,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 17:51:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 17:51:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 17:51:45,453 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-22 17:51:47,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 17:51:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:48,787 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2022-07-22 17:51:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-22 17:51:48,788 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) Word has length 85 [2022-07-22 17:51:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:48,789 INFO L225 Difference]: With dead ends: 157 [2022-07-22 17:51:48,789 INFO L226 Difference]: Without dead ends: 116 [2022-07-22 17:51:48,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=320, Invalid=2436, Unknown=0, NotChecked=0, Total=2756 [2022-07-22 17:51:48,791 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 134 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 101 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:48,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 989 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-07-22 17:51:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-22 17:51:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2022-07-22 17:51:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 16 states have call successors, (16), 6 states have call predecessors, (16), 9 states have return successors, (29), 19 states have call predecessors, (29), 16 states have call successors, (29) [2022-07-22 17:51:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2022-07-22 17:51:48,814 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 85 [2022-07-22 17:51:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:48,815 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2022-07-22 17:51:48,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-22 17:51:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2022-07-22 17:51:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-22 17:51:48,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:48,816 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:48,833 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-22 17:51:49,019 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,SelfDestructingSolverStorable12 [2022-07-22 17:51:49,020 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1782863912, now seen corresponding path program 2 times [2022-07-22 17:51:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:49,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415392727] [2022-07-22 17:51:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:51:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 17:51:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:51:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:51:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 17:51:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:51:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 17:51:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 17:51:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 17:51:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-22 17:51:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415392727] [2022-07-22 17:51:49,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415392727] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454080905] [2022-07-22 17:51:49,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 17:51:49,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:49,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:49,209 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-22 17:51:49,210 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-22 17:51:49,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 17:51:49,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:51:49,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 17:51:49,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:51:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-22 17:51:49,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 17:51:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-22 17:51:49,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454080905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 17:51:49,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 17:51:49,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-07-22 17:51:49,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015014455] [2022-07-22 17:51:49,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 17:51:49,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 17:51:49,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 17:51:49,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 17:51:49,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-22 17:51:49,800 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-22 17:51:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 17:51:50,049 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-07-22 17:51:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 17:51:50,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-07-22 17:51:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 17:51:50,051 INFO L225 Difference]: With dead ends: 116 [2022-07-22 17:51:50,051 INFO L226 Difference]: Without dead ends: 98 [2022-07-22 17:51:50,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-22 17:51:50,052 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 17:51:50,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 381 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 17:51:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-22 17:51:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-22 17:51:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.1) internal successors, (77), 69 states have internal predecessors, (77), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (27), 19 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-22 17:51:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2022-07-22 17:51:50,067 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 97 [2022-07-22 17:51:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 17:51:50,067 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2022-07-22 17:51:50,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-22 17:51:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2022-07-22 17:51:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-22 17:51:50,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 17:51:50,069 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 17:51:50,098 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-22 17:51:50,283 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,SelfDestructingSolverStorable13 [2022-07-22 17:51:50,283 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 17:51:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 17:51:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1157064136, now seen corresponding path program 3 times [2022-07-22 17:51:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 17:51:50,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84929444] [2022-07-22 17:51:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 17:51:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 17:51:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 17:51:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 17:51:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 17:51:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 17:51:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 17:51:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 17:51:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 17:51:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 17:51:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 17:51:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 17:51:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-22 17:51:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 17:51:50,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84929444] [2022-07-22 17:51:50,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84929444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 17:51:50,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721810142] [2022-07-22 17:51:50,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 17:51:50,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 17:51:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 17:51:50,492 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-22 17:51:50,517 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-22 17:51:50,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 17:51:50,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 17:51:50,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-22 17:51:50,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 17:52:01,588 WARN L833 $PredicateComparison]: unable to prove that (and (= (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) |c_ULTIMATE.start_is_pow2_~x#1|) (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false [2022-07-22 17:52:23,961 WARN L233 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 17:52:28,278 WARN L833 $PredicateComparison]: unable to prove that (and (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse0 (= (mod (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) 4294967296) 1))) (or (and (= |c_ULTIMATE.start_is_pow2_#res#1| 0) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start_is_pow2_#res#1| 1)))) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false [2022-07-22 17:52:35,753 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)