./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array23_pattern.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array23_pattern.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 e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:23:36,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:23:36,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:23:37,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:23:37,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:23:37,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:23:37,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:23:37,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:23:37,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:23:37,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:23:37,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:23:37,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:23:37,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:23:37,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:23:37,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:23:37,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:23:37,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:23:37,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:23:37,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:23:37,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:23:37,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:23:37,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:23:37,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:23:37,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:23:37,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:23:37,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:23:37,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:23:37,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:23:37,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:23:37,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:23:37,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:23:37,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:23:37,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:23:37,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:23:37,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:23:37,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:23:37,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:23:37,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:23:37,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:23:37,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:23:37,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:23:37,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:23:37,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:23:37,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:23:37,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:23:37,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:23:37,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:23:37,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:23:37,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:23:37,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:23:37,121 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:23:37,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:23:37,122 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:23:37,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:23:37,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:23:37,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:23:37,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:23:37,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:23:37,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:23:37,123 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:23:37,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:23:37,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:23:37,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:23:37,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:23:37,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:23:37,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:23:37,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:23:37,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:23:37,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:23:37,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:23:37,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:23:37,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:23:37,127 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:23:37,127 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:23:37,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:23:37,127 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 -> e6bb9e1c9705c406859f1248122e92b7c01da6449c586b213f4fa087ea45e218 [2022-02-20 14:23:37,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:23:37,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:23:37,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:23:37,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:23:37,335 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:23:37,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array23_pattern.c [2022-02-20 14:23:37,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e23577cf/a11b388c0364441abe48c8d068734147/FLAG2163a70c9 [2022-02-20 14:23:37,741 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:23:37,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c [2022-02-20 14:23:37,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e23577cf/a11b388c0364441abe48c8d068734147/FLAG2163a70c9 [2022-02-20 14:23:37,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e23577cf/a11b388c0364441abe48c8d068734147 [2022-02-20 14:23:37,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:23:37,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:23:37,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:23:37,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:23:37,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:23:37,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:37,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fcf232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37, skipping insertion in model container [2022-02-20 14:23:37,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:37,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:23:37,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:23:37,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c[1347,1360] [2022-02-20 14:23:37,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:23:37,954 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:23:37,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array23_pattern.c[1347,1360] [2022-02-20 14:23:37,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:23:37,988 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:23:37,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37 WrapperNode [2022-02-20 14:23:37,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:23:37,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:23:37,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:23:37,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:23:37,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,029 INFO L137 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2022-02-20 14:23:38,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:23:38,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:23:38,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:23:38,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:23:38,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:23:38,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:23:38,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:23:38,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:23:38,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (1/1) ... [2022-02-20 14:23:38,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:23:38,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:38,079 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-02-20 14:23:38,099 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-02-20 14:23:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2022-02-20 14:23:38,110 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2022-02-20 14:23:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:23:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:23:38,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:23:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:23:38,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:23:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:23:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:23:38,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:23:38,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:23:38,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:23:38,175 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:23:38,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:23:38,480 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:23:38,487 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:23:38,487 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 14:23:38,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:23:38 BoogieIcfgContainer [2022-02-20 14:23:38,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:23:38,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:23:38,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:23:38,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:23:38,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:23:37" (1/3) ... [2022-02-20 14:23:38,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d83f50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:23:38, skipping insertion in model container [2022-02-20 14:23:38,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:37" (2/3) ... [2022-02-20 14:23:38,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d83f50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:23:38, skipping insertion in model container [2022-02-20 14:23:38,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:23:38" (3/3) ... [2022-02-20 14:23:38,497 INFO L111 eAbstractionObserver]: Analyzing ICFG array23_pattern.c [2022-02-20 14:23:38,502 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:23:38,502 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:23:38,540 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:23:38,546 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:23:38,546 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:23:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:23:38,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:38,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:23:38,563 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1798908762, now seen corresponding path program 1 times [2022-02-20 14:23:38,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:38,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633750874] [2022-02-20 14:23:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:38,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:23:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:38,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#true} ~cond := #in~cond; {44#true} is VALID [2022-02-20 14:23:38,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#true} assume 0 == ~cond;assume false; {45#false} is VALID [2022-02-20 14:23:38,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#false} assume true; {45#false} is VALID [2022-02-20 14:23:38,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45#false} {44#true} #121#return; {45#false} is VALID [2022-02-20 14:23:38,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {44#true} is VALID [2022-02-20 14:23:38,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ite11#1, main_#t~mem10#1, main_#t~ret12#1, main_#t~ite14#1, main_#t~mem13#1, main_#t~nondet15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~post16#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {44#true} is VALID [2022-02-20 14:23:38,752 INFO L272 TraceCheckUtils]: 2: Hoare triple {44#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 1 then 1 else 0)); {44#true} is VALID [2022-02-20 14:23:38,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {44#true} ~cond := #in~cond; {44#true} is VALID [2022-02-20 14:23:38,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {44#true} assume 0 == ~cond;assume false; {45#false} is VALID [2022-02-20 14:23:38,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#false} assume true; {45#false} is VALID [2022-02-20 14:23:38,754 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45#false} {44#true} #121#return; {45#false} is VALID [2022-02-20 14:23:38,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#false} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {45#false} is VALID [2022-02-20 14:23:38,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {45#false} is VALID [2022-02-20 14:23:38,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {45#false} assume !true; {45#false} is VALID [2022-02-20 14:23:38,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {45#false} main_~row~0#1 := 0; {45#false} is VALID [2022-02-20 14:23:38,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {45#false} assume !true; {45#false} is VALID [2022-02-20 14:23:38,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {45#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {45#false} is VALID [2022-02-20 14:23:38,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {45#false} assume 0 == __VERIFIER_assert_~cond#1; {45#false} is VALID [2022-02-20 14:23:38,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {45#false} assume !false; {45#false} is VALID [2022-02-20 14:23:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:23:38,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:38,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633750874] [2022-02-20 14:23:38,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633750874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:38,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:38,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:23:38,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795938283] [2022-02-20 14:23:38,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:38,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:23:38,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:38,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:23:38,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:38,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:23:38,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:23:38,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:23:38,821 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.53125) internal successors, (49), 33 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:23:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:38,899 INFO L93 Difference]: Finished difference Result 79 states and 117 transitions. [2022-02-20 14:23:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:23:38,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 14:23:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:23:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2022-02-20 14:23:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:23:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2022-02-20 14:23:38,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2022-02-20 14:23:39,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:39,059 INFO L225 Difference]: With dead ends: 79 [2022-02-20 14:23:39,065 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:23:39,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:23:39,073 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:39,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:23:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 14:23:39,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:39,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:39,095 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:39,096 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:39,099 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-02-20 14:23:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-20 14:23:39,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:39,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:39,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-02-20 14:23:39,100 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-02-20 14:23:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:39,112 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-02-20 14:23:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-20 14:23:39,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:39,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:39,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:39,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-02-20 14:23:39,116 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 15 [2022-02-20 14:23:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:39,116 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-02-20 14:23:39,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:23:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-20 14:23:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 14:23:39,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:39,117 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-02-20 14:23:39,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:23:39,118 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:39,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1909329698, now seen corresponding path program 1 times [2022-02-20 14:23:39,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:39,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920616860] [2022-02-20 14:23:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:39,174 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:39,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953203262] [2022-02-20 14:23:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:39,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:39,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:39,179 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-02-20 14:23:39,180 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-02-20 14:23:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:39,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:23:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:39,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:39,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {276#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {276#true} is VALID [2022-02-20 14:23:39,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ite11#1, main_#t~mem10#1, main_#t~ret12#1, main_#t~ite14#1, main_#t~mem13#1, main_#t~nondet15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~post16#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {276#true} is VALID [2022-02-20 14:23:39,471 INFO L272 TraceCheckUtils]: 2: Hoare triple {276#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 1 then 1 else 0)); {276#true} is VALID [2022-02-20 14:23:39,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-02-20 14:23:39,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-02-20 14:23:39,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} assume true; {276#true} is VALID [2022-02-20 14:23:39,473 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {276#true} {276#true} #121#return; {276#true} is VALID [2022-02-20 14:23:39,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,474 INFO L272 TraceCheckUtils]: 10: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {276#true} is VALID [2022-02-20 14:23:39,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-02-20 14:23:39,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-02-20 14:23:39,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#true} assume true; {276#true} is VALID [2022-02-20 14:23:39,476 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {276#true} {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} #123#return; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,476 INFO L272 TraceCheckUtils]: 15: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {276#true} is VALID [2022-02-20 14:23:39,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-02-20 14:23:39,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-02-20 14:23:39,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {276#true} assume true; {276#true} is VALID [2022-02-20 14:23:39,477 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {276#true} {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} #125#return; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,477 INFO L272 TraceCheckUtils]: 20: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} call main_#t~ret9#1 := outerBoundaryPatternCheck(main_~index1~0#1); {276#true} is VALID [2022-02-20 14:23:39,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {276#true} ~index := #in~index; {276#true} is VALID [2022-02-20 14:23:39,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {276#true} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {276#true} is VALID [2022-02-20 14:23:39,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {276#true} assume true; {276#true} is VALID [2022-02-20 14:23:39,478 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {276#true} {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} #127#return; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume 0 != main_#t~ret9#1;main_#t~ite11#1 := main_~num~0#1 * main_~num~0#1; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} call write~int(main_#t~ite11#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret9#1;havoc main_#t~ite11#1;havoc main_#t~mem10#1; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,480 INFO L272 TraceCheckUtils]: 28: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} call main_#t~ret12#1 := outerBoundaryPatternCheck(main_~index1~0#1); {276#true} is VALID [2022-02-20 14:23:39,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {276#true} ~index := #in~index; {276#true} is VALID [2022-02-20 14:23:39,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {276#true} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {276#true} is VALID [2022-02-20 14:23:39,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {276#true} assume true; {276#true} is VALID [2022-02-20 14:23:39,481 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {276#true} {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} #129#return; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume 0 != main_#t~ret12#1;main_#t~ite14#1 := main_~num~0#1; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} call write~int(main_#t~ite14#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret12#1;havoc main_#t~ite14#1;havoc main_#t~mem13#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume 0 == main_~temp~0#1; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~row~0#1 := 0; {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:23:39,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {302#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {399#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:23:39,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {399#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {277#false} is VALID [2022-02-20 14:23:39,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-02-20 14:23:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 14:23:39,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:39,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:39,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920616860] [2022-02-20 14:23:39,485 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:39,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953203262] [2022-02-20 14:23:39,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953203262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:39,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:39,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:23:39,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272895572] [2022-02-20 14:23:39,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-02-20 14:23:39,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:39,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:39,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:39,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:23:39,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:23:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:23:39,516 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:39,604 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-02-20 14:23:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:23:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-02-20 14:23:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-02-20 14:23:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-02-20 14:23:39,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2022-02-20 14:23:39,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:39,646 INFO L225 Difference]: With dead ends: 44 [2022-02-20 14:23:39,646 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 14:23:39,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:23:39,647 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:39,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 14:23:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 14:23:39,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:39,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:39,652 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:39,653 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:39,654 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-02-20 14:23:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 14:23:39,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:39,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:39,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-02-20 14:23:39,656 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-02-20 14:23:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:39,658 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-02-20 14:23:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 14:23:39,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:39,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:39,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:39,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-02-20 14:23:39,660 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 42 [2022-02-20 14:23:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:39,661 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-02-20 14:23:39,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 14:23:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 14:23:39,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:39,662 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-02-20 14:23:39,682 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-02-20 14:23:39,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:39,880 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1786751912, now seen corresponding path program 1 times [2022-02-20 14:23:39,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:39,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527510057] [2022-02-20 14:23:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:39,901 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:39,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248884582] [2022-02-20 14:23:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:39,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:39,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:39,904 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-02-20 14:23:39,906 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-02-20 14:23:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:39,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:23:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:39,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:40,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {597#true} is VALID [2022-02-20 14:23:40,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ite11#1, main_#t~mem10#1, main_#t~ret12#1, main_#t~ite14#1, main_#t~mem13#1, main_#t~nondet15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~post16#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {597#true} is VALID [2022-02-20 14:23:40,176 INFO L272 TraceCheckUtils]: 2: Hoare triple {597#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 1 then 1 else 0)); {597#true} is VALID [2022-02-20 14:23:40,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#true} ~cond := #in~cond; {597#true} is VALID [2022-02-20 14:23:40,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {597#true} assume !(0 == ~cond); {597#true} is VALID [2022-02-20 14:23:40,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#true} assume true; {597#true} is VALID [2022-02-20 14:23:40,177 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {597#true} {597#true} #121#return; {597#true} is VALID [2022-02-20 14:23:40,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {623#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:40,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,179 INFO L272 TraceCheckUtils]: 10: Hoare triple {627#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {627#(<= ~ARR_SIZE~0 0)} ~cond := #in~cond; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume !(0 == ~cond); {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume true; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,181 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {627#(<= ~ARR_SIZE~0 0)} {627#(<= ~ARR_SIZE~0 0)} #123#return; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,182 INFO L272 TraceCheckUtils]: 15: Hoare triple {627#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {627#(<= ~ARR_SIZE~0 0)} ~cond := #in~cond; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume !(0 == ~cond); {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume true; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,184 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {627#(<= ~ARR_SIZE~0 0)} {627#(<= ~ARR_SIZE~0 0)} #125#return; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,184 INFO L272 TraceCheckUtils]: 20: Hoare triple {627#(<= ~ARR_SIZE~0 0)} call main_#t~ret9#1 := outerBoundaryPatternCheck(main_~index1~0#1); {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {627#(<= ~ARR_SIZE~0 0)} ~index := #in~index; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume true; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,186 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {627#(<= ~ARR_SIZE~0 0)} {627#(<= ~ARR_SIZE~0 0)} #127#return; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume 0 != main_#t~ret9#1;main_#t~ite11#1 := main_~num~0#1 * main_~num~0#1; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {627#(<= ~ARR_SIZE~0 0)} call write~int(main_#t~ite11#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret9#1;havoc main_#t~ite11#1;havoc main_#t~mem10#1; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,188 INFO L272 TraceCheckUtils]: 28: Hoare triple {627#(<= ~ARR_SIZE~0 0)} call main_#t~ret12#1 := outerBoundaryPatternCheck(main_~index1~0#1); {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {627#(<= ~ARR_SIZE~0 0)} ~index := #in~index; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume true; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,189 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {627#(<= ~ARR_SIZE~0 0)} {627#(<= ~ARR_SIZE~0 0)} #129#return; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume 0 != main_#t~ret12#1;main_#t~ite14#1 := main_~num~0#1; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {627#(<= ~ARR_SIZE~0 0)} call write~int(main_#t~ite14#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret12#1;havoc main_#t~ite14#1;havoc main_#t~mem13#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {627#(<= ~ARR_SIZE~0 0)} assume 0 == main_~temp~0#1; {627#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:23:40,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {627#(<= ~ARR_SIZE~0 0)} main_~row~0#1 := 0; {715#(and (<= ~ARR_SIZE~0 0) (<= 0 |ULTIMATE.start_main_~row~0#1|))} is VALID [2022-02-20 14:23:40,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {715#(and (<= ~ARR_SIZE~0 0) (<= 0 |ULTIMATE.start_main_~row~0#1|))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {598#false} is VALID [2022-02-20 14:23:40,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {598#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem18#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem18#1;havoc main_#t~mem18#1; {598#false} is VALID [2022-02-20 14:23:40,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {598#false} main_#t~post17#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {598#false} is VALID [2022-02-20 14:23:40,192 INFO L290 TraceCheckUtils]: 41: Hoare triple {598#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {598#false} is VALID [2022-02-20 14:23:40,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {598#false} main_#t~post16#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {598#false} is VALID [2022-02-20 14:23:40,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {598#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {598#false} is VALID [2022-02-20 14:23:40,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {598#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {598#false} is VALID [2022-02-20 14:23:40,193 INFO L290 TraceCheckUtils]: 45: Hoare triple {598#false} assume 0 == __VERIFIER_assert_~cond#1; {598#false} is VALID [2022-02-20 14:23:40,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-02-20 14:23:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:23:40,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:40,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:40,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527510057] [2022-02-20 14:23:40,194 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:40,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248884582] [2022-02-20 14:23:40,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248884582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:40,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:40,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:23:40,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770312625] [2022-02-20 14:23:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:40,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2022-02-20 14:23:40,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:40,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:40,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:40,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:23:40,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:23:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:23:40,230 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:40,444 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2022-02-20 14:23:40,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:23:40,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2022-02-20 14:23:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-02-20 14:23:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-02-20 14:23:40,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2022-02-20 14:23:40,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:40,546 INFO L225 Difference]: With dead ends: 83 [2022-02-20 14:23:40,547 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 14:23:40,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:23:40,550 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 25 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:40,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 114 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:23:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 14:23:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-02-20 14:23:40,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:40,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:40,563 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:40,563 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:40,566 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 14:23:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-02-20 14:23:40,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:40,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:40,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-02-20 14:23:40,571 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-02-20 14:23:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:40,573 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 14:23:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-02-20 14:23:40,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:40,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:40,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:40,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-02-20 14:23:40,575 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 47 [2022-02-20 14:23:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:40,580 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-02-20 14:23:40,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-02-20 14:23:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 14:23:40,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:40,581 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-02-20 14:23:40,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 14:23:40,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 14:23:40,798 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2075657686, now seen corresponding path program 1 times [2022-02-20 14:23:40,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:40,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355384551] [2022-02-20 14:23:40,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:40,816 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:40,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781734092] [2022-02-20 14:23:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:40,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:40,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:40,818 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-02-20 14:23:40,819 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-02-20 14:23:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:40,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:23:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:40,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:41,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {1013#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1013#true} is VALID [2022-02-20 14:23:41,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {1013#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ite11#1, main_#t~mem10#1, main_#t~ret12#1, main_#t~ite14#1, main_#t~mem13#1, main_#t~nondet15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~post16#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1013#true} is VALID [2022-02-20 14:23:41,032 INFO L272 TraceCheckUtils]: 2: Hoare triple {1013#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 1 then 1 else 0)); {1013#true} is VALID [2022-02-20 14:23:41,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {1013#true} ~cond := #in~cond; {1013#true} is VALID [2022-02-20 14:23:41,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {1013#true} assume !(0 == ~cond); {1013#true} is VALID [2022-02-20 14:23:41,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {1013#true} assume true; {1013#true} is VALID [2022-02-20 14:23:41,033 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1013#true} {1013#true} #121#return; {1013#true} is VALID [2022-02-20 14:23:41,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {1013#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1039#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:23:41,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {1039#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1043#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:41,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1014#false} is VALID [2022-02-20 14:23:41,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {1014#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1014#false} is VALID [2022-02-20 14:23:41,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1014#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1014#false} is VALID [2022-02-20 14:23:41,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {1014#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1014#false} is VALID [2022-02-20 14:23:41,036 INFO L272 TraceCheckUtils]: 13: Hoare triple {1014#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1014#false} is VALID [2022-02-20 14:23:41,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {1014#false} ~cond := #in~cond; {1014#false} is VALID [2022-02-20 14:23:41,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {1014#false} assume !(0 == ~cond); {1014#false} is VALID [2022-02-20 14:23:41,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {1014#false} assume true; {1014#false} is VALID [2022-02-20 14:23:41,037 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1014#false} {1014#false} #123#return; {1014#false} is VALID [2022-02-20 14:23:41,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {1014#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1014#false} is VALID [2022-02-20 14:23:41,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {1014#false} ~cond := #in~cond; {1014#false} is VALID [2022-02-20 14:23:41,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {1014#false} assume !(0 == ~cond); {1014#false} is VALID [2022-02-20 14:23:41,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {1014#false} assume true; {1014#false} is VALID [2022-02-20 14:23:41,037 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1014#false} {1014#false} #125#return; {1014#false} is VALID [2022-02-20 14:23:41,038 INFO L272 TraceCheckUtils]: 23: Hoare triple {1014#false} call main_#t~ret9#1 := outerBoundaryPatternCheck(main_~index1~0#1); {1014#false} is VALID [2022-02-20 14:23:41,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {1014#false} ~index := #in~index; {1014#false} is VALID [2022-02-20 14:23:41,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {1014#false} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {1014#false} is VALID [2022-02-20 14:23:41,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {1014#false} assume true; {1014#false} is VALID [2022-02-20 14:23:41,038 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1014#false} {1014#false} #127#return; {1014#false} is VALID [2022-02-20 14:23:41,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {1014#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {1014#false} is VALID [2022-02-20 14:23:41,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {1014#false} assume 0 != main_#t~ret9#1;main_#t~ite11#1 := main_~num~0#1 * main_~num~0#1; {1014#false} is VALID [2022-02-20 14:23:41,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {1014#false} call write~int(main_#t~ite11#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret9#1;havoc main_#t~ite11#1;havoc main_#t~mem10#1; {1014#false} is VALID [2022-02-20 14:23:41,039 INFO L272 TraceCheckUtils]: 31: Hoare triple {1014#false} call main_#t~ret12#1 := outerBoundaryPatternCheck(main_~index1~0#1); {1014#false} is VALID [2022-02-20 14:23:41,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {1014#false} ~index := #in~index; {1014#false} is VALID [2022-02-20 14:23:41,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {1014#false} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {1014#false} is VALID [2022-02-20 14:23:41,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {1014#false} assume true; {1014#false} is VALID [2022-02-20 14:23:41,052 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1014#false} {1014#false} #129#return; {1014#false} is VALID [2022-02-20 14:23:41,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {1014#false} assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1014#false} is VALID [2022-02-20 14:23:41,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {1014#false} assume 0 != main_#t~ret12#1;main_#t~ite14#1 := main_~num~0#1; {1014#false} is VALID [2022-02-20 14:23:41,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {1014#false} call write~int(main_#t~ite14#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret12#1;havoc main_#t~ite14#1;havoc main_#t~mem13#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {1014#false} is VALID [2022-02-20 14:23:41,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {1014#false} assume 0 == main_~temp~0#1; {1014#false} is VALID [2022-02-20 14:23:41,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {1014#false} main_~row~0#1 := 0; {1014#false} is VALID [2022-02-20 14:23:41,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {1014#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1014#false} is VALID [2022-02-20 14:23:41,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {1014#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem18#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem18#1;havoc main_#t~mem18#1; {1014#false} is VALID [2022-02-20 14:23:41,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {1014#false} main_#t~post17#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1014#false} is VALID [2022-02-20 14:23:41,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {1014#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1014#false} is VALID [2022-02-20 14:23:41,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {1014#false} main_#t~post16#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {1014#false} is VALID [2022-02-20 14:23:41,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {1014#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1014#false} is VALID [2022-02-20 14:23:41,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {1014#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1014#false} is VALID [2022-02-20 14:23:41,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {1014#false} assume 0 == __VERIFIER_assert_~cond#1; {1014#false} is VALID [2022-02-20 14:23:41,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {1014#false} assume !false; {1014#false} is VALID [2022-02-20 14:23:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:23:41,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:23:41,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:41,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355384551] [2022-02-20 14:23:41,055 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:41,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781734092] [2022-02-20 14:23:41,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781734092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:23:41,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:23:41,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:23:41,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492159145] [2022-02-20 14:23:41,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:23:41,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-02-20 14:23:41,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:41,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:41,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:41,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:23:41,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:23:41,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:23:41,085 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:41,212 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2022-02-20 14:23:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:23:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-02-20 14:23:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-02-20 14:23:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-02-20 14:23:41,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-02-20 14:23:41,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:41,290 INFO L225 Difference]: With dead ends: 80 [2022-02-20 14:23:41,290 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 14:23:41,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:23:41,291 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:41,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 77 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:23:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 14:23:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-02-20 14:23:41,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:41,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:41,310 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:41,310 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:41,314 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-02-20 14:23:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-02-20 14:23:41,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:41,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:41,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 14:23:41,315 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 44 states. [2022-02-20 14:23:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:41,317 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-02-20 14:23:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-02-20 14:23:41,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:41,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:41,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:41,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-02-20 14:23:41,319 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 50 [2022-02-20 14:23:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:41,319 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-02-20 14:23:41,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 14:23:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-20 14:23:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 14:23:41,320 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:41,321 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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-02-20 14:23:41,340 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-02-20 14:23:41,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:41,528 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 874891816, now seen corresponding path program 1 times [2022-02-20 14:23:41,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:41,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843575061] [2022-02-20 14:23:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:41,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:41,544 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:41,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543360776] [2022-02-20 14:23:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:41,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:41,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:41,546 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-02-20 14:23:41,575 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-02-20 14:23:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:41,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:23:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:41,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:41,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {1420#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1420#true} is VALID [2022-02-20 14:23:41,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {1420#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ite11#1, main_#t~mem10#1, main_#t~ret12#1, main_#t~ite14#1, main_#t~mem13#1, main_#t~nondet15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~post16#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1420#true} is VALID [2022-02-20 14:23:41,781 INFO L272 TraceCheckUtils]: 2: Hoare triple {1420#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 1 then 1 else 0)); {1420#true} is VALID [2022-02-20 14:23:41,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {1420#true} ~cond := #in~cond; {1434#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 14:23:41,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {1434#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1438#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:41,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {1438#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1438#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:41,782 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1438#(not (= |assume_abort_if_not_#in~cond| 0))} {1420#true} #121#return; {1445#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:41,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {1445#(< 1 ~ARR_SIZE~0)} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1445#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:41,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {1445#(< 1 ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1452#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:41,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {1452#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1452#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:23:41,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {1452#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1459#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:23:41,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {1459#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1421#false} is VALID [2022-02-20 14:23:41,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1421#false} is VALID [2022-02-20 14:23:41,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1421#false} is VALID [2022-02-20 14:23:41,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1421#false} is VALID [2022-02-20 14:23:41,785 INFO L272 TraceCheckUtils]: 15: Hoare triple {1421#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1421#false} is VALID [2022-02-20 14:23:41,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {1421#false} ~cond := #in~cond; {1421#false} is VALID [2022-02-20 14:23:41,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {1421#false} assume !(0 == ~cond); {1421#false} is VALID [2022-02-20 14:23:41,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {1421#false} assume true; {1421#false} is VALID [2022-02-20 14:23:41,785 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1421#false} {1421#false} #123#return; {1421#false} is VALID [2022-02-20 14:23:41,786 INFO L272 TraceCheckUtils]: 20: Hoare triple {1421#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1421#false} is VALID [2022-02-20 14:23:41,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {1421#false} ~cond := #in~cond; {1421#false} is VALID [2022-02-20 14:23:41,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {1421#false} assume !(0 == ~cond); {1421#false} is VALID [2022-02-20 14:23:41,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {1421#false} assume true; {1421#false} is VALID [2022-02-20 14:23:41,797 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1421#false} {1421#false} #125#return; {1421#false} is VALID [2022-02-20 14:23:41,798 INFO L272 TraceCheckUtils]: 25: Hoare triple {1421#false} call main_#t~ret9#1 := outerBoundaryPatternCheck(main_~index1~0#1); {1421#false} is VALID [2022-02-20 14:23:41,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {1421#false} ~index := #in~index; {1421#false} is VALID [2022-02-20 14:23:41,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {1421#false} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {1421#false} is VALID [2022-02-20 14:23:41,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {1421#false} assume true; {1421#false} is VALID [2022-02-20 14:23:41,804 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1421#false} {1421#false} #127#return; {1421#false} is VALID [2022-02-20 14:23:41,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {1421#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {1421#false} assume 0 != main_#t~ret9#1;main_#t~ite11#1 := main_~num~0#1 * main_~num~0#1; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {1421#false} call write~int(main_#t~ite11#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret9#1;havoc main_#t~ite11#1;havoc main_#t~mem10#1; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L272 TraceCheckUtils]: 33: Hoare triple {1421#false} call main_#t~ret12#1 := outerBoundaryPatternCheck(main_~index1~0#1); {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {1421#false} ~index := #in~index; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {1421#false} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {1421#false} assume true; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1421#false} {1421#false} #129#return; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {1421#false} assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {1421#false} assume 0 != main_#t~ret12#1;main_#t~ite14#1 := main_~num~0#1; {1421#false} is VALID [2022-02-20 14:23:41,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {1421#false} call write~int(main_#t~ite14#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret12#1;havoc main_#t~ite14#1;havoc main_#t~mem13#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {1421#false} is VALID [2022-02-20 14:23:41,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {1421#false} assume 0 == main_~temp~0#1; {1421#false} is VALID [2022-02-20 14:23:41,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {1421#false} main_~row~0#1 := 0; {1421#false} is VALID [2022-02-20 14:23:41,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {1421#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1421#false} is VALID [2022-02-20 14:23:41,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {1421#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem18#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem18#1;havoc main_#t~mem18#1; {1421#false} is VALID [2022-02-20 14:23:41,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {1421#false} main_#t~post17#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1421#false} is VALID [2022-02-20 14:23:41,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {1421#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1421#false} is VALID [2022-02-20 14:23:41,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {1421#false} main_#t~post16#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {1421#false} is VALID [2022-02-20 14:23:41,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {1421#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1421#false} is VALID [2022-02-20 14:23:41,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {1421#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1421#false} is VALID [2022-02-20 14:23:41,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {1421#false} assume 0 == __VERIFIER_assert_~cond#1; {1421#false} is VALID [2022-02-20 14:23:41,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {1421#false} assume !false; {1421#false} is VALID [2022-02-20 14:23:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 14:23:41,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:42,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {1421#false} assume !false; {1421#false} is VALID [2022-02-20 14:23:42,106 INFO L290 TraceCheckUtils]: 50: Hoare triple {1421#false} assume 0 == __VERIFIER_assert_~cond#1; {1421#false} is VALID [2022-02-20 14:23:42,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {1421#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1421#false} is VALID [2022-02-20 14:23:42,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {1421#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1421#false} is VALID [2022-02-20 14:23:42,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {1421#false} main_#t~post16#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {1421#false} is VALID [2022-02-20 14:23:42,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {1421#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1421#false} is VALID [2022-02-20 14:23:42,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {1421#false} main_#t~post17#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1421#false} is VALID [2022-02-20 14:23:42,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {1421#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem18#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem18#1;havoc main_#t~mem18#1; {1421#false} is VALID [2022-02-20 14:23:42,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {1421#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1421#false} is VALID [2022-02-20 14:23:42,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {1421#false} main_~row~0#1 := 0; {1421#false} is VALID [2022-02-20 14:23:42,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {1421#false} assume 0 == main_~temp~0#1; {1421#false} is VALID [2022-02-20 14:23:42,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {1421#false} call write~int(main_#t~ite14#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret12#1;havoc main_#t~ite14#1;havoc main_#t~mem13#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {1421#false} is VALID [2022-02-20 14:23:42,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {1421#false} assume 0 != main_#t~ret12#1;main_#t~ite14#1 := main_~num~0#1; {1421#false} is VALID [2022-02-20 14:23:42,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {1421#false} assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1421#false} is VALID [2022-02-20 14:23:42,108 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1420#true} {1421#false} #129#return; {1421#false} is VALID [2022-02-20 14:23:42,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-02-20 14:23:42,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {1420#true} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {1420#true} is VALID [2022-02-20 14:23:42,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {1420#true} ~index := #in~index; {1420#true} is VALID [2022-02-20 14:23:42,109 INFO L272 TraceCheckUtils]: 33: Hoare triple {1421#false} call main_#t~ret12#1 := outerBoundaryPatternCheck(main_~index1~0#1); {1420#true} is VALID [2022-02-20 14:23:42,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {1421#false} call write~int(main_#t~ite11#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret9#1;havoc main_#t~ite11#1;havoc main_#t~mem10#1; {1421#false} is VALID [2022-02-20 14:23:42,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {1421#false} assume 0 != main_#t~ret9#1;main_#t~ite11#1 := main_~num~0#1 * main_~num~0#1; {1421#false} is VALID [2022-02-20 14:23:42,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {1421#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {1421#false} is VALID [2022-02-20 14:23:42,110 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1420#true} {1421#false} #127#return; {1421#false} is VALID [2022-02-20 14:23:42,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-02-20 14:23:42,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {1420#true} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {1420#true} is VALID [2022-02-20 14:23:42,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {1420#true} ~index := #in~index; {1420#true} is VALID [2022-02-20 14:23:42,110 INFO L272 TraceCheckUtils]: 25: Hoare triple {1421#false} call main_#t~ret9#1 := outerBoundaryPatternCheck(main_~index1~0#1); {1420#true} is VALID [2022-02-20 14:23:42,110 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1420#true} {1421#false} #125#return; {1421#false} is VALID [2022-02-20 14:23:42,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-02-20 14:23:42,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {1420#true} assume !(0 == ~cond); {1420#true} is VALID [2022-02-20 14:23:42,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {1420#true} ~cond := #in~cond; {1420#true} is VALID [2022-02-20 14:23:42,111 INFO L272 TraceCheckUtils]: 20: Hoare triple {1421#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1420#true} is VALID [2022-02-20 14:23:42,111 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1420#true} {1421#false} #123#return; {1421#false} is VALID [2022-02-20 14:23:42,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {1420#true} assume true; {1420#true} is VALID [2022-02-20 14:23:42,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {1420#true} assume !(0 == ~cond); {1420#true} is VALID [2022-02-20 14:23:42,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {1420#true} ~cond := #in~cond; {1420#true} is VALID [2022-02-20 14:23:42,112 INFO L272 TraceCheckUtils]: 15: Hoare triple {1421#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1420#true} is VALID [2022-02-20 14:23:42,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {1421#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1421#false} is VALID [2022-02-20 14:23:42,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {1421#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1421#false} is VALID [2022-02-20 14:23:42,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1421#false} is VALID [2022-02-20 14:23:42,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {1703#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1421#false} is VALID [2022-02-20 14:23:42,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {1707#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1703#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:42,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {1707#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1707#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:42,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {1445#(< 1 ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1707#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:42,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {1445#(< 1 ~ARR_SIZE~0)} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {1445#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:42,120 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1438#(not (= |assume_abort_if_not_#in~cond| 0))} {1420#true} #121#return; {1445#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:42,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {1438#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1438#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:42,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {1729#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1438#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 14:23:42,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {1420#true} ~cond := #in~cond; {1729#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:23:42,121 INFO L272 TraceCheckUtils]: 2: Hoare triple {1420#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 1 then 1 else 0)); {1420#true} is VALID [2022-02-20 14:23:42,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {1420#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ite11#1, main_#t~mem10#1, main_#t~ret12#1, main_#t~ite14#1, main_#t~mem13#1, main_#t~nondet15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~post16#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1420#true} is VALID [2022-02-20 14:23:42,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {1420#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1420#true} is VALID [2022-02-20 14:23:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:23:42,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:42,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843575061] [2022-02-20 14:23:42,122 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:42,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543360776] [2022-02-20 14:23:42,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543360776] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:42,123 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:42,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 14:23:42,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018699425] [2022-02-20 14:23:42,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:42,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 52 [2022-02-20 14:23:42,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:42,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:42,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:42,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 14:23:42,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:42,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 14:23:42,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 14:23:42,165 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:42,458 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2022-02-20 14:23:42,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:23:42,458 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 52 [2022-02-20 14:23:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-02-20 14:23:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-02-20 14:23:42,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 103 transitions. [2022-02-20 14:23:42,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:42,550 INFO L225 Difference]: With dead ends: 87 [2022-02-20 14:23:42,550 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 14:23:42,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:23:42,551 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:42,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 92 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:23:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 14:23:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-02-20 14:23:42,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:42,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:42,574 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:42,574 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:42,575 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-02-20 14:23:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-02-20 14:23:42,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:42,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:42,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 14:23:42,577 INFO L87 Difference]: Start difference. First operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 14:23:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:42,578 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-02-20 14:23:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-02-20 14:23:42,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:42,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:42,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:42,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-02-20 14:23:42,580 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 52 [2022-02-20 14:23:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:42,581 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-02-20 14:23:42,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-02-20 14:23:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 14:23:42,582 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:42,582 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 14:23:42,601 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-02-20 14:23:42,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:42,801 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:42,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:42,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1211966936, now seen corresponding path program 2 times [2022-02-20 14:23:42,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:42,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346228759] [2022-02-20 14:23:42,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:42,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:42,822 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:42,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053852138] [2022-02-20 14:23:42,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:23:42,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:42,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:42,824 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-02-20 14:23:42,828 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-02-20 14:23:42,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:23:42,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:42,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:23:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:42,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:43,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {2033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2033#true} is VALID [2022-02-20 14:23:43,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ite11#1, main_#t~mem10#1, main_#t~ret12#1, main_#t~ite14#1, main_#t~mem13#1, main_#t~nondet15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~post16#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2033#true} is VALID [2022-02-20 14:23:43,090 INFO L272 TraceCheckUtils]: 2: Hoare triple {2033#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 1 then 1 else 0)); {2033#true} is VALID [2022-02-20 14:23:43,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-02-20 14:23:43,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-02-20 14:23:43,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-02-20 14:23:43,091 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2033#true} {2033#true} #121#return; {2033#true} is VALID [2022-02-20 14:23:43,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {2033#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {2059#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:43,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {2059#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2063#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:43,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {2063#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {2063#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:43,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {2063#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2070#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:23:43,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {2070#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {2074#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:43,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {2074#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2074#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:43,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {2074#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2074#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:23:43,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2074#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2084#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:23:43,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {2084#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2034#false} is VALID [2022-02-20 14:23:43,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {2034#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2034#false} is VALID [2022-02-20 14:23:43,096 INFO L272 TraceCheckUtils]: 17: Hoare triple {2034#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2034#false} is VALID [2022-02-20 14:23:43,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {2034#false} ~cond := #in~cond; {2034#false} is VALID [2022-02-20 14:23:43,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {2034#false} assume !(0 == ~cond); {2034#false} is VALID [2022-02-20 14:23:43,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {2034#false} assume true; {2034#false} is VALID [2022-02-20 14:23:43,097 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2034#false} {2034#false} #123#return; {2034#false} is VALID [2022-02-20 14:23:43,097 INFO L272 TraceCheckUtils]: 22: Hoare triple {2034#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2034#false} is VALID [2022-02-20 14:23:43,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {2034#false} ~cond := #in~cond; {2034#false} is VALID [2022-02-20 14:23:43,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {2034#false} assume !(0 == ~cond); {2034#false} is VALID [2022-02-20 14:23:43,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {2034#false} assume true; {2034#false} is VALID [2022-02-20 14:23:43,097 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2034#false} {2034#false} #125#return; {2034#false} is VALID [2022-02-20 14:23:43,097 INFO L272 TraceCheckUtils]: 27: Hoare triple {2034#false} call main_#t~ret9#1 := outerBoundaryPatternCheck(main_~index1~0#1); {2034#false} is VALID [2022-02-20 14:23:43,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {2034#false} ~index := #in~index; {2034#false} is VALID [2022-02-20 14:23:43,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {2034#false} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {2034#false} is VALID [2022-02-20 14:23:43,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {2034#false} assume true; {2034#false} is VALID [2022-02-20 14:23:43,098 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2034#false} {2034#false} #127#return; {2034#false} is VALID [2022-02-20 14:23:43,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {2034#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {2034#false} is VALID [2022-02-20 14:23:43,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {2034#false} assume 0 != main_#t~ret9#1;main_#t~ite11#1 := main_~num~0#1 * main_~num~0#1; {2034#false} is VALID [2022-02-20 14:23:43,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {2034#false} call write~int(main_#t~ite11#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret9#1;havoc main_#t~ite11#1;havoc main_#t~mem10#1; {2034#false} is VALID [2022-02-20 14:23:43,099 INFO L272 TraceCheckUtils]: 35: Hoare triple {2034#false} call main_#t~ret12#1 := outerBoundaryPatternCheck(main_~index1~0#1); {2034#false} is VALID [2022-02-20 14:23:43,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {2034#false} ~index := #in~index; {2034#false} is VALID [2022-02-20 14:23:43,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {2034#false} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {2034#false} is VALID [2022-02-20 14:23:43,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {2034#false} assume true; {2034#false} is VALID [2022-02-20 14:23:43,099 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2034#false} {2034#false} #129#return; {2034#false} is VALID [2022-02-20 14:23:43,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {2034#false} assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2034#false} is VALID [2022-02-20 14:23:43,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {2034#false} assume 0 != main_#t~ret12#1;main_#t~ite14#1 := main_~num~0#1; {2034#false} is VALID [2022-02-20 14:23:43,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {2034#false} call write~int(main_#t~ite14#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret12#1;havoc main_#t~ite14#1;havoc main_#t~mem13#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {2034#false} is VALID [2022-02-20 14:23:43,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {2034#false} assume 0 == main_~temp~0#1; {2034#false} is VALID [2022-02-20 14:23:43,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {2034#false} main_~row~0#1 := 0; {2034#false} is VALID [2022-02-20 14:23:43,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {2034#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2034#false} is VALID [2022-02-20 14:23:43,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {2034#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem18#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem18#1;havoc main_#t~mem18#1; {2034#false} is VALID [2022-02-20 14:23:43,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {2034#false} main_#t~post17#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2034#false} is VALID [2022-02-20 14:23:43,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {2034#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem18#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem18#1;havoc main_#t~mem18#1; {2034#false} is VALID [2022-02-20 14:23:43,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {2034#false} main_#t~post17#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2034#false} is VALID [2022-02-20 14:23:43,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {2034#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2034#false} is VALID [2022-02-20 14:23:43,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {2034#false} main_#t~post16#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2034#false} is VALID [2022-02-20 14:23:43,101 INFO L290 TraceCheckUtils]: 52: Hoare triple {2034#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2034#false} is VALID [2022-02-20 14:23:43,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {2034#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2034#false} is VALID [2022-02-20 14:23:43,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {2034#false} assume 0 == __VERIFIER_assert_~cond#1; {2034#false} is VALID [2022-02-20 14:23:43,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {2034#false} assume !false; {2034#false} is VALID [2022-02-20 14:23:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:23:43,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:23:43,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {2034#false} assume !false; {2034#false} is VALID [2022-02-20 14:23:43,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {2034#false} assume 0 == __VERIFIER_assert_~cond#1; {2034#false} is VALID [2022-02-20 14:23:43,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {2034#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2034#false} is VALID [2022-02-20 14:23:43,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {2034#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2034#false} is VALID [2022-02-20 14:23:43,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {2034#false} main_#t~post16#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2034#false} is VALID [2022-02-20 14:23:43,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {2034#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2034#false} is VALID [2022-02-20 14:23:43,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {2034#false} main_#t~post17#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {2034#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem18#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem18#1;havoc main_#t~mem18#1; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 47: Hoare triple {2034#false} main_#t~post17#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {2034#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem18#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem18#1;havoc main_#t~mem18#1; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {2034#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {2034#false} main_~row~0#1 := 0; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {2034#false} assume 0 == main_~temp~0#1; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {2034#false} call write~int(main_#t~ite14#1, main_~#array~0#1.base, main_~#array~0#1.offset + (if (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 <= 2147483647 then (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 else (~ARR_SIZE~0 - 1 - main_~index1~0#1) % 4294967296 - 4294967296) * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret12#1;havoc main_#t~ite14#1;havoc main_#t~mem13#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {2034#false} assume 0 != main_#t~ret12#1;main_#t~ite14#1 := main_~num~0#1; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {2034#false} assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2033#true} {2034#false} #129#return; {2034#false} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {2033#true} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {2033#true} is VALID [2022-02-20 14:23:43,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {2033#true} ~index := #in~index; {2033#true} is VALID [2022-02-20 14:23:43,272 INFO L272 TraceCheckUtils]: 35: Hoare triple {2034#false} call main_#t~ret12#1 := outerBoundaryPatternCheck(main_~index1~0#1); {2033#true} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {2034#false} call write~int(main_#t~ite11#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~index1~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~index2~0#1, 4);havoc main_#t~ret9#1;havoc main_#t~ite11#1;havoc main_#t~mem10#1; {2034#false} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {2034#false} assume 0 != main_#t~ret9#1;main_#t~ite11#1 := main_~num~0#1 * main_~num~0#1; {2034#false} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {2034#false} assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {2034#false} is VALID [2022-02-20 14:23:43,272 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2033#true} {2034#false} #127#return; {2034#false} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {2033#true} assume 0 == ~index || ~index == ~ARR_SIZE~0 - 1;#res := 1; {2033#true} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {2033#true} ~index := #in~index; {2033#true} is VALID [2022-02-20 14:23:43,272 INFO L272 TraceCheckUtils]: 27: Hoare triple {2034#false} call main_#t~ret9#1 := outerBoundaryPatternCheck(main_~index1~0#1); {2033#true} is VALID [2022-02-20 14:23:43,272 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2033#true} {2034#false} #125#return; {2034#false} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-02-20 14:23:43,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-02-20 14:23:43,273 INFO L272 TraceCheckUtils]: 22: Hoare triple {2034#false} call assume_abort_if_not((if main_~index2~0#1 >= 0 && main_~index2~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2033#true} is VALID [2022-02-20 14:23:43,273 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2033#true} {2034#false} #123#return; {2034#false} is VALID [2022-02-20 14:23:43,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-02-20 14:23:43,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-02-20 14:23:43,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-02-20 14:23:43,273 INFO L272 TraceCheckUtils]: 17: Hoare triple {2034#false} call assume_abort_if_not((if main_~index1~0#1 >= 0 && main_~index1~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2033#true} is VALID [2022-02-20 14:23:43,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {2034#false} assume !false;assume -32768 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 32767;main_~index1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume -32768 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 32767;main_~index2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2034#false} is VALID [2022-02-20 14:23:43,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {2328#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {2034#false} is VALID [2022-02-20 14:23:43,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {2332#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2328#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:43,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {2332#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {2332#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:43,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {2332#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2332#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:43,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {2342#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {2332#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:23:43,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {2346#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2342#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:43,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {2346#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:43,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {2059#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {2346#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:23:43,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {2033#true} call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index1~0#1;havoc main_~index2~0#1;main_~row~0#1 := 0; {2059#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:23:43,280 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2033#true} {2033#true} #121#return; {2033#true} is VALID [2022-02-20 14:23:43,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-02-20 14:23:43,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-02-20 14:23:43,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-02-20 14:23:43,281 INFO L272 TraceCheckUtils]: 2: Hoare triple {2033#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 1 then 1 else 0)); {2033#true} is VALID [2022-02-20 14:23:43,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_#t~ite11#1, main_#t~mem10#1, main_#t~ret12#1, main_#t~ite14#1, main_#t~mem13#1, main_#t~nondet15#1, main_#t~mem18#1, main_#t~post17#1, main_#t~post16#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index1~0#1, main_~index2~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2033#true} is VALID [2022-02-20 14:23:43,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {2033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2033#true} is VALID [2022-02-20 14:23:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 14:23:43,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:23:43,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346228759] [2022-02-20 14:23:43,282 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:23:43,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053852138] [2022-02-20 14:23:43,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053852138] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:23:43,282 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:23:43,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 14:23:43,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501043157] [2022-02-20 14:23:43,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:23:43,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-02-20 14:23:43,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:23:43,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:43,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:43,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:23:43,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:23:43,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:23:43,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:23:43,336 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:43,842 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-02-20 14:23:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:23:43,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-02-20 14:23:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:23:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-02-20 14:23:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-02-20 14:23:43,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 111 transitions. [2022-02-20 14:23:43,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:23:43,923 INFO L225 Difference]: With dead ends: 108 [2022-02-20 14:23:43,924 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:23:43,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:23:43,925 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 46 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:23:43,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 200 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:23:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:23:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-02-20 14:23:43,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:23:43,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:44,000 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:44,000 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:44,002 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-02-20 14:23:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2022-02-20 14:23:44,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:44,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:44,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 75 states. [2022-02-20 14:23:44,003 INFO L87 Difference]: Start difference. First operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 75 states. [2022-02-20 14:23:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:23:44,004 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-02-20 14:23:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2022-02-20 14:23:44,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:23:44,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:23:44,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:23:44,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:23:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:23:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-02-20 14:23:44,006 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 56 [2022-02-20 14:23:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:23:44,007 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-02-20 14:23:44,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 14:23:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-02-20 14:23:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 14:23:44,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:23:44,008 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-02-20 14:23:44,026 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-02-20 14:23:44,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:44,224 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:23:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:23:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash -511912674, now seen corresponding path program 3 times [2022-02-20 14:23:44,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:23:44,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142305250] [2022-02-20 14:23:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:23:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:23:44,245 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:23:44,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942411576] [2022-02-20 14:23:44,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:23:44,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:23:44,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:44,247 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-02-20 14:23:44,248 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-02-20 14:23:45,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-02-20 14:23:45,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:23:45,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 102 conjunts are in the unsatisfiable core [2022-02-20 14:23:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:23:45,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:23:45,350 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 61 treesize of output 56 [2022-02-20 14:23:45,357 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 19 treesize of output 18 [2022-02-20 14:23:45,364 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 21 treesize of output 20 [2022-02-20 14:23:45,492 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 74 treesize of output 67 [2022-02-20 14:23:45,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:45,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:23:45,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:23:45,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 66 treesize of output 143 [2022-02-20 14:23:45,547 WARN L234 Elim1Store]: Array PQE input equivalent to false