java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/add-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:24:31,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:24:31,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:24:31,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:24:31,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:24:31,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:24:31,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:24:31,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:24:31,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:24:31,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:24:31,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:24:31,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:24:31,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:24:31,888 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:24:31,889 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:24:31,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:24:31,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:24:31,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:24:31,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:24:31,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:24:31,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:24:31,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:24:31,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:24:31,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:24:31,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:24:31,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:24:31,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:24:31,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:24:31,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:24:31,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:24:31,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:24:31,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:24:31,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:24:31,909 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:24:31,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:24:31,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:24:31,911 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:24:31,938 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:24:31,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:24:31,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:24:31,941 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:24:31,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:24:31,943 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:24:31,943 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:24:31,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:24:31,943 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:24:31,944 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:24:31,944 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:24:31,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:24:31,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:24:31,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:24:31,945 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:24:31,945 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:24:31,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:24:31,946 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:24:31,946 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:24:31,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:24:31,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:24:31,948 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:24:31,948 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:24:31,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:24:31,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:24:31,949 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:24:31,949 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:24:31,949 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:24:31,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:24:31,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:24:31,950 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:24:32,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:24:32,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:24:32,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:24:32,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:24:32,045 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:24:32,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/add-2-n-u_true-unreach-call.i [2018-11-18 23:24:32,125 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4adaf14/eb140ddcd8d84bc2a5cb83ffe53bb544/FLAGfd80f0fe5 [2018-11-18 23:24:32,611 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:24:32,612 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/add-2-n-u_true-unreach-call.i [2018-11-18 23:24:32,618 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4adaf14/eb140ddcd8d84bc2a5cb83ffe53bb544/FLAGfd80f0fe5 [2018-11-18 23:24:32,944 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4adaf14/eb140ddcd8d84bc2a5cb83ffe53bb544 [2018-11-18 23:24:32,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:24:32,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:24:32,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:24:32,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:24:32,960 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:24:32,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:24:32" (1/1) ... [2018-11-18 23:24:32,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61926cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:32, skipping insertion in model container [2018-11-18 23:24:32,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:24:32" (1/1) ... [2018-11-18 23:24:32,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:24:33,001 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:24:33,206 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:24:33,211 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:24:33,250 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:24:33,287 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:24:33,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33 WrapperNode [2018-11-18 23:24:33,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:24:33,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:24:33,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:24:33,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:24:33,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (1/1) ... [2018-11-18 23:24:33,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (1/1) ... [2018-11-18 23:24:33,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (1/1) ... [2018-11-18 23:24:33,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (1/1) ... [2018-11-18 23:24:33,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (1/1) ... [2018-11-18 23:24:33,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (1/1) ... [2018-11-18 23:24:33,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (1/1) ... [2018-11-18 23:24:33,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:24:33,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:24:33,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:24:33,345 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:24:33,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:24:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:24:33,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:24:33,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:24:33,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:24:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:24:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:24:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 23:24:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:24:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:24:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:24:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:24:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:24:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:24:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:24:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:24:34,267 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:24:34,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:24:34 BoogieIcfgContainer [2018-11-18 23:24:34,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:24:34,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:24:34,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:24:34,273 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:24:34,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:24:32" (1/3) ... [2018-11-18 23:24:34,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b412808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:24:34, skipping insertion in model container [2018-11-18 23:24:34,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:24:33" (2/3) ... [2018-11-18 23:24:34,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b412808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:24:34, skipping insertion in model container [2018-11-18 23:24:34,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:24:34" (3/3) ... [2018-11-18 23:24:34,279 INFO L112 eAbstractionObserver]: Analyzing ICFG add-2-n-u_true-unreach-call.i [2018-11-18 23:24:34,293 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:24:34,301 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:24:34,315 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:24:34,348 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:24:34,349 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:24:34,350 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:24:34,350 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:24:34,350 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:24:34,351 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:24:34,351 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:24:34,351 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:24:34,352 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:24:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-18 23:24:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:24:34,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:34,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:24:34,383 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:34,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash -439935169, now seen corresponding path program 1 times [2018-11-18 23:24:34,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:34,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:34,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:34,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:34,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:34,477 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:34,477 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:34,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:34,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:34,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:34,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-18 23:24:34,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-18 23:24:34,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-18 23:24:34,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-18 23:24:34,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret7 := main(); {39#true} is VALID [2018-11-18 23:24:34,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {39#true} is VALID [2018-11-18 23:24:34,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-18 23:24:34,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0; {40#false} is VALID [2018-11-18 23:24:34,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-18 23:24:34,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0; {40#false} is VALID [2018-11-18 23:24:34,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-18 23:24:34,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {40#false} is VALID [2018-11-18 23:24:34,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-18 23:24:34,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {40#false} is VALID [2018-11-18 23:24:34,881 INFO L256 TraceCheckUtils]: 14: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {40#false} is VALID [2018-11-18 23:24:34,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-18 23:24:34,882 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-18 23:24:34,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-18 23:24:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:24:34,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:24:34,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:24:34,927 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:24:34,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:34,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:24:35,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:35,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:24:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:24:35,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:24:35,021 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-18 23:24:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:35,181 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2018-11-18 23:24:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:24:35,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:24:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:24:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-18 23:24:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:24:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-18 23:24:35,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2018-11-18 23:24:35,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:35,638 INFO L225 Difference]: With dead ends: 66 [2018-11-18 23:24:35,638 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 23:24:35,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:24:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 23:24:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 23:24:35,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:35,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-18 23:24:35,839 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:24:35,839 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:24:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:35,851 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-18 23:24:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:24:35,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:35,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:35,854 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-18 23:24:35,854 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-18 23:24:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:35,860 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-18 23:24:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:24:35,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:35,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:35,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:35,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:24:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-18 23:24:35,876 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2018-11-18 23:24:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:35,876 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-18 23:24:35,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:24:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-18 23:24:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:24:35,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:35,879 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:24:35,880 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:35,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1117238025, now seen corresponding path program 1 times [2018-11-18 23:24:35,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:35,897 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:35,897 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:35,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:35,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:35,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:36,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2018-11-18 23:24:36,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {285#true} is VALID [2018-11-18 23:24:36,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2018-11-18 23:24:36,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #105#return; {285#true} is VALID [2018-11-18 23:24:36,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret7 := main(); {285#true} is VALID [2018-11-18 23:24:36,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {285#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:36,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:36,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {286#false} is VALID [2018-11-18 23:24:36,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {286#false} ~i~0 := 0;~j~0 := 0; {286#false} is VALID [2018-11-18 23:24:36,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:24:36,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#false} assume !(~i~0 < ~m~0); {286#false} is VALID [2018-11-18 23:24:36,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#false} ~i~0 := 0;~j~0 := 0; {286#false} is VALID [2018-11-18 23:24:36,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:24:36,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {286#false} is VALID [2018-11-18 23:24:36,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {286#false} assume true; {286#false} is VALID [2018-11-18 23:24:36,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {286#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {286#false} is VALID [2018-11-18 23:24:36,296 INFO L256 TraceCheckUtils]: 16: Hoare triple {286#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {286#false} is VALID [2018-11-18 23:24:36,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {286#false} ~cond := #in~cond; {286#false} is VALID [2018-11-18 23:24:36,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {286#false} assume 0 == ~cond; {286#false} is VALID [2018-11-18 23:24:36,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2018-11-18 23:24:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:24:36,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:24:36,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:24:36,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:24:36,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:36,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:24:36,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:36,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:24:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:24:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:24:36,369 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-18 23:24:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:36,922 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-18 23:24:36,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:24:36,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 23:24:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:24:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-18 23:24:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:24:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-18 23:24:36,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-18 23:24:37,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:37,115 INFO L225 Difference]: With dead ends: 56 [2018-11-18 23:24:37,115 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 23:24:37,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:24:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 23:24:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-18 23:24:37,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:37,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2018-11-18 23:24:37,137 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2018-11-18 23:24:37,137 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2018-11-18 23:24:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:37,142 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-18 23:24:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-18 23:24:37,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:37,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:37,144 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2018-11-18 23:24:37,144 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2018-11-18 23:24:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:37,147 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-18 23:24:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-18 23:24:37,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:37,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:37,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:37,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 23:24:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-18 23:24:37,151 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2018-11-18 23:24:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:37,152 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-18 23:24:37,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:24:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-18 23:24:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 23:24:37,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:37,153 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:24:37,154 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:37,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1388242926, now seen corresponding path program 1 times [2018-11-18 23:24:37,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:37,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:37,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:37,163 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:37,163 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:37,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:37,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:37,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:37,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2018-11-18 23:24:37,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {541#true} is VALID [2018-11-18 23:24:37,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2018-11-18 23:24:37,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #105#return; {541#true} is VALID [2018-11-18 23:24:37,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret7 := main(); {541#true} is VALID [2018-11-18 23:24:37,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {541#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {561#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:37,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {561#(<= 1500 main_~n~0)} assume true; {561#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:37,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {561#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {568#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:37,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {568#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {568#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:37,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {568#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {542#false} is VALID [2018-11-18 23:24:37,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#false} ~i~0 := 1 + ~i~0; {542#false} is VALID [2018-11-18 23:24:37,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 23:24:37,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {542#false} assume !(~i~0 < ~m~0); {542#false} is VALID [2018-11-18 23:24:37,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {542#false} ~i~0 := 0;~j~0 := 0; {542#false} is VALID [2018-11-18 23:24:37,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 23:24:37,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#false} assume !(~i~0 < ~m~0); {542#false} is VALID [2018-11-18 23:24:37,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#false} ~i~0 := 0;~j~0 := 0; {542#false} is VALID [2018-11-18 23:24:37,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 23:24:37,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {542#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {542#false} is VALID [2018-11-18 23:24:37,422 INFO L273 TraceCheckUtils]: 19: Hoare triple {542#false} assume true; {542#false} is VALID [2018-11-18 23:24:37,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {542#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {542#false} is VALID [2018-11-18 23:24:37,423 INFO L256 TraceCheckUtils]: 21: Hoare triple {542#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {542#false} is VALID [2018-11-18 23:24:37,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2018-11-18 23:24:37,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {542#false} assume 0 == ~cond; {542#false} is VALID [2018-11-18 23:24:37,424 INFO L273 TraceCheckUtils]: 24: Hoare triple {542#false} assume !false; {542#false} is VALID [2018-11-18 23:24:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:24:37,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:24:37,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:24:37,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:24:37,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:37,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:24:37,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:37,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:24:37,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:24:37,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:24:37,525 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 4 states. [2018-11-18 23:24:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:37,781 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-18 23:24:37,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:24:37,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-18 23:24:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:24:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-18 23:24:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:24:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-18 23:24:37,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2018-11-18 23:24:37,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:37,934 INFO L225 Difference]: With dead ends: 71 [2018-11-18 23:24:37,934 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 23:24:37,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:24:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 23:24:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-11-18 23:24:37,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:37,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 39 states. [2018-11-18 23:24:37,971 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 39 states. [2018-11-18 23:24:37,971 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 39 states. [2018-11-18 23:24:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:37,976 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-18 23:24:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 23:24:37,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:37,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:37,978 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 46 states. [2018-11-18 23:24:37,978 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 46 states. [2018-11-18 23:24:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:37,981 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-18 23:24:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 23:24:37,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:37,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:37,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:37,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 23:24:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 23:24:37,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2018-11-18 23:24:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:37,986 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 23:24:37,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:24:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 23:24:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 23:24:37,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:37,988 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 23:24:37,988 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:37,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash -248566036, now seen corresponding path program 1 times [2018-11-18 23:24:37,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:37,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:37,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:37,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:37,997 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:37,997 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:37,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:38,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:38,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:38,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {864#true} is VALID [2018-11-18 23:24:38,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {864#true} is VALID [2018-11-18 23:24:38,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2018-11-18 23:24:38,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #105#return; {864#true} is VALID [2018-11-18 23:24:38,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret7 := main(); {864#true} is VALID [2018-11-18 23:24:38,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {864#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {884#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:38,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {884#(<= 1500 main_~n~0)} assume true; {884#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:38,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {891#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:38,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {891#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {891#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:38,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {891#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:24:38,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:24:38,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {898#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {865#false} is VALID [2018-11-18 23:24:38,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {865#false} ~i~0 := 1 + ~i~0; {865#false} is VALID [2018-11-18 23:24:38,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:24:38,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {865#false} assume !(~i~0 < ~m~0); {865#false} is VALID [2018-11-18 23:24:38,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#false} ~i~0 := 0;~j~0 := 0; {865#false} is VALID [2018-11-18 23:24:38,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:24:38,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#false} assume !(~i~0 < ~m~0); {865#false} is VALID [2018-11-18 23:24:38,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#false} ~i~0 := 0;~j~0 := 0; {865#false} is VALID [2018-11-18 23:24:38,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:24:38,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {865#false} is VALID [2018-11-18 23:24:38,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {865#false} assume true; {865#false} is VALID [2018-11-18 23:24:38,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {865#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {865#false} is VALID [2018-11-18 23:24:38,237 INFO L256 TraceCheckUtils]: 23: Hoare triple {865#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {865#false} is VALID [2018-11-18 23:24:38,238 INFO L273 TraceCheckUtils]: 24: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2018-11-18 23:24:38,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {865#false} assume 0 == ~cond; {865#false} is VALID [2018-11-18 23:24:38,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {865#false} assume !false; {865#false} is VALID [2018-11-18 23:24:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:24:38,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:24:38,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 23:24:38,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 23:24:38,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:38,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:24:38,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:38,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:24:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:24:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:24:38,300 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-11-18 23:24:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:38,637 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2018-11-18 23:24:38,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:24:38,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 23:24:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:24:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-18 23:24:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:24:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-18 23:24:38,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-18 23:24:38,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:38,839 INFO L225 Difference]: With dead ends: 85 [2018-11-18 23:24:38,839 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 23:24:38,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:24:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 23:24:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-18 23:24:38,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:38,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 47 states. [2018-11-18 23:24:38,893 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 47 states. [2018-11-18 23:24:38,893 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 47 states. [2018-11-18 23:24:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:38,898 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-18 23:24:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-18 23:24:38,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:38,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:38,899 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states. [2018-11-18 23:24:38,899 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states. [2018-11-18 23:24:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:38,903 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-18 23:24:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-18 23:24:38,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:38,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:38,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:38,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 23:24:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-18 23:24:38,908 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 27 [2018-11-18 23:24:38,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:38,908 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-18 23:24:38,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:24:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 23:24:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:24:38,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:38,910 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:24:38,910 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:38,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash -235735226, now seen corresponding path program 2 times [2018-11-18 23:24:38,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:38,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:38,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:38,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:38,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:38,918 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:38,918 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:38,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:38,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:24:38,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 23:24:38,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:24:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:38,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:39,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2018-11-18 23:24:39,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {1243#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1243#true} is VALID [2018-11-18 23:24:39,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2018-11-18 23:24:39,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #105#return; {1243#true} is VALID [2018-11-18 23:24:39,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret7 := main(); {1243#true} is VALID [2018-11-18 23:24:39,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {1243#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {1263#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {1263#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {1263#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {1263#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {1263#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,124 INFO L273 TraceCheckUtils]: 15: Hoare triple {1263#(<= 1000 main_~m~0)} assume true; {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {1263#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {1263#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:24:39,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {1263#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0; {1300#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:39,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {1300#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1300#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:39,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {1300#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1244#false} is VALID [2018-11-18 23:24:39,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {1244#false} ~i~0 := 0;~j~0 := 0; {1244#false} is VALID [2018-11-18 23:24:39,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {1244#false} assume true; {1244#false} is VALID [2018-11-18 23:24:39,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {1244#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1244#false} is VALID [2018-11-18 23:24:39,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {1244#false} assume true; {1244#false} is VALID [2018-11-18 23:24:39,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {1244#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1244#false} is VALID [2018-11-18 23:24:39,134 INFO L256 TraceCheckUtils]: 25: Hoare triple {1244#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1244#false} is VALID [2018-11-18 23:24:39,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {1244#false} ~cond := #in~cond; {1244#false} is VALID [2018-11-18 23:24:39,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {1244#false} assume 0 == ~cond; {1244#false} is VALID [2018-11-18 23:24:39,135 INFO L273 TraceCheckUtils]: 28: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2018-11-18 23:24:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 23:24:39,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:24:39,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:24:39,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 23:24:39,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:39,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:24:39,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:39,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:24:39,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:24:39,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:24:39,185 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 4 states. [2018-11-18 23:24:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:39,524 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-18 23:24:39,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:24:39,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-18 23:24:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:24:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-18 23:24:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:24:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-18 23:24:39,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2018-11-18 23:24:39,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:39,713 INFO L225 Difference]: With dead ends: 96 [2018-11-18 23:24:39,713 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 23:24:39,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:24:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 23:24:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 49. [2018-11-18 23:24:39,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:39,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 49 states. [2018-11-18 23:24:39,813 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 49 states. [2018-11-18 23:24:39,813 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 49 states. [2018-11-18 23:24:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:39,817 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-18 23:24:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-18 23:24:39,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:39,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:39,819 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 76 states. [2018-11-18 23:24:39,819 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 76 states. [2018-11-18 23:24:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:39,823 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-18 23:24:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-18 23:24:39,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:39,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:39,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:39,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 23:24:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-18 23:24:39,827 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 29 [2018-11-18 23:24:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:39,828 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-18 23:24:39,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:24:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-18 23:24:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 23:24:39,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:39,829 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-18 23:24:39,830 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:39,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash -72304729, now seen corresponding path program 1 times [2018-11-18 23:24:39,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:39,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:39,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:39,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:24:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:39,838 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:39,839 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:39,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:39,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:39,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:40,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {1691#true} call ULTIMATE.init(); {1691#true} is VALID [2018-11-18 23:24:40,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {1691#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1691#true} is VALID [2018-11-18 23:24:40,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {1691#true} assume true; {1691#true} is VALID [2018-11-18 23:24:40,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1691#true} {1691#true} #105#return; {1691#true} is VALID [2018-11-18 23:24:40,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {1691#true} call #t~ret7 := main(); {1691#true} is VALID [2018-11-18 23:24:40,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {1691#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {1711#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:40,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {1711#(<= 1500 main_~n~0)} assume true; {1711#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:40,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {1711#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1718#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:40,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {1718#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {1718#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:40,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {1718#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:24:40,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:24:40,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {1725#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:24:40,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:24:40,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {1732#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1692#false} is VALID [2018-11-18 23:24:40,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {1692#false} ~i~0 := 1 + ~i~0; {1692#false} is VALID [2018-11-18 23:24:40,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:24:40,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {1692#false} assume !(~i~0 < ~m~0); {1692#false} is VALID [2018-11-18 23:24:40,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {1692#false} ~i~0 := 0;~j~0 := 0; {1692#false} is VALID [2018-11-18 23:24:40,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:24:40,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {1692#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1692#false} is VALID [2018-11-18 23:24:40,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:24:40,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {1692#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {1692#false} is VALID [2018-11-18 23:24:40,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:24:40,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {1692#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {1692#false} is VALID [2018-11-18 23:24:40,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:24:40,064 INFO L273 TraceCheckUtils]: 25: Hoare triple {1692#false} assume !(~j~0 < ~n~0); {1692#false} is VALID [2018-11-18 23:24:40,064 INFO L273 TraceCheckUtils]: 26: Hoare triple {1692#false} ~i~0 := 1 + ~i~0; {1692#false} is VALID [2018-11-18 23:24:40,065 INFO L273 TraceCheckUtils]: 27: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:24:40,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {1692#false} assume !(~i~0 < ~m~0); {1692#false} is VALID [2018-11-18 23:24:40,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {1692#false} ~i~0 := 0;~j~0 := 0; {1692#false} is VALID [2018-11-18 23:24:40,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:24:40,065 INFO L273 TraceCheckUtils]: 31: Hoare triple {1692#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1692#false} is VALID [2018-11-18 23:24:40,066 INFO L273 TraceCheckUtils]: 32: Hoare triple {1692#false} assume true; {1692#false} is VALID [2018-11-18 23:24:40,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {1692#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1692#false} is VALID [2018-11-18 23:24:40,066 INFO L256 TraceCheckUtils]: 34: Hoare triple {1692#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1692#false} is VALID [2018-11-18 23:24:40,066 INFO L273 TraceCheckUtils]: 35: Hoare triple {1692#false} ~cond := #in~cond; {1692#false} is VALID [2018-11-18 23:24:40,066 INFO L273 TraceCheckUtils]: 36: Hoare triple {1692#false} assume 0 == ~cond; {1692#false} is VALID [2018-11-18 23:24:40,067 INFO L273 TraceCheckUtils]: 37: Hoare triple {1692#false} assume !false; {1692#false} is VALID [2018-11-18 23:24:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 23:24:40,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:24:40,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 23:24:40,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-18 23:24:40,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:40,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:24:40,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:40,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:24:40,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:24:40,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:24:40,146 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 6 states. [2018-11-18 23:24:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:40,714 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-11-18 23:24:40,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:24:40,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-18 23:24:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:24:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2018-11-18 23:24:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:24:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2018-11-18 23:24:40,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2018-11-18 23:24:40,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:40,899 INFO L225 Difference]: With dead ends: 102 [2018-11-18 23:24:40,899 INFO L226 Difference]: Without dead ends: 61 [2018-11-18 23:24:40,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:24:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-18 23:24:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-18 23:24:40,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:40,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 57 states. [2018-11-18 23:24:40,997 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 57 states. [2018-11-18 23:24:40,998 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 57 states. [2018-11-18 23:24:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:41,000 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-18 23:24:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-18 23:24:41,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:41,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:41,001 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 61 states. [2018-11-18 23:24:41,001 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 61 states. [2018-11-18 23:24:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:41,004 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-18 23:24:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-18 23:24:41,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:41,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:41,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:41,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 23:24:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-18 23:24:41,008 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 38 [2018-11-18 23:24:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:41,009 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-18 23:24:41,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:24:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-18 23:24:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 23:24:41,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:41,010 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2018-11-18 23:24:41,010 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:41,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2073021427, now seen corresponding path program 2 times [2018-11-18 23:24:41,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:41,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:41,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:41,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:24:41,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:41,019 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:41,019 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:41,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:41,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:24:41,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:24:41,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:24:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:41,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:41,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {2159#true} call ULTIMATE.init(); {2159#true} is VALID [2018-11-18 23:24:41,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {2159#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2159#true} is VALID [2018-11-18 23:24:41,778 INFO L273 TraceCheckUtils]: 2: Hoare triple {2159#true} assume true; {2159#true} is VALID [2018-11-18 23:24:41,779 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2159#true} {2159#true} #105#return; {2159#true} is VALID [2018-11-18 23:24:41,779 INFO L256 TraceCheckUtils]: 4: Hoare triple {2159#true} call #t~ret7 := main(); {2159#true} is VALID [2018-11-18 23:24:41,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {2159#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {2179#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:41,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {2179#(<= 1500 main_~n~0)} assume true; {2179#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:41,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {2179#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2186#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:41,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {2186#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {2186#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:41,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {2186#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:24:41,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:24:41,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {2193#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:24:41,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:24:41,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {2200#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:24:41,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:24:41,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {2207#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {2160#false} is VALID [2018-11-18 23:24:41,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {2160#false} ~i~0 := 1 + ~i~0; {2160#false} is VALID [2018-11-18 23:24:41,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {2160#false} assume !(~i~0 < ~m~0); {2160#false} is VALID [2018-11-18 23:24:41,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {2160#false} ~i~0 := 0;~j~0 := 0; {2160#false} is VALID [2018-11-18 23:24:41,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {2160#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2160#false} is VALID [2018-11-18 23:24:41,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {2160#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {2160#false} is VALID [2018-11-18 23:24:41,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {2160#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {2160#false} is VALID [2018-11-18 23:24:41,794 INFO L273 TraceCheckUtils]: 26: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,794 INFO L273 TraceCheckUtils]: 27: Hoare triple {2160#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {2160#false} is VALID [2018-11-18 23:24:41,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,795 INFO L273 TraceCheckUtils]: 29: Hoare triple {2160#false} assume !(~j~0 < ~n~0); {2160#false} is VALID [2018-11-18 23:24:41,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {2160#false} ~i~0 := 1 + ~i~0; {2160#false} is VALID [2018-11-18 23:24:41,795 INFO L273 TraceCheckUtils]: 31: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,795 INFO L273 TraceCheckUtils]: 32: Hoare triple {2160#false} assume !(~i~0 < ~m~0); {2160#false} is VALID [2018-11-18 23:24:41,796 INFO L273 TraceCheckUtils]: 33: Hoare triple {2160#false} ~i~0 := 0;~j~0 := 0; {2160#false} is VALID [2018-11-18 23:24:41,796 INFO L273 TraceCheckUtils]: 34: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {2160#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2160#false} is VALID [2018-11-18 23:24:41,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {2160#false} assume true; {2160#false} is VALID [2018-11-18 23:24:41,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {2160#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2160#false} is VALID [2018-11-18 23:24:41,797 INFO L256 TraceCheckUtils]: 38: Hoare triple {2160#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {2160#false} is VALID [2018-11-18 23:24:41,797 INFO L273 TraceCheckUtils]: 39: Hoare triple {2160#false} ~cond := #in~cond; {2160#false} is VALID [2018-11-18 23:24:41,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {2160#false} assume 0 == ~cond; {2160#false} is VALID [2018-11-18 23:24:41,797 INFO L273 TraceCheckUtils]: 41: Hoare triple {2160#false} assume !false; {2160#false} is VALID [2018-11-18 23:24:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 23:24:41,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:24:41,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-18 23:24:41,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-18 23:24:41,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:41,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:24:41,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:41,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:24:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:24:41,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:24:41,943 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 7 states. [2018-11-18 23:24:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:43,027 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-18 23:24:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:24:43,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-18 23:24:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:24:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2018-11-18 23:24:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:24:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2018-11-18 23:24:43,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2018-11-18 23:24:43,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:43,223 INFO L225 Difference]: With dead ends: 118 [2018-11-18 23:24:43,223 INFO L226 Difference]: Without dead ends: 69 [2018-11-18 23:24:43,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:24:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-18 23:24:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-18 23:24:43,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:43,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 65 states. [2018-11-18 23:24:43,382 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 65 states. [2018-11-18 23:24:43,382 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 65 states. [2018-11-18 23:24:43,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:43,387 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-18 23:24:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-18 23:24:43,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:43,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:43,388 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 69 states. [2018-11-18 23:24:43,388 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 69 states. [2018-11-18 23:24:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:43,391 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-18 23:24:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-18 23:24:43,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:43,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:43,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:43,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 23:24:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-11-18 23:24:43,394 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 42 [2018-11-18 23:24:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:43,394 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-11-18 23:24:43,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:24:43,395 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-18 23:24:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 23:24:43,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:43,396 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2018-11-18 23:24:43,396 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:43,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1880122817, now seen corresponding path program 3 times [2018-11-18 23:24:43,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:43,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:43,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:24:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:43,403 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:43,404 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:43,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:43,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:24:43,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 23:24:43,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:24:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:43,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:43,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {2692#true} call ULTIMATE.init(); {2692#true} is VALID [2018-11-18 23:24:43,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {2692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2692#true} is VALID [2018-11-18 23:24:43,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {2692#true} assume true; {2692#true} is VALID [2018-11-18 23:24:43,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2692#true} {2692#true} #105#return; {2692#true} is VALID [2018-11-18 23:24:43,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {2692#true} call #t~ret7 := main(); {2692#true} is VALID [2018-11-18 23:24:43,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {2692#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,613 INFO L273 TraceCheckUtils]: 17: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {2712#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:24:43,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {2752#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2693#false} is VALID [2018-11-18 23:24:43,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {2693#false} ~i~0 := 0;~j~0 := 0; {2693#false} is VALID [2018-11-18 23:24:43,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {2693#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2693#false} is VALID [2018-11-18 23:24:43,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,618 INFO L273 TraceCheckUtils]: 25: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {2693#false} is VALID [2018-11-18 23:24:43,618 INFO L273 TraceCheckUtils]: 26: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {2693#false} is VALID [2018-11-18 23:24:43,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,619 INFO L273 TraceCheckUtils]: 29: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {2693#false} is VALID [2018-11-18 23:24:43,619 INFO L273 TraceCheckUtils]: 30: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {2693#false} is VALID [2018-11-18 23:24:43,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,619 INFO L273 TraceCheckUtils]: 33: Hoare triple {2693#false} assume !(~j~0 < ~n~0); {2693#false} is VALID [2018-11-18 23:24:43,619 INFO L273 TraceCheckUtils]: 34: Hoare triple {2693#false} ~i~0 := 1 + ~i~0; {2693#false} is VALID [2018-11-18 23:24:43,620 INFO L273 TraceCheckUtils]: 35: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,620 INFO L273 TraceCheckUtils]: 36: Hoare triple {2693#false} assume !(~i~0 < ~m~0); {2693#false} is VALID [2018-11-18 23:24:43,620 INFO L273 TraceCheckUtils]: 37: Hoare triple {2693#false} ~i~0 := 0;~j~0 := 0; {2693#false} is VALID [2018-11-18 23:24:43,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,620 INFO L273 TraceCheckUtils]: 39: Hoare triple {2693#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2693#false} is VALID [2018-11-18 23:24:43,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {2693#false} assume true; {2693#false} is VALID [2018-11-18 23:24:43,621 INFO L273 TraceCheckUtils]: 41: Hoare triple {2693#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2693#false} is VALID [2018-11-18 23:24:43,621 INFO L256 TraceCheckUtils]: 42: Hoare triple {2693#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {2693#false} is VALID [2018-11-18 23:24:43,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {2693#false} ~cond := #in~cond; {2693#false} is VALID [2018-11-18 23:24:43,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {2693#false} assume 0 == ~cond; {2693#false} is VALID [2018-11-18 23:24:43,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {2693#false} assume !false; {2693#false} is VALID [2018-11-18 23:24:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 23:24:43,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:24:43,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-18 23:24:43,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-18 23:24:43,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:43,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:24:43,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:43,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:24:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:24:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:24:43,696 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2018-11-18 23:24:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:43,894 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-11-18 23:24:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:24:43,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-18 23:24:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:24:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-18 23:24:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:24:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-18 23:24:43,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2018-11-18 23:24:44,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:44,026 INFO L225 Difference]: With dead ends: 133 [2018-11-18 23:24:44,026 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 23:24:44,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:24:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 23:24:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-11-18 23:24:44,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:44,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 78 states. [2018-11-18 23:24:44,225 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 78 states. [2018-11-18 23:24:44,225 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 78 states. [2018-11-18 23:24:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:44,229 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-18 23:24:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-18 23:24:44,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:44,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:44,229 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 89 states. [2018-11-18 23:24:44,230 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 89 states. [2018-11-18 23:24:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:44,232 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-18 23:24:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-18 23:24:44,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:44,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:44,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:44,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 23:24:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-11-18 23:24:44,236 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 46 [2018-11-18 23:24:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:44,236 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-11-18 23:24:44,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:24:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-18 23:24:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 23:24:44,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:44,237 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 5, 4, 3, 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] [2018-11-18 23:24:44,237 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:44,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash 264780802, now seen corresponding path program 4 times [2018-11-18 23:24:44,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:44,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:44,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:44,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:24:44,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:44,244 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:44,244 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:44,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:44,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:24:52,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:24:52,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:24:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:24:52,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:24:52,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {3315#true} call ULTIMATE.init(); {3315#true} is VALID [2018-11-18 23:24:52,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {3315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3315#true} is VALID [2018-11-18 23:24:52,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {3315#true} assume true; {3315#true} is VALID [2018-11-18 23:24:52,842 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3315#true} {3315#true} #105#return; {3315#true} is VALID [2018-11-18 23:24:52,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {3315#true} call #t~ret7 := main(); {3315#true} is VALID [2018-11-18 23:24:52,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {3315#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {3335#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:52,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {3335#(<= 1500 main_~n~0)} assume true; {3335#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:24:52,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {3335#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3342#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:52,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {3342#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {3342#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:24:52,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {3342#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3349#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:24:52,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {3349#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {3349#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:24:52,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {3349#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3356#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:24:52,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {3356#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {3356#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:24:52,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {3356#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3363#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:24:52,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {3363#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {3363#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:24:52,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {3363#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3370#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:24:52,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {3370#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {3370#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:24:52,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {3370#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {3316#false} is VALID [2018-11-18 23:24:52,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {3316#false} ~i~0 := 1 + ~i~0; {3316#false} is VALID [2018-11-18 23:24:52,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {3316#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3316#false} is VALID [2018-11-18 23:24:52,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3316#false} is VALID [2018-11-18 23:24:52,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3316#false} is VALID [2018-11-18 23:24:52,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3316#false} is VALID [2018-11-18 23:24:52,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,863 INFO L273 TraceCheckUtils]: 28: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {3316#false} is VALID [2018-11-18 23:24:52,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {3316#false} assume !(~j~0 < ~n~0); {3316#false} is VALID [2018-11-18 23:24:52,863 INFO L273 TraceCheckUtils]: 31: Hoare triple {3316#false} ~i~0 := 1 + ~i~0; {3316#false} is VALID [2018-11-18 23:24:52,863 INFO L273 TraceCheckUtils]: 32: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,863 INFO L273 TraceCheckUtils]: 33: Hoare triple {3316#false} assume !(~i~0 < ~m~0); {3316#false} is VALID [2018-11-18 23:24:52,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {3316#false} ~i~0 := 0;~j~0 := 0; {3316#false} is VALID [2018-11-18 23:24:52,864 INFO L273 TraceCheckUtils]: 35: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {3316#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3316#false} is VALID [2018-11-18 23:24:52,864 INFO L273 TraceCheckUtils]: 37: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,864 INFO L273 TraceCheckUtils]: 38: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {3316#false} is VALID [2018-11-18 23:24:52,864 INFO L273 TraceCheckUtils]: 39: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,865 INFO L273 TraceCheckUtils]: 40: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {3316#false} is VALID [2018-11-18 23:24:52,865 INFO L273 TraceCheckUtils]: 41: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,865 INFO L273 TraceCheckUtils]: 42: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {3316#false} is VALID [2018-11-18 23:24:52,865 INFO L273 TraceCheckUtils]: 43: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,865 INFO L273 TraceCheckUtils]: 44: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {3316#false} is VALID [2018-11-18 23:24:52,866 INFO L273 TraceCheckUtils]: 45: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,866 INFO L273 TraceCheckUtils]: 46: Hoare triple {3316#false} assume !(~j~0 < ~n~0); {3316#false} is VALID [2018-11-18 23:24:52,866 INFO L273 TraceCheckUtils]: 47: Hoare triple {3316#false} ~i~0 := 1 + ~i~0; {3316#false} is VALID [2018-11-18 23:24:52,866 INFO L273 TraceCheckUtils]: 48: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,866 INFO L273 TraceCheckUtils]: 49: Hoare triple {3316#false} assume !(~i~0 < ~m~0); {3316#false} is VALID [2018-11-18 23:24:52,867 INFO L273 TraceCheckUtils]: 50: Hoare triple {3316#false} ~i~0 := 0;~j~0 := 0; {3316#false} is VALID [2018-11-18 23:24:52,867 INFO L273 TraceCheckUtils]: 51: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,867 INFO L273 TraceCheckUtils]: 52: Hoare triple {3316#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3316#false} is VALID [2018-11-18 23:24:52,867 INFO L273 TraceCheckUtils]: 53: Hoare triple {3316#false} assume true; {3316#false} is VALID [2018-11-18 23:24:52,868 INFO L273 TraceCheckUtils]: 54: Hoare triple {3316#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3316#false} is VALID [2018-11-18 23:24:52,868 INFO L256 TraceCheckUtils]: 55: Hoare triple {3316#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {3316#false} is VALID [2018-11-18 23:24:52,868 INFO L273 TraceCheckUtils]: 56: Hoare triple {3316#false} ~cond := #in~cond; {3316#false} is VALID [2018-11-18 23:24:52,868 INFO L273 TraceCheckUtils]: 57: Hoare triple {3316#false} assume 0 == ~cond; {3316#false} is VALID [2018-11-18 23:24:52,868 INFO L273 TraceCheckUtils]: 58: Hoare triple {3316#false} assume !false; {3316#false} is VALID [2018-11-18 23:24:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 54 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 23:24:52,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:24:52,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-18 23:24:52,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-18 23:24:52,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:24:52,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:24:52,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:52,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:24:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:24:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:24:52,932 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 8 states. [2018-11-18 23:24:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:53,574 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2018-11-18 23:24:53,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 23:24:53,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-18 23:24:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:24:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:24:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2018-11-18 23:24:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:24:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2018-11-18 23:24:53,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 120 transitions. [2018-11-18 23:24:53,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:24:53,723 INFO L225 Difference]: With dead ends: 152 [2018-11-18 23:24:53,723 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 23:24:53,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:24:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 23:24:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-18 23:24:53,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:24:53,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 88 states. [2018-11-18 23:24:53,957 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 88 states. [2018-11-18 23:24:53,957 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 88 states. [2018-11-18 23:24:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:53,960 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-11-18 23:24:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-11-18 23:24:53,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:53,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:53,961 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 92 states. [2018-11-18 23:24:53,962 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 92 states. [2018-11-18 23:24:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:24:53,965 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-11-18 23:24:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-11-18 23:24:53,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:24:53,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:24:53,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:24:53,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:24:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 23:24:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-11-18 23:24:53,969 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 59 [2018-11-18 23:24:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:24:53,970 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-11-18 23:24:53,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:24:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-18 23:24:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 23:24:53,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:24:53,971 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 6, 5, 3, 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] [2018-11-18 23:24:53,971 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:24:53,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:24:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2100343256, now seen corresponding path program 5 times [2018-11-18 23:24:53,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:24:53,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:24:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:53,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:24:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:24:53,978 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:24:53,978 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:24:53,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:24:54,003 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:25:01,186 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-18 23:25:01,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:01,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:01,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {4030#true} call ULTIMATE.init(); {4030#true} is VALID [2018-11-18 23:25:01,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {4030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4030#true} is VALID [2018-11-18 23:25:01,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {4030#true} assume true; {4030#true} is VALID [2018-11-18 23:25:01,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4030#true} {4030#true} #105#return; {4030#true} is VALID [2018-11-18 23:25:01,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {4030#true} call #t~ret7 := main(); {4030#true} is VALID [2018-11-18 23:25:01,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {4030#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {4050#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:01,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {4050#(<= 1500 main_~n~0)} assume true; {4050#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:01,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {4050#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4057#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:01,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {4057#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4057#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:01,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {4057#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4064#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:01,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {4064#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {4064#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:01,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {4064#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4071#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:01,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {4071#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {4071#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:01,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {4071#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4078#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:01,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {4078#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {4078#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:01,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {4078#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4085#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:01,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {4085#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {4085#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:01,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {4085#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4092#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:01,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {4092#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {4092#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:01,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {4092#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !(~j~0 < ~n~0); {4031#false} is VALID [2018-11-18 23:25:01,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {4031#false} ~i~0 := 1 + ~i~0; {4031#false} is VALID [2018-11-18 23:25:01,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,526 INFO L273 TraceCheckUtils]: 22: Hoare triple {4031#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4031#false} is VALID [2018-11-18 23:25:01,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,529 INFO L273 TraceCheckUtils]: 32: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {4031#false} assume !(~j~0 < ~n~0); {4031#false} is VALID [2018-11-18 23:25:01,530 INFO L273 TraceCheckUtils]: 35: Hoare triple {4031#false} ~i~0 := 1 + ~i~0; {4031#false} is VALID [2018-11-18 23:25:01,530 INFO L273 TraceCheckUtils]: 36: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,530 INFO L273 TraceCheckUtils]: 37: Hoare triple {4031#false} assume !(~i~0 < ~m~0); {4031#false} is VALID [2018-11-18 23:25:01,531 INFO L273 TraceCheckUtils]: 38: Hoare triple {4031#false} ~i~0 := 0;~j~0 := 0; {4031#false} is VALID [2018-11-18 23:25:01,531 INFO L273 TraceCheckUtils]: 39: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,531 INFO L273 TraceCheckUtils]: 40: Hoare triple {4031#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4031#false} is VALID [2018-11-18 23:25:01,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,533 INFO L273 TraceCheckUtils]: 49: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4031#false} is VALID [2018-11-18 23:25:01,533 INFO L273 TraceCheckUtils]: 51: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {4031#false} assume !(~j~0 < ~n~0); {4031#false} is VALID [2018-11-18 23:25:01,534 INFO L273 TraceCheckUtils]: 53: Hoare triple {4031#false} ~i~0 := 1 + ~i~0; {4031#false} is VALID [2018-11-18 23:25:01,534 INFO L273 TraceCheckUtils]: 54: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,534 INFO L273 TraceCheckUtils]: 55: Hoare triple {4031#false} assume !(~i~0 < ~m~0); {4031#false} is VALID [2018-11-18 23:25:01,534 INFO L273 TraceCheckUtils]: 56: Hoare triple {4031#false} ~i~0 := 0;~j~0 := 0; {4031#false} is VALID [2018-11-18 23:25:01,535 INFO L273 TraceCheckUtils]: 57: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,535 INFO L273 TraceCheckUtils]: 58: Hoare triple {4031#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4031#false} is VALID [2018-11-18 23:25:01,535 INFO L273 TraceCheckUtils]: 59: Hoare triple {4031#false} assume true; {4031#false} is VALID [2018-11-18 23:25:01,535 INFO L273 TraceCheckUtils]: 60: Hoare triple {4031#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4031#false} is VALID [2018-11-18 23:25:01,535 INFO L256 TraceCheckUtils]: 61: Hoare triple {4031#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {4031#false} is VALID [2018-11-18 23:25:01,536 INFO L273 TraceCheckUtils]: 62: Hoare triple {4031#false} ~cond := #in~cond; {4031#false} is VALID [2018-11-18 23:25:01,536 INFO L273 TraceCheckUtils]: 63: Hoare triple {4031#false} assume 0 == ~cond; {4031#false} is VALID [2018-11-18 23:25:01,536 INFO L273 TraceCheckUtils]: 64: Hoare triple {4031#false} assume !false; {4031#false} is VALID [2018-11-18 23:25:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 23:25:01,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:01,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-18 23:25:01,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-11-18 23:25:01,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:01,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:25:01,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:01,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:25:01,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:25:01,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:25:01,610 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 9 states. [2018-11-18 23:25:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:02,139 INFO L93 Difference]: Finished difference Result 170 states and 195 transitions. [2018-11-18 23:25:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 23:25:02,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-11-18 23:25:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:25:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2018-11-18 23:25:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:25:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2018-11-18 23:25:02,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 129 transitions. [2018-11-18 23:25:02,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:02,827 INFO L225 Difference]: With dead ends: 170 [2018-11-18 23:25:02,827 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 23:25:02,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:25:02,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 23:25:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-11-18 23:25:03,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:03,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 98 states. [2018-11-18 23:25:03,557 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 98 states. [2018-11-18 23:25:03,557 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 98 states. [2018-11-18 23:25:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:03,561 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-11-18 23:25:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2018-11-18 23:25:03,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:03,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:03,562 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 102 states. [2018-11-18 23:25:03,562 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 102 states. [2018-11-18 23:25:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:03,564 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2018-11-18 23:25:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2018-11-18 23:25:03,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:03,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:03,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:03,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 23:25:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-11-18 23:25:03,568 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 65 [2018-11-18 23:25:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:03,569 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-18 23:25:03,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:25:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-11-18 23:25:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 23:25:03,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:03,570 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 7, 6, 3, 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] [2018-11-18 23:25:03,570 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:03,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:03,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1489292850, now seen corresponding path program 6 times [2018-11-18 23:25:03,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:03,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:03,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:03,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:03,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:03,577 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:03,577 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:03,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:03,588 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:25:03,607 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-11-18 23:25:03,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:03,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:03,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {4826#true} call ULTIMATE.init(); {4826#true} is VALID [2018-11-18 23:25:03,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {4826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4826#true} is VALID [2018-11-18 23:25:03,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {4826#true} assume true; {4826#true} is VALID [2018-11-18 23:25:03,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4826#true} {4826#true} #105#return; {4826#true} is VALID [2018-11-18 23:25:03,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {4826#true} call #t~ret7 := main(); {4826#true} is VALID [2018-11-18 23:25:03,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {4826#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {4846#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {4846#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,813 INFO L273 TraceCheckUtils]: 32: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,815 INFO L273 TraceCheckUtils]: 35: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,816 INFO L273 TraceCheckUtils]: 36: Hoare triple {4846#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,816 INFO L273 TraceCheckUtils]: 37: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,817 INFO L273 TraceCheckUtils]: 38: Hoare triple {4846#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,818 INFO L273 TraceCheckUtils]: 39: Hoare triple {4846#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,818 INFO L273 TraceCheckUtils]: 40: Hoare triple {4846#(<= 1000 main_~m~0)} assume true; {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,819 INFO L273 TraceCheckUtils]: 41: Hoare triple {4846#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {4846#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:03,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {4846#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,821 INFO L273 TraceCheckUtils]: 43: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,822 INFO L273 TraceCheckUtils]: 45: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,825 INFO L273 TraceCheckUtils]: 48: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,826 INFO L273 TraceCheckUtils]: 49: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,828 INFO L273 TraceCheckUtils]: 51: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,829 INFO L273 TraceCheckUtils]: 52: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,830 INFO L273 TraceCheckUtils]: 53: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,831 INFO L273 TraceCheckUtils]: 54: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,832 INFO L273 TraceCheckUtils]: 55: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,833 INFO L273 TraceCheckUtils]: 56: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,834 INFO L273 TraceCheckUtils]: 57: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,834 INFO L273 TraceCheckUtils]: 58: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,840 INFO L273 TraceCheckUtils]: 59: Hoare triple {4958#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {5010#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,840 INFO L273 TraceCheckUtils]: 60: Hoare triple {5010#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {5010#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:03,841 INFO L273 TraceCheckUtils]: 61: Hoare triple {5010#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {4827#false} is VALID [2018-11-18 23:25:03,841 INFO L273 TraceCheckUtils]: 62: Hoare triple {4827#false} ~i~0 := 0;~j~0 := 0; {4827#false} is VALID [2018-11-18 23:25:03,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {4827#false} assume true; {4827#false} is VALID [2018-11-18 23:25:03,841 INFO L273 TraceCheckUtils]: 64: Hoare triple {4827#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4827#false} is VALID [2018-11-18 23:25:03,841 INFO L273 TraceCheckUtils]: 65: Hoare triple {4827#false} assume true; {4827#false} is VALID [2018-11-18 23:25:03,842 INFO L273 TraceCheckUtils]: 66: Hoare triple {4827#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4827#false} is VALID [2018-11-18 23:25:03,842 INFO L256 TraceCheckUtils]: 67: Hoare triple {4827#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {4827#false} is VALID [2018-11-18 23:25:03,842 INFO L273 TraceCheckUtils]: 68: Hoare triple {4827#false} ~cond := #in~cond; {4827#false} is VALID [2018-11-18 23:25:03,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {4827#false} assume 0 == ~cond; {4827#false} is VALID [2018-11-18 23:25:03,842 INFO L273 TraceCheckUtils]: 70: Hoare triple {4827#false} assume !false; {4827#false} is VALID [2018-11-18 23:25:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-18 23:25:03,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:03,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 23:25:03,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-18 23:25:03,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:03,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:25:03,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:03,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:25:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:25:03,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:25:03,904 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 5 states. [2018-11-18 23:25:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:04,583 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2018-11-18 23:25:04,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:25:04,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-18 23:25:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2018-11-18 23:25:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2018-11-18 23:25:04,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2018-11-18 23:25:04,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:04,772 INFO L225 Difference]: With dead ends: 239 [2018-11-18 23:25:04,772 INFO L226 Difference]: Without dead ends: 203 [2018-11-18 23:25:04,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:25:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-18 23:25:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2018-11-18 23:25:05,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:05,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 115 states. [2018-11-18 23:25:05,317 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 115 states. [2018-11-18 23:25:05,318 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 115 states. [2018-11-18 23:25:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:05,325 INFO L93 Difference]: Finished difference Result 203 states and 231 transitions. [2018-11-18 23:25:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 231 transitions. [2018-11-18 23:25:05,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:05,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:05,326 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 203 states. [2018-11-18 23:25:05,326 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 203 states. [2018-11-18 23:25:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:05,332 INFO L93 Difference]: Finished difference Result 203 states and 231 transitions. [2018-11-18 23:25:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 231 transitions. [2018-11-18 23:25:05,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:05,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:05,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:05,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 23:25:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-11-18 23:25:05,337 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 71 [2018-11-18 23:25:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:05,337 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-11-18 23:25:05,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:25:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-11-18 23:25:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 23:25:05,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:05,338 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:05,339 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:05,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:05,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1559544137, now seen corresponding path program 7 times [2018-11-18 23:25:05,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:05,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:05,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:05,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:05,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:05,346 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:05,346 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:05,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:05,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:05,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {5966#true} call ULTIMATE.init(); {5966#true} is VALID [2018-11-18 23:25:05,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {5966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5966#true} is VALID [2018-11-18 23:25:05,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {5966#true} assume true; {5966#true} is VALID [2018-11-18 23:25:05,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5966#true} {5966#true} #105#return; {5966#true} is VALID [2018-11-18 23:25:05,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {5966#true} call #t~ret7 := main(); {5966#true} is VALID [2018-11-18 23:25:05,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {5966#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {5986#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:05,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {5986#(<= 1500 main_~n~0)} assume true; {5986#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:05,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {5986#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5993#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:05,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {5993#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {5993#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:05,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {5993#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {6000#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:05,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {6000#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {6000#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:05,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {6000#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {6007#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:05,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {6007#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {6007#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:05,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {6007#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {6014#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:05,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {6014#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {6014#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:05,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {6014#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {6021#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:05,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {6021#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {6021#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:05,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {6021#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {6028#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:05,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {6028#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {6028#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:05,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {6028#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {6035#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:25:05,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {6035#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume true; {6035#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:25:05,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {6035#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !(~j~0 < ~n~0); {5967#false} is VALID [2018-11-18 23:25:05,834 INFO L273 TraceCheckUtils]: 22: Hoare triple {5967#false} ~i~0 := 1 + ~i~0; {5967#false} is VALID [2018-11-18 23:25:05,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {5967#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5967#false} is VALID [2018-11-18 23:25:05,834 INFO L273 TraceCheckUtils]: 25: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,836 INFO L273 TraceCheckUtils]: 33: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,837 INFO L273 TraceCheckUtils]: 37: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,837 INFO L273 TraceCheckUtils]: 38: Hoare triple {5967#false} assume !(~j~0 < ~n~0); {5967#false} is VALID [2018-11-18 23:25:05,837 INFO L273 TraceCheckUtils]: 39: Hoare triple {5967#false} ~i~0 := 1 + ~i~0; {5967#false} is VALID [2018-11-18 23:25:05,837 INFO L273 TraceCheckUtils]: 40: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,837 INFO L273 TraceCheckUtils]: 41: Hoare triple {5967#false} assume !(~i~0 < ~m~0); {5967#false} is VALID [2018-11-18 23:25:05,837 INFO L273 TraceCheckUtils]: 42: Hoare triple {5967#false} ~i~0 := 0;~j~0 := 0; {5967#false} is VALID [2018-11-18 23:25:05,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,838 INFO L273 TraceCheckUtils]: 44: Hoare triple {5967#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5967#false} is VALID [2018-11-18 23:25:05,838 INFO L273 TraceCheckUtils]: 45: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,838 INFO L273 TraceCheckUtils]: 46: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,838 INFO L273 TraceCheckUtils]: 47: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,838 INFO L273 TraceCheckUtils]: 48: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,839 INFO L273 TraceCheckUtils]: 49: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,839 INFO L273 TraceCheckUtils]: 50: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,839 INFO L273 TraceCheckUtils]: 51: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,839 INFO L273 TraceCheckUtils]: 52: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,839 INFO L273 TraceCheckUtils]: 53: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,840 INFO L273 TraceCheckUtils]: 54: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,840 INFO L273 TraceCheckUtils]: 55: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,840 INFO L273 TraceCheckUtils]: 56: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,840 INFO L273 TraceCheckUtils]: 57: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,840 INFO L273 TraceCheckUtils]: 58: Hoare triple {5967#false} assume !(~j~0 < ~n~0); {5967#false} is VALID [2018-11-18 23:25:05,841 INFO L273 TraceCheckUtils]: 59: Hoare triple {5967#false} ~i~0 := 1 + ~i~0; {5967#false} is VALID [2018-11-18 23:25:05,841 INFO L273 TraceCheckUtils]: 60: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,841 INFO L273 TraceCheckUtils]: 61: Hoare triple {5967#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5967#false} is VALID [2018-11-18 23:25:05,841 INFO L273 TraceCheckUtils]: 62: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,842 INFO L273 TraceCheckUtils]: 64: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,842 INFO L273 TraceCheckUtils]: 65: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,842 INFO L273 TraceCheckUtils]: 66: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,842 INFO L273 TraceCheckUtils]: 67: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,842 INFO L273 TraceCheckUtils]: 68: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,843 INFO L273 TraceCheckUtils]: 70: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,843 INFO L273 TraceCheckUtils]: 71: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,843 INFO L273 TraceCheckUtils]: 72: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {5967#false} is VALID [2018-11-18 23:25:05,844 INFO L273 TraceCheckUtils]: 74: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,844 INFO L273 TraceCheckUtils]: 75: Hoare triple {5967#false} assume !(~j~0 < ~n~0); {5967#false} is VALID [2018-11-18 23:25:05,844 INFO L273 TraceCheckUtils]: 76: Hoare triple {5967#false} ~i~0 := 1 + ~i~0; {5967#false} is VALID [2018-11-18 23:25:05,844 INFO L273 TraceCheckUtils]: 77: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,844 INFO L273 TraceCheckUtils]: 78: Hoare triple {5967#false} assume !(~i~0 < ~m~0); {5967#false} is VALID [2018-11-18 23:25:05,844 INFO L273 TraceCheckUtils]: 79: Hoare triple {5967#false} ~i~0 := 0;~j~0 := 0; {5967#false} is VALID [2018-11-18 23:25:05,845 INFO L273 TraceCheckUtils]: 80: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,845 INFO L273 TraceCheckUtils]: 81: Hoare triple {5967#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5967#false} is VALID [2018-11-18 23:25:05,845 INFO L273 TraceCheckUtils]: 82: Hoare triple {5967#false} assume true; {5967#false} is VALID [2018-11-18 23:25:05,845 INFO L273 TraceCheckUtils]: 83: Hoare triple {5967#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5967#false} is VALID [2018-11-18 23:25:05,845 INFO L256 TraceCheckUtils]: 84: Hoare triple {5967#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {5967#false} is VALID [2018-11-18 23:25:05,846 INFO L273 TraceCheckUtils]: 85: Hoare triple {5967#false} ~cond := #in~cond; {5967#false} is VALID [2018-11-18 23:25:05,846 INFO L273 TraceCheckUtils]: 86: Hoare triple {5967#false} assume 0 == ~cond; {5967#false} is VALID [2018-11-18 23:25:05,846 INFO L273 TraceCheckUtils]: 87: Hoare triple {5967#false} assume !false; {5967#false} is VALID [2018-11-18 23:25:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 102 proven. 42 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-18 23:25:05,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:05,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-18 23:25:05,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-11-18 23:25:05,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:05,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 23:25:05,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:05,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 23:25:05,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 23:25:05,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:25:05,946 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 10 states. [2018-11-18 23:25:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:06,878 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2018-11-18 23:25:06,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 23:25:06,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-11-18 23:25:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:25:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2018-11-18 23:25:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:25:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2018-11-18 23:25:06,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 138 transitions. [2018-11-18 23:25:07,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:07,327 INFO L225 Difference]: With dead ends: 224 [2018-11-18 23:25:07,327 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 23:25:07,327 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:25:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 23:25:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-11-18 23:25:07,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:07,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 127 states. [2018-11-18 23:25:07,500 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 127 states. [2018-11-18 23:25:07,500 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 127 states. [2018-11-18 23:25:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:07,504 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-11-18 23:25:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-11-18 23:25:07,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:07,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:07,505 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 131 states. [2018-11-18 23:25:07,505 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 131 states. [2018-11-18 23:25:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:07,509 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-11-18 23:25:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-11-18 23:25:07,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:07,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:07,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:07,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 23:25:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-11-18 23:25:07,513 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 88 [2018-11-18 23:25:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:07,513 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-11-18 23:25:07,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 23:25:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-11-18 23:25:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 23:25:07,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:07,515 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 14, 14, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:07,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:07,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash 811323959, now seen corresponding path program 8 times [2018-11-18 23:25:07,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:07,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:07,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:07,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:07,522 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:07,523 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:07,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:07,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:25:07,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:25:07,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:07,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:08,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {7013#true} call ULTIMATE.init(); {7013#true} is VALID [2018-11-18 23:25:08,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {7013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7013#true} is VALID [2018-11-18 23:25:08,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {7013#true} assume true; {7013#true} is VALID [2018-11-18 23:25:08,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7013#true} {7013#true} #105#return; {7013#true} is VALID [2018-11-18 23:25:08,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {7013#true} call #t~ret7 := main(); {7013#true} is VALID [2018-11-18 23:25:08,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {7013#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {7033#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:08,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {7033#(<= 1500 main_~n~0)} assume true; {7033#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:08,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {7033#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {7040#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:08,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {7040#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {7040#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:08,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {7040#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7047#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:08,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {7047#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {7047#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:08,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {7047#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7054#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:08,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {7054#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {7054#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:08,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {7054#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7061#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:08,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {7061#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {7061#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:08,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {7061#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7068#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:08,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {7068#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {7068#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:08,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {7068#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7075#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:08,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {7075#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {7075#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:08,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {7075#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7082#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:25:08,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {7082#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume true; {7082#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:25:08,148 INFO L273 TraceCheckUtils]: 21: Hoare triple {7082#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7089#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:25:08,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {7089#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume true; {7089#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:25:08,149 INFO L273 TraceCheckUtils]: 23: Hoare triple {7089#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !(~j~0 < ~n~0); {7014#false} is VALID [2018-11-18 23:25:08,149 INFO L273 TraceCheckUtils]: 24: Hoare triple {7014#false} ~i~0 := 1 + ~i~0; {7014#false} is VALID [2018-11-18 23:25:08,149 INFO L273 TraceCheckUtils]: 25: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {7014#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {7014#false} is VALID [2018-11-18 23:25:08,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,150 INFO L273 TraceCheckUtils]: 28: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,150 INFO L273 TraceCheckUtils]: 29: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,151 INFO L273 TraceCheckUtils]: 31: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,151 INFO L273 TraceCheckUtils]: 32: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,152 INFO L273 TraceCheckUtils]: 34: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,152 INFO L273 TraceCheckUtils]: 35: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,152 INFO L273 TraceCheckUtils]: 36: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,152 INFO L273 TraceCheckUtils]: 37: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,153 INFO L273 TraceCheckUtils]: 38: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,153 INFO L273 TraceCheckUtils]: 39: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,153 INFO L273 TraceCheckUtils]: 40: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,153 INFO L273 TraceCheckUtils]: 41: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,153 INFO L273 TraceCheckUtils]: 42: Hoare triple {7014#false} assume !(~j~0 < ~n~0); {7014#false} is VALID [2018-11-18 23:25:08,154 INFO L273 TraceCheckUtils]: 43: Hoare triple {7014#false} ~i~0 := 1 + ~i~0; {7014#false} is VALID [2018-11-18 23:25:08,154 INFO L273 TraceCheckUtils]: 44: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {7014#false} assume !(~i~0 < ~m~0); {7014#false} is VALID [2018-11-18 23:25:08,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {7014#false} ~i~0 := 0;~j~0 := 0; {7014#false} is VALID [2018-11-18 23:25:08,154 INFO L273 TraceCheckUtils]: 47: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {7014#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {7014#false} is VALID [2018-11-18 23:25:08,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,155 INFO L273 TraceCheckUtils]: 53: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,155 INFO L273 TraceCheckUtils]: 54: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,156 INFO L273 TraceCheckUtils]: 55: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,156 INFO L273 TraceCheckUtils]: 56: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,156 INFO L273 TraceCheckUtils]: 57: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,156 INFO L273 TraceCheckUtils]: 58: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,156 INFO L273 TraceCheckUtils]: 59: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,157 INFO L273 TraceCheckUtils]: 60: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,157 INFO L273 TraceCheckUtils]: 61: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,157 INFO L273 TraceCheckUtils]: 62: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,157 INFO L273 TraceCheckUtils]: 63: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,157 INFO L273 TraceCheckUtils]: 64: Hoare triple {7014#false} assume !(~j~0 < ~n~0); {7014#false} is VALID [2018-11-18 23:25:08,157 INFO L273 TraceCheckUtils]: 65: Hoare triple {7014#false} ~i~0 := 1 + ~i~0; {7014#false} is VALID [2018-11-18 23:25:08,158 INFO L273 TraceCheckUtils]: 66: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,158 INFO L273 TraceCheckUtils]: 67: Hoare triple {7014#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {7014#false} is VALID [2018-11-18 23:25:08,158 INFO L273 TraceCheckUtils]: 68: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,158 INFO L273 TraceCheckUtils]: 69: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,158 INFO L273 TraceCheckUtils]: 70: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,159 INFO L273 TraceCheckUtils]: 71: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,159 INFO L273 TraceCheckUtils]: 73: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,159 INFO L273 TraceCheckUtils]: 74: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,159 INFO L273 TraceCheckUtils]: 75: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,159 INFO L273 TraceCheckUtils]: 76: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,160 INFO L273 TraceCheckUtils]: 77: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,160 INFO L273 TraceCheckUtils]: 78: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,160 INFO L273 TraceCheckUtils]: 79: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,160 INFO L273 TraceCheckUtils]: 80: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,160 INFO L273 TraceCheckUtils]: 81: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {7014#false} is VALID [2018-11-18 23:25:08,160 INFO L273 TraceCheckUtils]: 82: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,160 INFO L273 TraceCheckUtils]: 83: Hoare triple {7014#false} assume !(~j~0 < ~n~0); {7014#false} is VALID [2018-11-18 23:25:08,160 INFO L273 TraceCheckUtils]: 84: Hoare triple {7014#false} ~i~0 := 1 + ~i~0; {7014#false} is VALID [2018-11-18 23:25:08,161 INFO L273 TraceCheckUtils]: 85: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,161 INFO L273 TraceCheckUtils]: 86: Hoare triple {7014#false} assume !(~i~0 < ~m~0); {7014#false} is VALID [2018-11-18 23:25:08,161 INFO L273 TraceCheckUtils]: 87: Hoare triple {7014#false} ~i~0 := 0;~j~0 := 0; {7014#false} is VALID [2018-11-18 23:25:08,161 INFO L273 TraceCheckUtils]: 88: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,161 INFO L273 TraceCheckUtils]: 89: Hoare triple {7014#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {7014#false} is VALID [2018-11-18 23:25:08,161 INFO L273 TraceCheckUtils]: 90: Hoare triple {7014#false} assume true; {7014#false} is VALID [2018-11-18 23:25:08,161 INFO L273 TraceCheckUtils]: 91: Hoare triple {7014#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7014#false} is VALID [2018-11-18 23:25:08,161 INFO L256 TraceCheckUtils]: 92: Hoare triple {7014#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {7014#false} is VALID [2018-11-18 23:25:08,162 INFO L273 TraceCheckUtils]: 93: Hoare triple {7014#false} ~cond := #in~cond; {7014#false} is VALID [2018-11-18 23:25:08,162 INFO L273 TraceCheckUtils]: 94: Hoare triple {7014#false} assume 0 == ~cond; {7014#false} is VALID [2018-11-18 23:25:08,162 INFO L273 TraceCheckUtils]: 95: Hoare triple {7014#false} assume !false; {7014#false} is VALID [2018-11-18 23:25:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 132 proven. 56 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-11-18 23:25:08,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:08,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-18 23:25:08,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-18 23:25:08,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:08,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:25:08,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:08,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:25:08,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:25:08,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:25:08,231 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 11 states. [2018-11-18 23:25:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:09,731 INFO L93 Difference]: Finished difference Result 246 states and 278 transitions. [2018-11-18 23:25:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:25:09,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-18 23:25:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:25:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2018-11-18 23:25:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:25:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2018-11-18 23:25:09,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2018-11-18 23:25:09,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:09,886 INFO L225 Difference]: With dead ends: 246 [2018-11-18 23:25:09,886 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 23:25:09,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:25:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 23:25:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-11-18 23:25:10,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:10,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 139 states. [2018-11-18 23:25:10,263 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 139 states. [2018-11-18 23:25:10,263 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 139 states. [2018-11-18 23:25:10,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:10,267 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-11-18 23:25:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2018-11-18 23:25:10,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:10,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:10,268 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 143 states. [2018-11-18 23:25:10,268 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 143 states. [2018-11-18 23:25:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:10,271 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-11-18 23:25:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2018-11-18 23:25:10,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:10,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:10,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:10,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 23:25:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2018-11-18 23:25:10,276 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 96 [2018-11-18 23:25:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:10,276 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2018-11-18 23:25:10,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:25:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2018-11-18 23:25:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 23:25:10,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:10,277 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:10,278 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:10,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash -616299081, now seen corresponding path program 9 times [2018-11-18 23:25:10,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:10,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:10,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:10,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:10,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:10,285 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:10,285 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:10,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:10,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:25:10,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 23:25:10,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:10,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:10,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {8160#true} call ULTIMATE.init(); {8160#true} is VALID [2018-11-18 23:25:10,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {8160#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8160#true} is VALID [2018-11-18 23:25:10,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {8160#true} assume true; {8160#true} is VALID [2018-11-18 23:25:10,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8160#true} {8160#true} #105#return; {8160#true} is VALID [2018-11-18 23:25:10,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {8160#true} call #t~ret7 := main(); {8160#true} is VALID [2018-11-18 23:25:10,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {8160#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,595 INFO L273 TraceCheckUtils]: 24: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,596 INFO L273 TraceCheckUtils]: 25: Hoare triple {8180#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,596 INFO L273 TraceCheckUtils]: 26: Hoare triple {8180#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,597 INFO L273 TraceCheckUtils]: 27: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,597 INFO L273 TraceCheckUtils]: 28: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,598 INFO L273 TraceCheckUtils]: 29: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,599 INFO L273 TraceCheckUtils]: 31: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,600 INFO L273 TraceCheckUtils]: 33: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,601 INFO L273 TraceCheckUtils]: 34: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,601 INFO L273 TraceCheckUtils]: 35: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,602 INFO L273 TraceCheckUtils]: 36: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,602 INFO L273 TraceCheckUtils]: 37: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,603 INFO L273 TraceCheckUtils]: 38: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,603 INFO L273 TraceCheckUtils]: 39: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,626 INFO L273 TraceCheckUtils]: 42: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {8180#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,627 INFO L273 TraceCheckUtils]: 45: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {8180#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,627 INFO L273 TraceCheckUtils]: 47: Hoare triple {8180#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {8180#(<= 1000 main_~m~0)} assume true; {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,628 INFO L273 TraceCheckUtils]: 49: Hoare triple {8180#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {8180#(<= 1000 main_~m~0)} is VALID [2018-11-18 23:25:10,628 INFO L273 TraceCheckUtils]: 50: Hoare triple {8180#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,629 INFO L273 TraceCheckUtils]: 51: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,642 INFO L273 TraceCheckUtils]: 52: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,642 INFO L273 TraceCheckUtils]: 53: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,645 INFO L273 TraceCheckUtils]: 58: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,645 INFO L273 TraceCheckUtils]: 59: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,646 INFO L273 TraceCheckUtils]: 60: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,646 INFO L273 TraceCheckUtils]: 61: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,647 INFO L273 TraceCheckUtils]: 62: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,649 INFO L273 TraceCheckUtils]: 64: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,650 INFO L273 TraceCheckUtils]: 65: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,651 INFO L273 TraceCheckUtils]: 66: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,651 INFO L273 TraceCheckUtils]: 67: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,652 INFO L273 TraceCheckUtils]: 68: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,653 INFO L273 TraceCheckUtils]: 69: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,654 INFO L273 TraceCheckUtils]: 70: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,654 INFO L273 TraceCheckUtils]: 71: Hoare triple {8316#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,656 INFO L273 TraceCheckUtils]: 73: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,656 INFO L273 TraceCheckUtils]: 74: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,657 INFO L273 TraceCheckUtils]: 75: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,658 INFO L273 TraceCheckUtils]: 76: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,659 INFO L273 TraceCheckUtils]: 77: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,660 INFO L273 TraceCheckUtils]: 78: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,661 INFO L273 TraceCheckUtils]: 79: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,661 INFO L273 TraceCheckUtils]: 80: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,662 INFO L273 TraceCheckUtils]: 81: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,663 INFO L273 TraceCheckUtils]: 82: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,664 INFO L273 TraceCheckUtils]: 83: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,664 INFO L273 TraceCheckUtils]: 84: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,665 INFO L273 TraceCheckUtils]: 85: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,666 INFO L273 TraceCheckUtils]: 86: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,667 INFO L273 TraceCheckUtils]: 87: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,668 INFO L273 TraceCheckUtils]: 88: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,669 INFO L273 TraceCheckUtils]: 89: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,669 INFO L273 TraceCheckUtils]: 90: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,670 INFO L273 TraceCheckUtils]: 91: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,671 INFO L273 TraceCheckUtils]: 92: Hoare triple {8380#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {8444#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,671 INFO L273 TraceCheckUtils]: 93: Hoare triple {8444#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume true; {8444#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:10,672 INFO L273 TraceCheckUtils]: 94: Hoare triple {8444#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {8161#false} is VALID [2018-11-18 23:25:10,672 INFO L273 TraceCheckUtils]: 95: Hoare triple {8161#false} ~i~0 := 0;~j~0 := 0; {8161#false} is VALID [2018-11-18 23:25:10,673 INFO L273 TraceCheckUtils]: 96: Hoare triple {8161#false} assume true; {8161#false} is VALID [2018-11-18 23:25:10,673 INFO L273 TraceCheckUtils]: 97: Hoare triple {8161#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {8161#false} is VALID [2018-11-18 23:25:10,673 INFO L273 TraceCheckUtils]: 98: Hoare triple {8161#false} assume true; {8161#false} is VALID [2018-11-18 23:25:10,673 INFO L273 TraceCheckUtils]: 99: Hoare triple {8161#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8161#false} is VALID [2018-11-18 23:25:10,674 INFO L256 TraceCheckUtils]: 100: Hoare triple {8161#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {8161#false} is VALID [2018-11-18 23:25:10,675 INFO L273 TraceCheckUtils]: 101: Hoare triple {8161#false} ~cond := #in~cond; {8161#false} is VALID [2018-11-18 23:25:10,675 INFO L273 TraceCheckUtils]: 102: Hoare triple {8161#false} assume 0 == ~cond; {8161#false} is VALID [2018-11-18 23:25:10,675 INFO L273 TraceCheckUtils]: 103: Hoare triple {8161#false} assume !false; {8161#false} is VALID [2018-11-18 23:25:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2018-11-18 23:25:10,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:10,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 23:25:10,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-18 23:25:10,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:10,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:25:10,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:10,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:25:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:25:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:25:10,758 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 6 states. [2018-11-18 23:25:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:12,671 INFO L93 Difference]: Finished difference Result 419 states and 477 transitions. [2018-11-18 23:25:12,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:25:12,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-18 23:25:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:25:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2018-11-18 23:25:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:25:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2018-11-18 23:25:12,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2018-11-18 23:25:12,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:12,919 INFO L225 Difference]: With dead ends: 419 [2018-11-18 23:25:12,919 INFO L226 Difference]: Without dead ends: 330 [2018-11-18 23:25:12,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:25:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-18 23:25:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 181. [2018-11-18 23:25:13,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:13,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand 181 states. [2018-11-18 23:25:13,178 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 181 states. [2018-11-18 23:25:13,178 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 181 states. [2018-11-18 23:25:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:13,190 INFO L93 Difference]: Finished difference Result 330 states and 375 transitions. [2018-11-18 23:25:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 375 transitions. [2018-11-18 23:25:13,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:13,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:13,192 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 330 states. [2018-11-18 23:25:13,192 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 330 states. [2018-11-18 23:25:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:13,202 INFO L93 Difference]: Finished difference Result 330 states and 375 transitions. [2018-11-18 23:25:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 375 transitions. [2018-11-18 23:25:13,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:13,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:13,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:13,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 23:25:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2018-11-18 23:25:13,208 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 104 [2018-11-18 23:25:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:13,208 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2018-11-18 23:25:13,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:25:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2018-11-18 23:25:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-18 23:25:13,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:13,210 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:13,211 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:13,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1426054609, now seen corresponding path program 10 times [2018-11-18 23:25:13,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:13,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:13,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:13,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:13,219 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:13,219 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:13,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-18 23:25:13,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST