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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/diff-3-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:02,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:02,927 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:02,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:02,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:02,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:02,942 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:02,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:02,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:02,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:02,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:02,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:02,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:02,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:02,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:02,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:02,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:02,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:02,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:02,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:02,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:02,960 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:02,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:02,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:02,965 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:02,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:02,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:02,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:02,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:02,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:02,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:02,974 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:02,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:02,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:02,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:02,979 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:02,979 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-23 12:34:03,010 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:03,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:03,011 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:03,011 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:03,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:03,013 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:03,013 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:03,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:03,014 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:03,014 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:03,014 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:03,014 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:03,014 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:03,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:03,015 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:03,015 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:03,015 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:03,015 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:03,016 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:03,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:03,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:03,016 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:03,016 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:03,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:03,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:03,018 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:03,018 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:03,019 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:03,019 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:03,019 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:03,019 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:03,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:03,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:03,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:03,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:03,091 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:03,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/diff-3-n-u_true-unreach-call.i [2018-11-23 12:34:03,149 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a04ccec/1654fbae41c9485b9e19d744daba43d6/FLAG80e16febd [2018-11-23 12:34:03,573 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:03,574 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/diff-3-n-u_true-unreach-call.i [2018-11-23 12:34:03,581 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a04ccec/1654fbae41c9485b9e19d744daba43d6/FLAG80e16febd [2018-11-23 12:34:03,947 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a04ccec/1654fbae41c9485b9e19d744daba43d6 [2018-11-23 12:34:03,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:03,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:03,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:03,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:03,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:03,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:03" (1/1) ... [2018-11-23 12:34:03,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4df8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:03, skipping insertion in model container [2018-11-23 12:34:03,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:03" (1/1) ... [2018-11-23 12:34:03,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:04,008 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:04,257 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:04,261 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:04,315 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:04,333 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:04,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04 WrapperNode [2018-11-23 12:34:04,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:04,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:04,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:04,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:04,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:04,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:04,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:04,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:04,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (1/1) ... [2018-11-23 12:34:04,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:04,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:04,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:04,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:04,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (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-23 12:34:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:04,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:04,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:04,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:04,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:04,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:04,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:05,425 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:05,426 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 12:34:05,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:05 BoogieIcfgContainer [2018-11-23 12:34:05,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:05,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:05,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:05,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:05,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:34:03" (1/3) ... [2018-11-23 12:34:05,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d41033d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:05, skipping insertion in model container [2018-11-23 12:34:05,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:04" (2/3) ... [2018-11-23 12:34:05,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d41033d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:05, skipping insertion in model container [2018-11-23 12:34:05,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:05" (3/3) ... [2018-11-23 12:34:05,437 INFO L112 eAbstractionObserver]: Analyzing ICFG diff-3-n-u_true-unreach-call.i [2018-11-23 12:34:05,448 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:05,456 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:05,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:05,507 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:05,507 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:05,508 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:05,508 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:05,508 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:05,508 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:05,508 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:05,508 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:05,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 12:34:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:34:05,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:05,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:05,534 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:05,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:05,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1773460249, now seen corresponding path program 1 times [2018-11-23 12:34:05,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:05,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:05,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:05,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:05,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:05,623 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:05,624 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:05,624 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-23 12:34:05,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:05,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:05,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 12:34:05,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 12:34:05,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 12:34:05,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #138#return; {39#true} is VALID [2018-11-23 12:34:05,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret7 := main(); {39#true} is VALID [2018-11-23 12:34:05,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {39#true} is VALID [2018-11-23 12:34:05,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 12:34:05,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:34:05,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 12:34:05,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:34:05,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {40#false} is VALID [2018-11-23 12:34:05,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {40#false} is VALID [2018-11-23 12:34:05,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {40#false} is VALID [2018-11-23 12:34:05,781 INFO L256 TraceCheckUtils]: 13: 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-23 12:34:05,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 12:34:05,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-23 12:34:05,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 12:34:05,785 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-23 12:34:05,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:05,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:34:05,821 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:34:05,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:05,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:34:05,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:05,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:34:05,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:34:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:05,921 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 12:34:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:06,359 INFO L93 Difference]: Finished difference Result 66 states and 103 transitions. [2018-11-23 12:34:06,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:34:06,359 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:34:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:34:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2018-11-23 12:34:06,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 103 transitions. [2018-11-23 12:34:06,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:07,007 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:34:07,008 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:34:07,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-23 12:34:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:34:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:34:07,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:07,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:34:07,108 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:34:07,109 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:34:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:07,113 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:34:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:34:07,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:07,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:07,114 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:34:07,115 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:34:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:07,119 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2018-11-23 12:34:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:34:07,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:07,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:07,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:07,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:34:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 12:34:07,125 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2018-11-23 12:34:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:07,125 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 12:34:07,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:34:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 12:34:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:34:07,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:07,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:07,127 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:07,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1763514787, now seen corresponding path program 1 times [2018-11-23 12:34:07,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:07,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:07,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:07,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:07,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:07,137 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:07,137 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:07,138 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-23 12:34:07,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:07,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:07,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 12:34:07,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {291#true} is VALID [2018-11-23 12:34:07,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 12:34:07,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #138#return; {291#true} is VALID [2018-11-23 12:34:07,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret7 := main(); {291#true} is VALID [2018-11-23 12:34:07,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {311#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:07,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {292#false} is VALID [2018-11-23 12:34:07,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {292#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:34:07,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#false} assume !(~i~0 < ~m~0); {292#false} is VALID [2018-11-23 12:34:07,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:34:07,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {292#false} is VALID [2018-11-23 12:34:07,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {292#false} is VALID [2018-11-23 12:34:07,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {292#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {292#false} is VALID [2018-11-23 12:34:07,333 INFO L256 TraceCheckUtils]: 13: Hoare triple {292#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {292#false} is VALID [2018-11-23 12:34:07,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2018-11-23 12:34:07,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2018-11-23 12:34:07,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 12:34:07,336 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-23 12:34:07,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:07,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:34:07,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:34:07,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:07,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:34:07,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:07,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:34:07,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:34:07,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:07,472 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-11-23 12:34:07,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:07,854 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2018-11-23 12:34:07,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:34:07,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:34:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:34:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 12:34:07,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 12:34:08,003 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-23 12:34:08,005 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:34:08,005 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:34:08,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:34:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2018-11-23 12:34:08,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:08,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 32 states. [2018-11-23 12:34:08,024 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 32 states. [2018-11-23 12:34:08,024 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 32 states. [2018-11-23 12:34:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,027 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:34:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:34:08,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:08,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:08,028 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 36 states. [2018-11-23 12:34:08,028 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 36 states. [2018-11-23 12:34:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,031 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:34:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:34:08,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:08,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:08,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:08,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:34:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2018-11-23 12:34:08,035 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2018-11-23 12:34:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:08,036 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-23 12:34:08,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:34:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2018-11-23 12:34:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:34:08,037 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:08,037 INFO L402 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-23 12:34:08,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:08,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2133227694, now seen corresponding path program 1 times [2018-11-23 12:34:08,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:08,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:08,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:08,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:08,046 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:08,047 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:08,047 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-23 12:34:08,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:08,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:08,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2018-11-23 12:34:08,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {546#true} is VALID [2018-11-23 12:34:08,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-23 12:34:08,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {546#true} {546#true} #138#return; {546#true} is VALID [2018-11-23 12:34:08,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {546#true} call #t~ret7 := main(); {546#true} is VALID [2018-11-23 12:34:08,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {546#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {566#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:08,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {566#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {570#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:08,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {570#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {547#false} is VALID [2018-11-23 12:34:08,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {547#false} ~i~0 := 1 + ~i~0; {547#false} is VALID [2018-11-23 12:34:08,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {547#false} assume !(~i~0 < ~m~0); {547#false} is VALID [2018-11-23 12:34:08,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {547#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:34:08,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#false} assume !(~i~0 < ~m~0); {547#false} is VALID [2018-11-23 12:34:08,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {547#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:34:08,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {547#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {547#false} is VALID [2018-11-23 12:34:08,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {547#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {547#false} is VALID [2018-11-23 12:34:08,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {547#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {547#false} is VALID [2018-11-23 12:34:08,222 INFO L256 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {547#false} is VALID [2018-11-23 12:34:08,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2018-11-23 12:34:08,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2018-11-23 12:34:08,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2018-11-23 12:34:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:08,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:08,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:08,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:34:08,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:08,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:08,290 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-23 12:34:08,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:08,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:08,291 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2018-11-23 12:34:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,607 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2018-11-23 12:34:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:08,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:34:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 12:34:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-23 12:34:08,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2018-11-23 12:34:08,782 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-23 12:34:08,784 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:34:08,785 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:34:08,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-23 12:34:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:34:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-23 12:34:08,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:08,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 35 states. [2018-11-23 12:34:08,837 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 35 states. [2018-11-23 12:34:08,837 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 35 states. [2018-11-23 12:34:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,841 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:34:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:34:08,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:08,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:08,843 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 46 states. [2018-11-23 12:34:08,843 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 46 states. [2018-11-23 12:34:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:08,847 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:34:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2018-11-23 12:34:08,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:08,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:08,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:08,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:34:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-23 12:34:08,850 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 20 [2018-11-23 12:34:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:08,851 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 12:34:08,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 12:34:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:34:08,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:08,852 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:34:08,853 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:08,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1108398309, now seen corresponding path program 1 times [2018-11-23 12:34:08,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:08,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:08,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:08,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:08,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:08,861 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:08,861 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:08,862 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-23 12:34:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:08,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:08,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {862#true} is VALID [2018-11-23 12:34:08,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {862#true} is VALID [2018-11-23 12:34:08,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2018-11-23 12:34:08,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #138#return; {862#true} is VALID [2018-11-23 12:34:08,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret7 := main(); {862#true} is VALID [2018-11-23 12:34:08,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {882#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:08,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {882#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {882#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:08,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {882#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {889#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:08,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {863#false} is VALID [2018-11-23 12:34:08,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#false} ~j~0 := 1 + ~j~0; {863#false} is VALID [2018-11-23 12:34:08,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#false} assume !(~j~0 < ~n~0); {863#false} is VALID [2018-11-23 12:34:08,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#false} ~i~0 := 1 + ~i~0; {863#false} is VALID [2018-11-23 12:34:08,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#false} assume !(~i~0 < ~m~0); {863#false} is VALID [2018-11-23 12:34:08,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {863#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:34:08,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {863#false} assume !(~i~0 < ~m~0); {863#false} is VALID [2018-11-23 12:34:08,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {863#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:34:08,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {863#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {863#false} is VALID [2018-11-23 12:34:08,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {863#false} is VALID [2018-11-23 12:34:08,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {863#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {863#false} is VALID [2018-11-23 12:34:09,000 INFO L256 TraceCheckUtils]: 19: Hoare triple {863#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {863#false} is VALID [2018-11-23 12:34:09,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {863#false} ~cond := #in~cond; {863#false} is VALID [2018-11-23 12:34:09,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {863#false} assume 0 == ~cond; {863#false} is VALID [2018-11-23 12:34:09,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {863#false} assume !false; {863#false} is VALID [2018-11-23 12:34:09,002 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-23 12:34:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:09,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:09,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:34:09,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:09,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:09,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:09,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:09,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:09,058 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 4 states. [2018-11-23 12:34:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,409 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 12:34:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:09,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:34:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-23 12:34:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2018-11-23 12:34:09,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2018-11-23 12:34:09,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:09,525 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:34:09,526 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:34:09,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-23 12:34:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:34:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-11-23 12:34:09,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:09,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 38 states. [2018-11-23 12:34:09,590 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 38 states. [2018-11-23 12:34:09,590 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 38 states. [2018-11-23 12:34:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,593 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:34:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:34:09,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:09,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:09,595 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 43 states. [2018-11-23 12:34:09,595 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 43 states. [2018-11-23 12:34:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:09,598 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:34:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:34:09,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:09,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:09,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:09,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:34:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:34:09,602 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 23 [2018-11-23 12:34:09,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:09,602 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:34:09,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:34:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:34:09,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:09,603 INFO L402 BasicCegarLoop]: trace histogram [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-23 12:34:09,604 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:09,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:09,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1602833213, now seen corresponding path program 1 times [2018-11-23 12:34:09,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:09,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:09,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:09,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:09,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:09,612 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:09,612 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:09,613 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-23 12:34:09,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:09,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:09,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-23 12:34:09,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {1190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1190#true} is VALID [2018-11-23 12:34:09,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-23 12:34:09,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #138#return; {1190#true} is VALID [2018-11-23 12:34:09,840 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret7 := main(); {1190#true} is VALID [2018-11-23 12:34:09,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1210#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:09,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {1210#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1210#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:09,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {1210#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1217#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:09,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {1217#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1221#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:09,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {1221#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !(~k~0 < ~p~0); {1191#false} is VALID [2018-11-23 12:34:09,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {1191#false} ~j~0 := 1 + ~j~0; {1191#false} is VALID [2018-11-23 12:34:09,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {1191#false} assume !(~j~0 < ~n~0); {1191#false} is VALID [2018-11-23 12:34:09,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {1191#false} ~i~0 := 1 + ~i~0; {1191#false} is VALID [2018-11-23 12:34:09,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !(~i~0 < ~m~0); {1191#false} is VALID [2018-11-23 12:34:09,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:34:09,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} assume !(~i~0 < ~m~0); {1191#false} is VALID [2018-11-23 12:34:09,848 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:34:09,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1191#false} is VALID [2018-11-23 12:34:09,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1191#false} is VALID [2018-11-23 12:34:09,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1191#false} is VALID [2018-11-23 12:34:09,849 INFO L256 TraceCheckUtils]: 20: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1191#false} is VALID [2018-11-23 12:34:09,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-23 12:34:09,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume 0 == ~cond; {1191#false} is VALID [2018-11-23 12:34:09,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-23 12:34:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:09,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:09,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:09,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:34:09,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:09,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:09,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:09,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:09,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:09,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:09,908 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2018-11-23 12:34:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,244 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2018-11-23 12:34:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:10,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:34:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:34:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-23 12:34:10,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-23 12:34:10,416 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-23 12:34:10,418 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:34:10,418 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:34:10,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-23 12:34:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:34:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-11-23 12:34:10,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:10,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 43 states. [2018-11-23 12:34:10,517 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 43 states. [2018-11-23 12:34:10,517 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 43 states. [2018-11-23 12:34:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,520 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 12:34:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:34:10,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:10,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:10,521 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 48 states. [2018-11-23 12:34:10,521 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 48 states. [2018-11-23 12:34:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:10,524 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 12:34:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:34:10,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:10,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:10,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:10,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:34:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-23 12:34:10,528 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 24 [2018-11-23 12:34:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:10,528 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-23 12:34:10,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:34:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:34:10,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:10,530 INFO L402 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-23 12:34:10,530 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:10,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:10,530 INFO L82 PathProgramCache]: Analyzing trace with hash 249553947, now seen corresponding path program 2 times [2018-11-23 12:34:10,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:10,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:10,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:10,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:10,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:10,538 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:10,538 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:10,538 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-23 12:34:10,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:10,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:34:10,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:10,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:10,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {1556#true} call ULTIMATE.init(); {1556#true} is VALID [2018-11-23 12:34:10,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {1556#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1556#true} is VALID [2018-11-23 12:34:10,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {1556#true} assume true; {1556#true} is VALID [2018-11-23 12:34:10,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1556#true} {1556#true} #138#return; {1556#true} is VALID [2018-11-23 12:34:10,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {1556#true} call #t~ret7 := main(); {1556#true} is VALID [2018-11-23 12:34:10,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {1556#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {1576#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {1576#(<= 1000 main_~m~0)} ~j~0 := 1 + ~j~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,715 INFO L273 TraceCheckUtils]: 13: Hoare triple {1576#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {1576#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:10,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1607#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:10,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {1607#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1557#false} is VALID [2018-11-23 12:34:10,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {1557#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1557#false} is VALID [2018-11-23 12:34:10,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {1557#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1557#false} is VALID [2018-11-23 12:34:10,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1557#false} is VALID [2018-11-23 12:34:10,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {1557#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1557#false} is VALID [2018-11-23 12:34:10,749 INFO L256 TraceCheckUtils]: 21: Hoare triple {1557#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1557#false} is VALID [2018-11-23 12:34:10,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {1557#false} ~cond := #in~cond; {1557#false} is VALID [2018-11-23 12:34:10,750 INFO L273 TraceCheckUtils]: 23: Hoare triple {1557#false} assume 0 == ~cond; {1557#false} is VALID [2018-11-23 12:34:10,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {1557#false} assume !false; {1557#false} is VALID [2018-11-23 12:34:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:34:10,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:10,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:10,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:34:10,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:10,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:10,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:10,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:10,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:10,825 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 4 states. [2018-11-23 12:34:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,285 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-23 12:34:11,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:11,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:34:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:34:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-23 12:34:11,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2018-11-23 12:34:11,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:11,423 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:34:11,423 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:34:11,423 INFO L631 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-23 12:34:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:34:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2018-11-23 12:34:11,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:11,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 44 states. [2018-11-23 12:34:11,521 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 44 states. [2018-11-23 12:34:11,521 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 44 states. [2018-11-23 12:34:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,526 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-23 12:34:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 12:34:11,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:11,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:11,527 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 70 states. [2018-11-23 12:34:11,527 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 70 states. [2018-11-23 12:34:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:11,531 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2018-11-23 12:34:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 12:34:11,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:11,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:11,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:11,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:34:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 12:34:11,534 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 25 [2018-11-23 12:34:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:11,535 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 12:34:11,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 12:34:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:34:11,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:11,536 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:11,536 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:11,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1698801625, now seen corresponding path program 1 times [2018-11-23 12:34:11,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:11,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:11,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:11,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:11,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:11,544 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:11,545 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:11,545 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-23 12:34:11,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:11,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:11,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {1988#true} call ULTIMATE.init(); {1988#true} is VALID [2018-11-23 12:34:11,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {1988#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1988#true} is VALID [2018-11-23 12:34:11,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {1988#true} assume true; {1988#true} is VALID [2018-11-23 12:34:11,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1988#true} {1988#true} #138#return; {1988#true} is VALID [2018-11-23 12:34:11,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {1988#true} call #t~ret7 := main(); {1988#true} is VALID [2018-11-23 12:34:11,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {1988#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2008#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:11,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {2008#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2008#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:11,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {2008#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2015#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:11,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {2015#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2019#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:11,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {2019#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2023#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:11,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !(~k~0 < ~p~0); {1989#false} is VALID [2018-11-23 12:34:11,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {1989#false} ~j~0 := 1 + ~j~0; {1989#false} is VALID [2018-11-23 12:34:11,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {1989#false} assume !(~j~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:34:11,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {1989#false} ~i~0 := 1 + ~i~0; {1989#false} is VALID [2018-11-23 12:34:11,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {1989#false} assume !(~i~0 < ~m~0); {1989#false} is VALID [2018-11-23 12:34:11,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {1989#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:34:11,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {1989#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:34:11,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {1989#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1989#false} is VALID [2018-11-23 12:34:11,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {1989#false} is VALID [2018-11-23 12:34:11,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {1989#false} is VALID [2018-11-23 12:34:11,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {1989#false} assume !(~k~0 < ~p~0); {1989#false} is VALID [2018-11-23 12:34:11,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {1989#false} ~j~0 := 1 + ~j~0; {1989#false} is VALID [2018-11-23 12:34:11,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {1989#false} assume !(~j~0 < ~n~0); {1989#false} is VALID [2018-11-23 12:34:11,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {1989#false} ~i~0 := 1 + ~i~0; {1989#false} is VALID [2018-11-23 12:34:11,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {1989#false} assume !(~i~0 < ~m~0); {1989#false} is VALID [2018-11-23 12:34:11,791 INFO L273 TraceCheckUtils]: 25: Hoare triple {1989#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:34:11,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {1989#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1989#false} is VALID [2018-11-23 12:34:11,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {1989#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1989#false} is VALID [2018-11-23 12:34:11,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {1989#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1989#false} is VALID [2018-11-23 12:34:11,793 INFO L256 TraceCheckUtils]: 29: Hoare triple {1989#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1989#false} is VALID [2018-11-23 12:34:11,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {1989#false} ~cond := #in~cond; {1989#false} is VALID [2018-11-23 12:34:11,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {1989#false} assume 0 == ~cond; {1989#false} is VALID [2018-11-23 12:34:11,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {1989#false} assume !false; {1989#false} is VALID [2018-11-23 12:34:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:34:11,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:11,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:34:11,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:34:11,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:11,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:11,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:11,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:11,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:11,939 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2018-11-23 12:34:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:12,717 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2018-11-23 12:34:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:12,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-23 12:34:12,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 12:34:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2018-11-23 12:34:12,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 99 transitions. [2018-11-23 12:34:12,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:12,828 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:34:12,828 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:34:12,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-23 12:34:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:34:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 12:34:13,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:13,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-23 12:34:13,383 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-23 12:34:13,383 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-23 12:34:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:13,385 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:34:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:34:13,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:13,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:13,386 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-23 12:34:13,386 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-23 12:34:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:13,389 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:34:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:34:13,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:13,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:13,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:13,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:34:13,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2018-11-23 12:34:13,392 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 33 [2018-11-23 12:34:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:13,392 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-23 12:34:13,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-23 12:34:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:34:13,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:13,393 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:13,394 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:13,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash -602786922, now seen corresponding path program 2 times [2018-11-23 12:34:13,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:13,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:13,402 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:13,402 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:13,402 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-23 12:34:13,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:13,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:13,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:13,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:14,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {2420#true} call ULTIMATE.init(); {2420#true} is VALID [2018-11-23 12:34:14,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {2420#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2420#true} is VALID [2018-11-23 12:34:14,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {2420#true} assume true; {2420#true} is VALID [2018-11-23 12:34:14,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2420#true} {2420#true} #138#return; {2420#true} is VALID [2018-11-23 12:34:14,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {2420#true} call #t~ret7 := main(); {2420#true} is VALID [2018-11-23 12:34:14,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {2420#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2440#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:14,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {2440#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2440#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:14,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {2440#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2447#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:14,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {2447#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2451#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:14,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {2451#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2455#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:14,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2459#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:14,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {2459#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !(~k~0 < ~p~0); {2421#false} is VALID [2018-11-23 12:34:14,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {2421#false} ~j~0 := 1 + ~j~0; {2421#false} is VALID [2018-11-23 12:34:14,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {2421#false} assume !(~j~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:34:14,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {2421#false} ~i~0 := 1 + ~i~0; {2421#false} is VALID [2018-11-23 12:34:14,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {2421#false} assume !(~i~0 < ~m~0); {2421#false} is VALID [2018-11-23 12:34:14,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {2421#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:34:14,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {2421#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:34:14,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {2421#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2421#false} is VALID [2018-11-23 12:34:14,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:34:14,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:34:14,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2421#false} is VALID [2018-11-23 12:34:14,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {2421#false} assume !(~k~0 < ~p~0); {2421#false} is VALID [2018-11-23 12:34:14,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {2421#false} ~j~0 := 1 + ~j~0; {2421#false} is VALID [2018-11-23 12:34:14,177 INFO L273 TraceCheckUtils]: 24: Hoare triple {2421#false} assume !(~j~0 < ~n~0); {2421#false} is VALID [2018-11-23 12:34:14,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {2421#false} ~i~0 := 1 + ~i~0; {2421#false} is VALID [2018-11-23 12:34:14,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {2421#false} assume !(~i~0 < ~m~0); {2421#false} is VALID [2018-11-23 12:34:14,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {2421#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:34:14,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {2421#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2421#false} is VALID [2018-11-23 12:34:14,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {2421#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2421#false} is VALID [2018-11-23 12:34:14,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {2421#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2421#false} is VALID [2018-11-23 12:34:14,178 INFO L256 TraceCheckUtils]: 31: Hoare triple {2421#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {2421#false} is VALID [2018-11-23 12:34:14,178 INFO L273 TraceCheckUtils]: 32: Hoare triple {2421#false} ~cond := #in~cond; {2421#false} is VALID [2018-11-23 12:34:14,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {2421#false} assume 0 == ~cond; {2421#false} is VALID [2018-11-23 12:34:14,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {2421#false} assume !false; {2421#false} is VALID [2018-11-23 12:34:14,181 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-23 12:34:14,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:14,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:34:14,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 12:34:14,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:14,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:34:14,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:14,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:34:14,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:34:14,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:14,241 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 7 states. [2018-11-23 12:34:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:14,728 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2018-11-23 12:34:14,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:34:14,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 12:34:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 12:34:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-23 12:34:14,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2018-11-23 12:34:14,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:14,897 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:34:14,897 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:34:14,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-23 12:34:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:34:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-11-23 12:34:15,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:15,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 54 states. [2018-11-23 12:34:15,146 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 54 states. [2018-11-23 12:34:15,146 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 54 states. [2018-11-23 12:34:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,153 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:34:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 12:34:15,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:15,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:15,153 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 57 states. [2018-11-23 12:34:15,153 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 57 states. [2018-11-23 12:34:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,156 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 12:34:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-23 12:34:15,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:15,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:15,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:15,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:34:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-11-23 12:34:15,159 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 35 [2018-11-23 12:34:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:15,159 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-23 12:34:15,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:34:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:34:15,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:34:15,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:15,160 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:15,161 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:15,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:15,161 INFO L82 PathProgramCache]: Analyzing trace with hash -119527047, now seen corresponding path program 3 times [2018-11-23 12:34:15,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:15,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:15,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:15,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:15,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:15,168 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:15,168 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:15,168 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-23 12:34:15,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:15,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:34:15,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:15,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:15,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {2896#true} call ULTIMATE.init(); {2896#true} is VALID [2018-11-23 12:34:15,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {2896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2896#true} is VALID [2018-11-23 12:34:15,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {2896#true} assume true; {2896#true} is VALID [2018-11-23 12:34:15,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2896#true} {2896#true} #138#return; {2896#true} is VALID [2018-11-23 12:34:15,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {2896#true} call #t~ret7 := main(); {2896#true} is VALID [2018-11-23 12:34:15,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {2896#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {2916#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {2916#(<= 1000 main_~m~0)} ~j~0 := 1 + ~j~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {2916#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {2916#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {2916#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:15,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {2916#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~k~0 < ~p~0); {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~j~0 := 1 + ~j~0; {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {2953#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2984#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {2984#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2897#false} is VALID [2018-11-23 12:34:15,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {2897#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2897#false} is VALID [2018-11-23 12:34:15,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {2897#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2897#false} is VALID [2018-11-23 12:34:15,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {2897#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2897#false} is VALID [2018-11-23 12:34:15,366 INFO L273 TraceCheckUtils]: 32: Hoare triple {2897#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2897#false} is VALID [2018-11-23 12:34:15,366 INFO L256 TraceCheckUtils]: 33: Hoare triple {2897#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {2897#false} is VALID [2018-11-23 12:34:15,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {2897#false} ~cond := #in~cond; {2897#false} is VALID [2018-11-23 12:34:15,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {2897#false} assume 0 == ~cond; {2897#false} is VALID [2018-11-23 12:34:15,367 INFO L273 TraceCheckUtils]: 36: Hoare triple {2897#false} assume !false; {2897#false} is VALID [2018-11-23 12:34:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:34:15,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:15,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:15,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 12:34:15,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:15,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:15,484 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-23 12:34:15,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:15,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:15,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:15,485 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-11-23 12:34:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,108 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2018-11-23 12:34:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:16,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-23 12:34:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:34:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2018-11-23 12:34:16,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2018-11-23 12:34:16,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:16,245 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:34:16,246 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:34:16,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-23 12:34:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:34:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 74. [2018-11-23 12:34:16,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:16,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 74 states. [2018-11-23 12:34:16,712 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 74 states. [2018-11-23 12:34:16,712 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 74 states. [2018-11-23 12:34:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,717 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-23 12:34:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2018-11-23 12:34:16,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:16,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:16,719 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 128 states. [2018-11-23 12:34:16,719 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 128 states. [2018-11-23 12:34:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,724 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2018-11-23 12:34:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2018-11-23 12:34:16,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:16,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:16,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:16,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:34:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2018-11-23 12:34:16,728 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 37 [2018-11-23 12:34:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:16,728 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-23 12:34:16,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-23 12:34:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:34:16,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:16,732 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:16,732 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:16,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1459343723, now seen corresponding path program 4 times [2018-11-23 12:34:16,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:16,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:16,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:16,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:16,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:16,740 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:16,741 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:16,741 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-23 12:34:16,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:50,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:50,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:50,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:50,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {3668#true} call ULTIMATE.init(); {3668#true} is VALID [2018-11-23 12:34:50,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {3668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3668#true} is VALID [2018-11-23 12:34:50,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {3668#true} assume true; {3668#true} is VALID [2018-11-23 12:34:50,594 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3668#true} {3668#true} #138#return; {3668#true} is VALID [2018-11-23 12:34:50,594 INFO L256 TraceCheckUtils]: 4: Hoare triple {3668#true} call #t~ret7 := main(); {3668#true} is VALID [2018-11-23 12:34:50,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {3668#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3688#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:50,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {3688#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3688#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:50,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {3688#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3695#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:50,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {3695#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3699#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:50,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {3699#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3703#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:50,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {3703#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3707#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:50,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {3707#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3711#(and (<= 1800 main_~p~0) (<= main_~k~0 4))} is VALID [2018-11-23 12:34:50,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {3711#(and (<= 1800 main_~p~0) (<= main_~k~0 4))} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:34:50,610 INFO L273 TraceCheckUtils]: 13: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:34:50,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:34:50,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:34:50,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet1;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:34:50,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:34:50,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:34:50,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:34:50,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {3669#false} assume !(~i~0 < ~m~0); {3669#false} is VALID [2018-11-23 12:34:50,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {3669#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,615 INFO L273 TraceCheckUtils]: 32: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:34:50,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:34:50,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:34:50,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:34:50,616 INFO L273 TraceCheckUtils]: 38: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,617 INFO L273 TraceCheckUtils]: 43: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~mem3;havoc #t~mem2;~k~0 := 1 + ~k~0; {3669#false} is VALID [2018-11-23 12:34:50,617 INFO L273 TraceCheckUtils]: 44: Hoare triple {3669#false} assume !(~k~0 < ~p~0); {3669#false} is VALID [2018-11-23 12:34:50,618 INFO L273 TraceCheckUtils]: 45: Hoare triple {3669#false} ~j~0 := 1 + ~j~0; {3669#false} is VALID [2018-11-23 12:34:50,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {3669#false} assume !(~j~0 < ~n~0); {3669#false} is VALID [2018-11-23 12:34:50,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {3669#false} ~i~0 := 1 + ~i~0; {3669#false} is VALID [2018-11-23 12:34:50,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {3669#false} assume !(~i~0 < ~m~0); {3669#false} is VALID [2018-11-23 12:34:50,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {3669#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {3669#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {3669#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3669#false} is VALID [2018-11-23 12:34:50,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {3669#false} assume !!(~k~0 < ~p~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {3669#false} is VALID [2018-11-23 12:34:50,619 INFO L256 TraceCheckUtils]: 53: Hoare triple {3669#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {3669#false} is VALID [2018-11-23 12:34:50,620 INFO L273 TraceCheckUtils]: 54: Hoare triple {3669#false} ~cond := #in~cond; {3669#false} is VALID [2018-11-23 12:34:50,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {3669#false} assume 0 == ~cond; {3669#false} is VALID [2018-11-23 12:34:50,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {3669#false} assume !false; {3669#false} is VALID [2018-11-23 12:34:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-23 12:34:50,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:50,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:34:50,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-23 12:34:50,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:50,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:34:50,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:50,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:34:50,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:34:50,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:34:50,732 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 8 states. [2018-11-23 12:34:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,667 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2018-11-23 12:34:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:34:51,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-23 12:34:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2018-11-23 12:34:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:34:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2018-11-23 12:34:51,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 111 transitions. [2018-11-23 12:34:51,834 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-23 12:34:51,836 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:34:51,836 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:34:51,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 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-23 12:34:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:34:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-11-23 12:34:52,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:52,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 81 states. [2018-11-23 12:34:52,196 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 81 states. [2018-11-23 12:34:52,196 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 81 states. [2018-11-23 12:34:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:52,199 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-23 12:34:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-11-23 12:34:52,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:52,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:52,200 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 84 states. [2018-11-23 12:34:52,200 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 84 states. [2018-11-23 12:34:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:52,202 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-23 12:34:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-11-23 12:34:52,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:52,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:52,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:52,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:34:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2018-11-23 12:34:52,206 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 57 [2018-11-23 12:34:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:52,206 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2018-11-23 12:34:52,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:34:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2018-11-23 12:34:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:34:52,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:52,207 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:52,208 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:52,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:52,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1598561597, now seen corresponding path program 5 times [2018-11-23 12:34:52,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:52,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:52,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:52,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:52,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:52,215 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:52,216 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:52,216 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-23 12:34:52,232 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1