java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:59:15,803 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:59:15,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:59:15,818 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:59:15,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:59:15,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:59:15,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:59:15,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:59:15,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:59:15,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:59:15,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:59:15,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:59:15,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:59:15,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:59:15,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:59:15,831 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:59:15,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:59:15,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:59:15,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:59:15,838 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:59:15,839 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:59:15,840 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:59:15,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:59:15,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:59:15,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:59:15,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:59:15,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:59:15,846 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:59:15,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:59:15,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:59:15,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:59:15,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:59:15,849 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:59:15,849 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:59:15,850 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:59:15,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:59:15,851 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:59:15,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:59:15,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:59:15,877 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:59:15,878 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:59:15,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:59:15,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:59:15,879 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:59:15,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:59:15,879 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:59:15,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:59:15,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:59:15,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:59:15,881 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:59:15,881 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:59:15,881 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:59:15,882 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:59:15,882 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:59:15,882 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:59:15,882 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:59:15,882 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:59:15,884 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:59:15,884 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:59:15,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:59:15,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:59:15,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:59:15,885 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:59:15,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:59:15,885 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:59:15,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:59:15,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:59:15,886 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:59:15,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:59:15,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:59:15,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:59:15,984 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:59:15,984 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:59:15,985 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i [2018-11-14 18:59:16,045 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe379cdd8/2e8403c069af42adb8cb13813747abc4/FLAG0e3dd4570 [2018-11-14 18:59:16,478 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:59:16,479 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i [2018-11-14 18:59:16,485 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe379cdd8/2e8403c069af42adb8cb13813747abc4/FLAG0e3dd4570 [2018-11-14 18:59:16,501 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe379cdd8/2e8403c069af42adb8cb13813747abc4 [2018-11-14 18:59:16,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:59:16,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:59:16,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:59:16,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:59:16,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:59:16,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd8c054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16, skipping insertion in model container [2018-11-14 18:59:16,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:59:16,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:59:16,809 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:59:16,813 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:59:16,846 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:59:16,872 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:59:16,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16 WrapperNode [2018-11-14 18:59:16,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:59:16,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:59:16,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:59:16,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:59:16,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (1/1) ... [2018-11-14 18:59:16,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:59:16,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:59:16,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:59:16,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:59:16,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (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-14 18:59:17,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:59:17,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:59:17,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:59:17,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:59:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:59:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:59:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:59:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:59:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:59:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:59:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:59:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:59:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:59:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:59:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:59:17,543 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:59:17,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:59:17 BoogieIcfgContainer [2018-11-14 18:59:17,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:59:17,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:59:17,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:59:17,548 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:59:17,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:59:16" (1/3) ... [2018-11-14 18:59:17,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d135a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:59:17, skipping insertion in model container [2018-11-14 18:59:17,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:16" (2/3) ... [2018-11-14 18:59:17,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d135a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:59:17, skipping insertion in model container [2018-11-14 18:59:17,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:59:17" (3/3) ... [2018-11-14 18:59:17,552 INFO L112 eAbstractionObserver]: Analyzing ICFG init-2-n-u_true-unreach-call.i [2018-11-14 18:59:17,560 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:59:17,568 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:59:17,582 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:59:17,615 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:59:17,616 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:59:17,616 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:59:17,616 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:59:17,617 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:59:17,617 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:59:17,617 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:59:17,617 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:59:17,617 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:59:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-14 18:59:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:59:17,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:17,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:17,647 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:17,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:17,653 INFO L82 PathProgramCache]: Analyzing trace with hash 319343225, now seen corresponding path program 1 times [2018-11-14 18:59:17,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:17,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:17,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:17,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:17,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:17,736 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:17,736 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:17,737 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-14 18:59:17,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:17,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:17,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-14 18:59:17,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-14 18:59:17,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-14 18:59:17,998 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #77#return; {33#true} is VALID [2018-11-14 18:59:17,998 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2018-11-14 18:59:17,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {33#true} is VALID [2018-11-14 18:59:18,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-14 18:59:18,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0;~j~0 := 0; {34#false} is VALID [2018-11-14 18:59:18,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-14 18:59:18,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {34#false} is VALID [2018-11-14 18:59:18,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-14 18:59:18,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {34#false} is VALID [2018-11-14 18:59:18,014 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {34#false} is VALID [2018-11-14 18:59:18,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-14 18:59:18,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume ~cond == 0; {34#false} is VALID [2018-11-14 18:59:18,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-14 18:59:18,019 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-14 18:59:18,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:18,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:59:18,061 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:59:18,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:18,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:59:18,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:18,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:59:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:59:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:59:18,237 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-14 18:59:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:18,386 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-14 18:59:18,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:59:18,386 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:59:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:59:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-14 18:59:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:59:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-14 18:59:18,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-14 18:59:18,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:18,684 INFO L225 Difference]: With dead ends: 54 [2018-11-14 18:59:18,685 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 18:59:18,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-14 18:59:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 18:59:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 18:59:18,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:18,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 18:59:18,849 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 18:59:18,849 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 18:59:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:18,854 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-14 18:59:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 18:59:18,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:18,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:18,856 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 18:59:18,856 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 18:59:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:18,861 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-14 18:59:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 18:59:18,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:18,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:18,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:18,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:59:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-14 18:59:18,868 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-14 18:59:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:18,868 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-14 18:59:18,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:59:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 18:59:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:59:18,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:18,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:18,870 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:18,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash -855125148, now seen corresponding path program 1 times [2018-11-14 18:59:18,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:18,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:18,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:18,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:18,881 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:18,882 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:18,882 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-14 18:59:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:18,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:19,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-14 18:59:19,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {237#true} is VALID [2018-11-14 18:59:19,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-14 18:59:19,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #77#return; {237#true} is VALID [2018-11-14 18:59:19,200 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret2 := main(); {237#true} is VALID [2018-11-14 18:59:19,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {257#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:19,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {257#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:19,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {257#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {238#false} is VALID [2018-11-14 18:59:19,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {238#false} ~i~0 := 0;~j~0 := 0; {238#false} is VALID [2018-11-14 18:59:19,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-14 18:59:19,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {238#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {238#false} is VALID [2018-11-14 18:59:19,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-14 18:59:19,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {238#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {238#false} is VALID [2018-11-14 18:59:19,245 INFO L256 TraceCheckUtils]: 13: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {238#false} is VALID [2018-11-14 18:59:19,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-14 18:59:19,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume ~cond == 0; {238#false} is VALID [2018-11-14 18:59:19,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-14 18:59:19,248 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-14 18:59:19,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:19,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:59:19,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:59:19,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:19,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:59:19,468 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-14 18:59:19,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:59:19,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:59:19,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:59:19,469 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-14 18:59:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:19,829 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-14 18:59:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:59:19,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 18:59:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:59:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 18:59:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:59:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 18:59:19,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 18:59:19,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:19,960 INFO L225 Difference]: With dead ends: 44 [2018-11-14 18:59:19,960 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 18:59:19,961 INFO L604 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-14 18:59:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 18:59:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-14 18:59:19,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:19,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2018-11-14 18:59:19,985 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2018-11-14 18:59:19,985 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2018-11-14 18:59:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:19,988 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 18:59:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 18:59:19,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:19,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:19,989 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2018-11-14 18:59:19,990 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2018-11-14 18:59:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:19,992 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 18:59:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 18:59:19,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:19,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:19,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:19,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:59:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-14 18:59:19,997 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-14 18:59:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:19,997 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-14 18:59:19,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:59:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:59:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:59:19,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:19,998 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:19,999 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:19,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:19,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1309373471, now seen corresponding path program 1 times [2018-11-14 18:59:19,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:20,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:20,008 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:20,008 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:20,009 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-14 18:59:20,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:20,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:20,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {448#true} call ULTIMATE.init(); {448#true} is VALID [2018-11-14 18:59:20,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {448#true} is VALID [2018-11-14 18:59:20,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {448#true} assume true; {448#true} is VALID [2018-11-14 18:59:20,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {448#true} {448#true} #77#return; {448#true} is VALID [2018-11-14 18:59:20,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {448#true} call #t~ret2 := main(); {448#true} is VALID [2018-11-14 18:59:20,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {448#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {468#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:20,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(<= 1500 main_~n~0)} assume true; {468#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:20,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {475#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:20,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {475#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {475#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:20,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {449#false} is VALID [2018-11-14 18:59:20,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {449#false} ~i~0 := ~i~0 + 1; {449#false} is VALID [2018-11-14 18:59:20,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {449#false} assume true; {449#false} is VALID [2018-11-14 18:59:20,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {449#false} assume !(~i~0 < ~m~0); {449#false} is VALID [2018-11-14 18:59:20,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {449#false} ~i~0 := 0;~j~0 := 0; {449#false} is VALID [2018-11-14 18:59:20,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {449#false} assume true; {449#false} is VALID [2018-11-14 18:59:20,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {449#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {449#false} is VALID [2018-11-14 18:59:20,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {449#false} assume true; {449#false} is VALID [2018-11-14 18:59:20,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {449#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {449#false} is VALID [2018-11-14 18:59:20,156 INFO L256 TraceCheckUtils]: 18: Hoare triple {449#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {449#false} is VALID [2018-11-14 18:59:20,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {449#false} ~cond := #in~cond; {449#false} is VALID [2018-11-14 18:59:20,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {449#false} assume ~cond == 0; {449#false} is VALID [2018-11-14 18:59:20,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {449#false} assume !false; {449#false} is VALID [2018-11-14 18:59:20,159 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-14 18:59:20,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:20,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:59:20,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-14 18:59:20,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:20,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:20,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:20,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:20,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:20,224 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-14 18:59:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:20,600 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-14 18:59:20,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:20,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-14 18:59:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 18:59:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 18:59:20,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 18:59:20,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:20,708 INFO L225 Difference]: With dead ends: 54 [2018-11-14 18:59:20,708 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 18:59:20,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-14 18:59:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 18:59:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-14 18:59:20,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:20,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-14 18:59:20,752 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-14 18:59:20,753 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-14 18:59:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:20,758 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-14 18:59:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 18:59:20,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:20,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:20,759 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-14 18:59:20,759 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-14 18:59:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:20,763 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-14 18:59:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 18:59:20,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:20,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:20,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:20,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:59:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-14 18:59:20,767 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2018-11-14 18:59:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:20,767 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-14 18:59:20,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 18:59:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:59:20,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:20,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:20,769 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:20,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1855282247, now seen corresponding path program 1 times [2018-11-14 18:59:20,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:20,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:20,778 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:20,778 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:20,778 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-14 18:59:20,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:20,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:21,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {706#true} call ULTIMATE.init(); {706#true} is VALID [2018-11-14 18:59:21,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {706#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {706#true} is VALID [2018-11-14 18:59:21,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {706#true} assume true; {706#true} is VALID [2018-11-14 18:59:21,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {706#true} {706#true} #77#return; {706#true} is VALID [2018-11-14 18:59:21,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {706#true} call #t~ret2 := main(); {706#true} is VALID [2018-11-14 18:59:21,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {706#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {726#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:21,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {726#(<= 1500 main_~n~0)} assume true; {726#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:21,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {726#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {733#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:21,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {733#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {733#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:21,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {733#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {740#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:21,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {740#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {740#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:21,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {740#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {707#false} is VALID [2018-11-14 18:59:21,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {707#false} ~i~0 := ~i~0 + 1; {707#false} is VALID [2018-11-14 18:59:21,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {707#false} assume true; {707#false} is VALID [2018-11-14 18:59:21,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {707#false} assume !(~i~0 < ~m~0); {707#false} is VALID [2018-11-14 18:59:21,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {707#false} ~i~0 := 0;~j~0 := 0; {707#false} is VALID [2018-11-14 18:59:21,139 INFO L273 TraceCheckUtils]: 16: Hoare triple {707#false} assume true; {707#false} is VALID [2018-11-14 18:59:21,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {707#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {707#false} is VALID [2018-11-14 18:59:21,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {707#false} assume true; {707#false} is VALID [2018-11-14 18:59:21,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {707#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {707#false} is VALID [2018-11-14 18:59:21,140 INFO L256 TraceCheckUtils]: 20: Hoare triple {707#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {707#false} is VALID [2018-11-14 18:59:21,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {707#false} ~cond := #in~cond; {707#false} is VALID [2018-11-14 18:59:21,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {707#false} assume ~cond == 0; {707#false} is VALID [2018-11-14 18:59:21,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {707#false} assume !false; {707#false} is VALID [2018-11-14 18:59:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:21,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:21,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 18:59:21,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-14 18:59:21,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:21,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:59:21,191 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-14 18:59:21,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:59:21,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:59:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:21,192 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-11-14 18:59:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:21,422 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-14 18:59:21,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:59:21,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-14 18:59:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 18:59:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 18:59:21,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2018-11-14 18:59:21,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:21,519 INFO L225 Difference]: With dead ends: 64 [2018-11-14 18:59:21,519 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 18:59:21,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 18:59:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-11-14 18:59:21,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:21,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 37 states. [2018-11-14 18:59:21,563 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 37 states. [2018-11-14 18:59:21,564 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 37 states. [2018-11-14 18:59:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:21,568 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-14 18:59:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 18:59:21,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:21,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:21,569 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 41 states. [2018-11-14 18:59:21,569 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 41 states. [2018-11-14 18:59:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:21,572 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-14 18:59:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 18:59:21,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:21,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:21,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:21,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:59:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 18:59:21,577 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-11-14 18:59:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:21,577 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 18:59:21,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:59:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 18:59:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:59:21,579 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:21,579 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:21,579 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:21,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2042385619, now seen corresponding path program 2 times [2018-11-14 18:59:21,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:21,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:21,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:21,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:21,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:21,588 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:21,588 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:21,588 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-14 18:59:21,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:59:21,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:59:21,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:21,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:21,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {1007#true} call ULTIMATE.init(); {1007#true} is VALID [2018-11-14 18:59:21,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {1007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1007#true} is VALID [2018-11-14 18:59:21,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {1007#true} assume true; {1007#true} is VALID [2018-11-14 18:59:21,791 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1007#true} {1007#true} #77#return; {1007#true} is VALID [2018-11-14 18:59:21,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {1007#true} call #t~ret2 := main(); {1007#true} is VALID [2018-11-14 18:59:21,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {1007#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {1027#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:21,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {1027#(<= 1500 main_~n~0)} assume true; {1027#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:21,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {1027#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1034#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:21,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {1034#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {1034#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:21,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {1034#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1041#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:21,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {1041#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {1041#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:21,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {1041#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1048#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:21,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {1048#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {1048#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:21,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {1048#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1008#false} is VALID [2018-11-14 18:59:21,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {1008#false} ~i~0 := ~i~0 + 1; {1008#false} is VALID [2018-11-14 18:59:21,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {1008#false} assume true; {1008#false} is VALID [2018-11-14 18:59:21,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {1008#false} assume !(~i~0 < ~m~0); {1008#false} is VALID [2018-11-14 18:59:21,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {1008#false} ~i~0 := 0;~j~0 := 0; {1008#false} is VALID [2018-11-14 18:59:21,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {1008#false} assume true; {1008#false} is VALID [2018-11-14 18:59:21,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {1008#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1008#false} is VALID [2018-11-14 18:59:21,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {1008#false} assume true; {1008#false} is VALID [2018-11-14 18:59:21,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {1008#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1008#false} is VALID [2018-11-14 18:59:21,800 INFO L256 TraceCheckUtils]: 22: Hoare triple {1008#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1008#false} is VALID [2018-11-14 18:59:21,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {1008#false} ~cond := #in~cond; {1008#false} is VALID [2018-11-14 18:59:21,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {1008#false} assume ~cond == 0; {1008#false} is VALID [2018-11-14 18:59:21,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {1008#false} assume !false; {1008#false} is VALID [2018-11-14 18:59:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:21,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:21,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 18:59:21,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-14 18:59:21,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:21,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:59:21,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:21,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:59:21,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:59:21,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:59:21,919 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2018-11-14 18:59:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:22,256 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-14 18:59:22,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:59:22,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-14 18:59:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:59:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 18:59:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:59:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 18:59:22,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-14 18:59:22,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:22,351 INFO L225 Difference]: With dead ends: 76 [2018-11-14 18:59:22,351 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 18:59:22,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-14 18:59:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 18:59:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-14 18:59:22,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:22,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-14 18:59:22,414 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-14 18:59:22,414 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-14 18:59:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:22,418 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-14 18:59:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 18:59:22,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:22,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:22,419 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-14 18:59:22,419 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-14 18:59:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:22,423 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-14 18:59:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 18:59:22,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:22,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:22,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:22,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 18:59:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-14 18:59:22,431 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 26 [2018-11-14 18:59:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:22,431 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-14 18:59:22,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:59:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 18:59:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:59:22,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:22,435 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:22,435 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:22,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1805244563, now seen corresponding path program 3 times [2018-11-14 18:59:22,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:22,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:22,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:22,454 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:22,454 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:22,455 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-14 18:59:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:59:22,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:59:22,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:22,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:22,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2018-11-14 18:59:22,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {1354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1354#true} is VALID [2018-11-14 18:59:22,623 INFO L273 TraceCheckUtils]: 2: Hoare triple {1354#true} assume true; {1354#true} is VALID [2018-11-14 18:59:22,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1354#true} {1354#true} #77#return; {1354#true} is VALID [2018-11-14 18:59:22,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {1354#true} call #t~ret2 := main(); {1354#true} is VALID [2018-11-14 18:59:22,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {1354#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {1408#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {1408#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {1408#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:22,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {1408#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1355#false} is VALID [2018-11-14 18:59:22,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {1355#false} ~i~0 := 0;~j~0 := 0; {1355#false} is VALID [2018-11-14 18:59:22,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {1355#false} assume true; {1355#false} is VALID [2018-11-14 18:59:22,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {1355#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1355#false} is VALID [2018-11-14 18:59:22,651 INFO L273 TraceCheckUtils]: 22: Hoare triple {1355#false} assume true; {1355#false} is VALID [2018-11-14 18:59:22,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {1355#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1355#false} is VALID [2018-11-14 18:59:22,651 INFO L256 TraceCheckUtils]: 24: Hoare triple {1355#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1355#false} is VALID [2018-11-14 18:59:22,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {1355#false} ~cond := #in~cond; {1355#false} is VALID [2018-11-14 18:59:22,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {1355#false} assume ~cond == 0; {1355#false} is VALID [2018-11-14 18:59:22,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2018-11-14 18:59:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:59:22,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:22,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 18:59:22,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-14 18:59:22,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:22,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:22,716 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-14 18:59:22,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:22,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:22,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:22,718 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-14 18:59:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:22,887 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-14 18:59:22,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:22,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-14 18:59:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:22,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 18:59:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 18:59:22,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-14 18:59:22,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:22,968 INFO L225 Difference]: With dead ends: 87 [2018-11-14 18:59:22,968 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 18:59:22,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-14 18:59:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 18:59:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-14 18:59:23,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:23,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 54 states. [2018-11-14 18:59:23,037 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 54 states. [2018-11-14 18:59:23,037 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 54 states. [2018-11-14 18:59:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:23,041 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-14 18:59:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-14 18:59:23,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:23,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:23,043 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 63 states. [2018-11-14 18:59:23,043 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 63 states. [2018-11-14 18:59:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:23,046 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-14 18:59:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-14 18:59:23,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:23,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:23,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:23,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 18:59:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-11-14 18:59:23,050 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-11-14 18:59:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:23,051 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-11-14 18:59:23,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-14 18:59:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:59:23,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:23,052 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:23,052 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:23,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1067454468, now seen corresponding path program 4 times [2018-11-14 18:59:23,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:23,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:23,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:23,061 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:23,062 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:23,062 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-14 18:59:23,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:59:23,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:59:23,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:23,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:23,334 INFO L256 TraceCheckUtils]: 0: Hoare triple {1769#true} call ULTIMATE.init(); {1769#true} is VALID [2018-11-14 18:59:23,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {1769#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1769#true} is VALID [2018-11-14 18:59:23,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {1769#true} assume true; {1769#true} is VALID [2018-11-14 18:59:23,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1769#true} {1769#true} #77#return; {1769#true} is VALID [2018-11-14 18:59:23,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {1769#true} call #t~ret2 := main(); {1769#true} is VALID [2018-11-14 18:59:23,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {1769#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {1789#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:23,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {1789#(<= 1500 main_~n~0)} assume true; {1789#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:23,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {1789#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1796#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:23,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {1796#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {1796#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:23,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {1796#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1803#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:23,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {1803#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {1803#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:23,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {1803#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1810#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:23,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {1810#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {1810#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:23,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {1810#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1817#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:23,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {1817#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {1817#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:23,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {1817#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {1770#false} is VALID [2018-11-14 18:59:23,345 INFO L273 TraceCheckUtils]: 16: Hoare triple {1770#false} ~i~0 := ~i~0 + 1; {1770#false} is VALID [2018-11-14 18:59:23,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-14 18:59:23,345 INFO L273 TraceCheckUtils]: 18: Hoare triple {1770#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1770#false} is VALID [2018-11-14 18:59:23,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-14 18:59:23,346 INFO L273 TraceCheckUtils]: 20: Hoare triple {1770#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1770#false} is VALID [2018-11-14 18:59:23,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-14 18:59:23,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {1770#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1770#false} is VALID [2018-11-14 18:59:23,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-14 18:59:23,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {1770#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {1770#false} is VALID [2018-11-14 18:59:23,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-14 18:59:23,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {1770#false} assume !(~j~0 < ~n~0); {1770#false} is VALID [2018-11-14 18:59:23,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {1770#false} ~i~0 := ~i~0 + 1; {1770#false} is VALID [2018-11-14 18:59:23,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-14 18:59:23,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {1770#false} assume !(~i~0 < ~m~0); {1770#false} is VALID [2018-11-14 18:59:23,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {1770#false} ~i~0 := 0;~j~0 := 0; {1770#false} is VALID [2018-11-14 18:59:23,348 INFO L273 TraceCheckUtils]: 31: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-14 18:59:23,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {1770#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1770#false} is VALID [2018-11-14 18:59:23,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-14 18:59:23,349 INFO L273 TraceCheckUtils]: 34: Hoare triple {1770#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1770#false} is VALID [2018-11-14 18:59:23,349 INFO L256 TraceCheckUtils]: 35: Hoare triple {1770#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1770#false} is VALID [2018-11-14 18:59:23,349 INFO L273 TraceCheckUtils]: 36: Hoare triple {1770#false} ~cond := #in~cond; {1770#false} is VALID [2018-11-14 18:59:23,349 INFO L273 TraceCheckUtils]: 37: Hoare triple {1770#false} assume ~cond == 0; {1770#false} is VALID [2018-11-14 18:59:23,350 INFO L273 TraceCheckUtils]: 38: Hoare triple {1770#false} assume !false; {1770#false} is VALID [2018-11-14 18:59:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 18:59:23,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:23,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 18:59:23,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-14 18:59:23,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:23,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:59:23,403 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-14 18:59:23,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:59:23,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:59:23,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:59:23,405 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 7 states. [2018-11-14 18:59:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:23,933 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2018-11-14 18:59:23,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:59:23,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-14 18:59:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:59:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-14 18:59:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:59:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-14 18:59:23,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 84 transitions. [2018-11-14 18:59:24,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:24,050 INFO L225 Difference]: With dead ends: 104 [2018-11-14 18:59:24,050 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:59:24,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:59:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:59:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-11-14 18:59:24,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:24,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 62 states. [2018-11-14 18:59:24,173 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 62 states. [2018-11-14 18:59:24,174 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 62 states. [2018-11-14 18:59:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:24,178 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 18:59:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-14 18:59:24,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:24,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:24,179 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 66 states. [2018-11-14 18:59:24,179 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 66 states. [2018-11-14 18:59:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:24,182 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 18:59:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-14 18:59:24,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:24,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:24,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:24,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:59:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-11-14 18:59:24,186 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 39 [2018-11-14 18:59:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:24,187 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-14 18:59:24,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:59:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-14 18:59:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 18:59:24,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:24,188 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:24,189 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:24,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash -948372092, now seen corresponding path program 5 times [2018-11-14 18:59:24,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:24,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:24,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:24,197 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:24,197 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:24,197 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-14 18:59:24,214 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:59:24,321 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 18:59:24,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:24,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:24,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {2263#true} call ULTIMATE.init(); {2263#true} is VALID [2018-11-14 18:59:24,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {2263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2263#true} is VALID [2018-11-14 18:59:24,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {2263#true} assume true; {2263#true} is VALID [2018-11-14 18:59:24,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2263#true} {2263#true} #77#return; {2263#true} is VALID [2018-11-14 18:59:24,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {2263#true} call #t~ret2 := main(); {2263#true} is VALID [2018-11-14 18:59:24,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {2263#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {2283#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:24,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {2283#(<= 1500 main_~n~0)} assume true; {2283#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:24,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {2283#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2290#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:24,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {2290#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {2290#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:24,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {2290#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2297#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:24,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {2297#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {2297#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:24,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {2297#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2304#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:24,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {2304#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {2304#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:24,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {2304#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2311#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:24,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {2311#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {2311#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:24,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {2311#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2318#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 18:59:24,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {2318#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {2318#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 18:59:24,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {2264#false} is VALID [2018-11-14 18:59:24,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {2264#false} ~i~0 := ~i~0 + 1; {2264#false} is VALID [2018-11-14 18:59:24,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {2264#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2264#false} is VALID [2018-11-14 18:59:24,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2264#false} is VALID [2018-11-14 18:59:24,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,909 INFO L273 TraceCheckUtils]: 24: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2264#false} is VALID [2018-11-14 18:59:24,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2264#false} is VALID [2018-11-14 18:59:24,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,910 INFO L273 TraceCheckUtils]: 28: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2264#false} is VALID [2018-11-14 18:59:24,910 INFO L273 TraceCheckUtils]: 29: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,910 INFO L273 TraceCheckUtils]: 30: Hoare triple {2264#false} assume !(~j~0 < ~n~0); {2264#false} is VALID [2018-11-14 18:59:24,911 INFO L273 TraceCheckUtils]: 31: Hoare triple {2264#false} ~i~0 := ~i~0 + 1; {2264#false} is VALID [2018-11-14 18:59:24,911 INFO L273 TraceCheckUtils]: 32: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,911 INFO L273 TraceCheckUtils]: 33: Hoare triple {2264#false} assume !(~i~0 < ~m~0); {2264#false} is VALID [2018-11-14 18:59:24,911 INFO L273 TraceCheckUtils]: 34: Hoare triple {2264#false} ~i~0 := 0;~j~0 := 0; {2264#false} is VALID [2018-11-14 18:59:24,912 INFO L273 TraceCheckUtils]: 35: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,913 INFO L273 TraceCheckUtils]: 36: Hoare triple {2264#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2264#false} is VALID [2018-11-14 18:59:24,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-14 18:59:24,913 INFO L273 TraceCheckUtils]: 38: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2264#false} is VALID [2018-11-14 18:59:24,914 INFO L256 TraceCheckUtils]: 39: Hoare triple {2264#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2264#false} is VALID [2018-11-14 18:59:24,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {2264#false} ~cond := #in~cond; {2264#false} is VALID [2018-11-14 18:59:24,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {2264#false} assume ~cond == 0; {2264#false} is VALID [2018-11-14 18:59:24,914 INFO L273 TraceCheckUtils]: 42: Hoare triple {2264#false} assume !false; {2264#false} is VALID [2018-11-14 18:59:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 54 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 18:59:24,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:24,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 18:59:24,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-11-14 18:59:24,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:24,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:59:24,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:24,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:59:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:59:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:59:24,987 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 8 states. [2018-11-14 18:59:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:25,418 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2018-11-14 18:59:25,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:59:25,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-11-14 18:59:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:59:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2018-11-14 18:59:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:59:25,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2018-11-14 18:59:25,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2018-11-14 18:59:25,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:25,511 INFO L225 Difference]: With dead ends: 118 [2018-11-14 18:59:25,511 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 18:59:25,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:59:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 18:59:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-11-14 18:59:25,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:25,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 70 states. [2018-11-14 18:59:25,959 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 70 states. [2018-11-14 18:59:25,959 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 70 states. [2018-11-14 18:59:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:25,965 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-14 18:59:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-14 18:59:25,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:25,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:25,965 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 74 states. [2018-11-14 18:59:25,970 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 74 states. [2018-11-14 18:59:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:25,973 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-14 18:59:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-14 18:59:25,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:25,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:25,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:25,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 18:59:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-11-14 18:59:25,977 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 43 [2018-11-14 18:59:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:25,977 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-11-14 18:59:25,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:59:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-11-14 18:59:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 18:59:25,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:25,978 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:25,979 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:25,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash -254276092, now seen corresponding path program 6 times [2018-11-14 18:59:25,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:25,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:25,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:25,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:25,986 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:25,986 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:25,986 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-14 18:59:25,995 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:59:26,016 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 18:59:26,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:26,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:26,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {2819#true} call ULTIMATE.init(); {2819#true} is VALID [2018-11-14 18:59:26,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {2819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2819#true} is VALID [2018-11-14 18:59:26,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {2819#true} assume true; {2819#true} is VALID [2018-11-14 18:59:26,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2819#true} {2819#true} #77#return; {2819#true} is VALID [2018-11-14 18:59:26,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {2819#true} call #t~ret2 := main(); {2819#true} is VALID [2018-11-14 18:59:26,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {2819#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,349 INFO L273 TraceCheckUtils]: 19: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,351 INFO L273 TraceCheckUtils]: 21: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,357 INFO L273 TraceCheckUtils]: 28: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,359 INFO L273 TraceCheckUtils]: 31: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,360 INFO L273 TraceCheckUtils]: 32: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {2931#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {2931#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume true; {2931#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:26,364 INFO L273 TraceCheckUtils]: 37: Hoare triple {2931#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2820#false} is VALID [2018-11-14 18:59:26,364 INFO L273 TraceCheckUtils]: 38: Hoare triple {2820#false} ~i~0 := 0;~j~0 := 0; {2820#false} is VALID [2018-11-14 18:59:26,365 INFO L273 TraceCheckUtils]: 39: Hoare triple {2820#false} assume true; {2820#false} is VALID [2018-11-14 18:59:26,365 INFO L273 TraceCheckUtils]: 40: Hoare triple {2820#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2820#false} is VALID [2018-11-14 18:59:26,365 INFO L273 TraceCheckUtils]: 41: Hoare triple {2820#false} assume true; {2820#false} is VALID [2018-11-14 18:59:26,366 INFO L273 TraceCheckUtils]: 42: Hoare triple {2820#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2820#false} is VALID [2018-11-14 18:59:26,366 INFO L256 TraceCheckUtils]: 43: Hoare triple {2820#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2820#false} is VALID [2018-11-14 18:59:26,366 INFO L273 TraceCheckUtils]: 44: Hoare triple {2820#false} ~cond := #in~cond; {2820#false} is VALID [2018-11-14 18:59:26,367 INFO L273 TraceCheckUtils]: 45: Hoare triple {2820#false} assume ~cond == 0; {2820#false} is VALID [2018-11-14 18:59:26,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {2820#false} assume !false; {2820#false} is VALID [2018-11-14 18:59:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 18:59:26,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:26,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 18:59:26,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-14 18:59:26,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:26,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:59:26,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:26,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:59:26,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:59:26,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:26,418 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 5 states. [2018-11-14 18:59:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:26,693 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2018-11-14 18:59:26,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:59:26,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-14 18:59:26,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-14 18:59:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-14 18:59:26,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2018-11-14 18:59:26,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:26,758 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:59:26,758 INFO L226 Difference]: Without dead ends: 98 [2018-11-14 18:59:26,759 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-14 18:59:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-14 18:59:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-11-14 18:59:26,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:26,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 85 states. [2018-11-14 18:59:26,851 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 85 states. [2018-11-14 18:59:26,851 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 85 states. [2018-11-14 18:59:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:26,856 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-11-14 18:59:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-14 18:59:26,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:26,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:26,857 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 98 states. [2018-11-14 18:59:26,857 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 98 states. [2018-11-14 18:59:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:26,861 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-11-14 18:59:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-14 18:59:26,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:26,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:26,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:26,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-14 18:59:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-14 18:59:26,865 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 47 [2018-11-14 18:59:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:26,865 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-14 18:59:26,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:59:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-14 18:59:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-14 18:59:26,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:26,866 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:26,866 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:26,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:26,867 INFO L82 PathProgramCache]: Analyzing trace with hash -405897153, now seen corresponding path program 7 times [2018-11-14 18:59:26,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:26,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:26,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:26,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:26,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:26,873 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:26,873 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:26,873 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-14 18:59:26,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:26,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:27,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {3472#true} call ULTIMATE.init(); {3472#true} is VALID [2018-11-14 18:59:27,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {3472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3472#true} is VALID [2018-11-14 18:59:27,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {3472#true} assume true; {3472#true} is VALID [2018-11-14 18:59:27,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3472#true} {3472#true} #77#return; {3472#true} is VALID [2018-11-14 18:59:27,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {3472#true} call #t~ret2 := main(); {3472#true} is VALID [2018-11-14 18:59:27,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {3472#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {3492#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:27,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {3492#(<= 1500 main_~n~0)} assume true; {3492#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:27,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {3492#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3499#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {3499#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {3499#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:27,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {3499#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3506#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:27,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {3506#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {3506#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:27,389 INFO L273 TraceCheckUtils]: 11: Hoare triple {3506#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:27,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {3513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {3513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:27,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {3513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3520#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:27,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {3520#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {3520#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:27,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {3520#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3527#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 18:59:27,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {3527#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {3527#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 18:59:27,444 INFO L273 TraceCheckUtils]: 17: Hoare triple {3527#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3534#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 18:59:27,444 INFO L273 TraceCheckUtils]: 18: Hoare triple {3534#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {3534#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 18:59:27,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {3534#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !(~j~0 < ~n~0); {3473#false} is VALID [2018-11-14 18:59:27,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {3473#false} ~i~0 := ~i~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {3473#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3473#false} is VALID [2018-11-14 18:59:27,446 INFO L273 TraceCheckUtils]: 23: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,447 INFO L273 TraceCheckUtils]: 25: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,448 INFO L273 TraceCheckUtils]: 34: Hoare triple {3473#false} assume !(~j~0 < ~n~0); {3473#false} is VALID [2018-11-14 18:59:27,448 INFO L273 TraceCheckUtils]: 35: Hoare triple {3473#false} ~i~0 := ~i~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,449 INFO L273 TraceCheckUtils]: 37: Hoare triple {3473#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3473#false} is VALID [2018-11-14 18:59:27,449 INFO L273 TraceCheckUtils]: 38: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,449 INFO L273 TraceCheckUtils]: 41: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,450 INFO L273 TraceCheckUtils]: 42: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,450 INFO L273 TraceCheckUtils]: 43: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,450 INFO L273 TraceCheckUtils]: 44: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,450 INFO L273 TraceCheckUtils]: 45: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,450 INFO L273 TraceCheckUtils]: 46: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,450 INFO L273 TraceCheckUtils]: 47: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,451 INFO L273 TraceCheckUtils]: 48: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,451 INFO L273 TraceCheckUtils]: 49: Hoare triple {3473#false} assume !(~j~0 < ~n~0); {3473#false} is VALID [2018-11-14 18:59:27,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {3473#false} ~i~0 := ~i~0 + 1; {3473#false} is VALID [2018-11-14 18:59:27,451 INFO L273 TraceCheckUtils]: 51: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {3473#false} assume !(~i~0 < ~m~0); {3473#false} is VALID [2018-11-14 18:59:27,452 INFO L273 TraceCheckUtils]: 53: Hoare triple {3473#false} ~i~0 := 0;~j~0 := 0; {3473#false} is VALID [2018-11-14 18:59:27,452 INFO L273 TraceCheckUtils]: 54: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,452 INFO L273 TraceCheckUtils]: 55: Hoare triple {3473#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3473#false} is VALID [2018-11-14 18:59:27,452 INFO L273 TraceCheckUtils]: 56: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-14 18:59:27,453 INFO L273 TraceCheckUtils]: 57: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {3473#false} is VALID [2018-11-14 18:59:27,453 INFO L256 TraceCheckUtils]: 58: Hoare triple {3473#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {3473#false} is VALID [2018-11-14 18:59:27,453 INFO L273 TraceCheckUtils]: 59: Hoare triple {3473#false} ~cond := #in~cond; {3473#false} is VALID [2018-11-14 18:59:27,453 INFO L273 TraceCheckUtils]: 60: Hoare triple {3473#false} assume ~cond == 0; {3473#false} is VALID [2018-11-14 18:59:27,453 INFO L273 TraceCheckUtils]: 61: Hoare triple {3473#false} assume !false; {3473#false} is VALID [2018-11-14 18:59:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 150 proven. 30 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-14 18:59:27,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:27,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-14 18:59:27,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-11-14 18:59:27,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:27,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:59:27,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:27,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:59:27,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:59:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:59:27,549 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 9 states. [2018-11-14 18:59:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:28,095 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-11-14 18:59:28,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:59:28,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-11-14 18:59:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:59:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2018-11-14 18:59:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:59:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2018-11-14 18:59:28,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2018-11-14 18:59:28,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:28,245 INFO L225 Difference]: With dead ends: 164 [2018-11-14 18:59:28,245 INFO L226 Difference]: Without dead ends: 99 [2018-11-14 18:59:28,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:59:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-14 18:59:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-14 18:59:28,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:28,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 95 states. [2018-11-14 18:59:28,448 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 95 states. [2018-11-14 18:59:28,448 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 95 states. [2018-11-14 18:59:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:28,454 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-11-14 18:59:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-11-14 18:59:28,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:28,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:28,455 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 99 states. [2018-11-14 18:59:28,455 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 99 states. [2018-11-14 18:59:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:28,458 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-11-14 18:59:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-11-14 18:59:28,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:28,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:28,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:28,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 18:59:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2018-11-14 18:59:28,462 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 62 [2018-11-14 18:59:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:28,463 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2018-11-14 18:59:28,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:59:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2018-11-14 18:59:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-14 18:59:28,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:28,464 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:28,464 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:28,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash 128593317, now seen corresponding path program 8 times [2018-11-14 18:59:28,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:28,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:28,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:28,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:28,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:28,470 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:28,471 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:28,471 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-14 18:59:28,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:59:28,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:59:28,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:28,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:28,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-14 18:59:28,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {4241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4241#true} is VALID [2018-11-14 18:59:28,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-14 18:59:28,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4241#true} {4241#true} #77#return; {4241#true} is VALID [2018-11-14 18:59:28,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {4241#true} call #t~ret2 := main(); {4241#true} is VALID [2018-11-14 18:59:28,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {4241#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {4261#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:28,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {4261#(<= 1500 main_~n~0)} assume true; {4261#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:28,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {4261#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4268#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:28,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {4268#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4268#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:28,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {4268#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4275#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:28,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {4275#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {4275#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:28,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {4275#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4282#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:28,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {4282#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {4282#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:28,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {4282#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4289#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:28,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {4289#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {4289#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:28,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {4289#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4296#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 18:59:28,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {4296#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {4296#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 18:59:28,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {4296#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4303#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 18:59:28,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {4303#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {4303#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 18:59:28,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {4303#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4310#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-14 18:59:28,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {4310#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume true; {4310#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-14 18:59:28,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {4310#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !(~j~0 < ~n~0); {4242#false} is VALID [2018-11-14 18:59:28,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {4242#false} ~i~0 := ~i~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {4242#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4242#false} is VALID [2018-11-14 18:59:28,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,750 INFO L273 TraceCheckUtils]: 30: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,750 INFO L273 TraceCheckUtils]: 31: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,751 INFO L273 TraceCheckUtils]: 33: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,751 INFO L273 TraceCheckUtils]: 34: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,751 INFO L273 TraceCheckUtils]: 35: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,752 INFO L273 TraceCheckUtils]: 36: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,752 INFO L273 TraceCheckUtils]: 38: Hoare triple {4242#false} assume !(~j~0 < ~n~0); {4242#false} is VALID [2018-11-14 18:59:28,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {4242#false} ~i~0 := ~i~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {4242#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4242#false} is VALID [2018-11-14 18:59:28,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,753 INFO L273 TraceCheckUtils]: 44: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,754 INFO L273 TraceCheckUtils]: 45: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,754 INFO L273 TraceCheckUtils]: 46: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,755 INFO L273 TraceCheckUtils]: 50: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,755 INFO L273 TraceCheckUtils]: 52: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,755 INFO L273 TraceCheckUtils]: 54: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,756 INFO L273 TraceCheckUtils]: 55: Hoare triple {4242#false} assume !(~j~0 < ~n~0); {4242#false} is VALID [2018-11-14 18:59:28,756 INFO L273 TraceCheckUtils]: 56: Hoare triple {4242#false} ~i~0 := ~i~0 + 1; {4242#false} is VALID [2018-11-14 18:59:28,756 INFO L273 TraceCheckUtils]: 57: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {4242#false} assume !(~i~0 < ~m~0); {4242#false} is VALID [2018-11-14 18:59:28,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {4242#false} ~i~0 := 0;~j~0 := 0; {4242#false} is VALID [2018-11-14 18:59:28,757 INFO L273 TraceCheckUtils]: 60: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,757 INFO L273 TraceCheckUtils]: 61: Hoare triple {4242#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4242#false} is VALID [2018-11-14 18:59:28,757 INFO L273 TraceCheckUtils]: 62: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-14 18:59:28,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4242#false} is VALID [2018-11-14 18:59:28,757 INFO L256 TraceCheckUtils]: 64: Hoare triple {4242#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {4242#false} is VALID [2018-11-14 18:59:28,758 INFO L273 TraceCheckUtils]: 65: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-14 18:59:28,758 INFO L273 TraceCheckUtils]: 66: Hoare triple {4242#false} assume ~cond == 0; {4242#false} is VALID [2018-11-14 18:59:28,758 INFO L273 TraceCheckUtils]: 67: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-14 18:59:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 202 proven. 42 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-11-14 18:59:28,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:28,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-14 18:59:28,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-11-14 18:59:28,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:28,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:59:28,823 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-14 18:59:28,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:59:28,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:59:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:59:28,825 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 10 states. [2018-11-14 18:59:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:29,257 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2018-11-14 18:59:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:59:29,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-11-14 18:59:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:59:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-14 18:59:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:59:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-14 18:59:29,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 105 transitions. [2018-11-14 18:59:29,388 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-14 18:59:29,391 INFO L225 Difference]: With dead ends: 182 [2018-11-14 18:59:29,391 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 18:59:29,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:59:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 18:59:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-14 18:59:29,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:29,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 105 states. [2018-11-14 18:59:29,517 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 105 states. [2018-11-14 18:59:29,517 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 105 states. [2018-11-14 18:59:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:29,521 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-14 18:59:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2018-11-14 18:59:29,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:29,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:29,522 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 109 states. [2018-11-14 18:59:29,522 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 109 states. [2018-11-14 18:59:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:29,526 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-14 18:59:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2018-11-14 18:59:29,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:29,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:29,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:29,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 18:59:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-11-14 18:59:29,530 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 68 [2018-11-14 18:59:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:29,530 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-11-14 18:59:29,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:59:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-11-14 18:59:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 18:59:29,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:29,531 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:29,531 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:29,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1432848757, now seen corresponding path program 9 times [2018-11-14 18:59:29,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:29,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:29,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:29,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:29,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:29,538 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:29,538 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:29,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:29,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:59:29,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 18:59:29,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:29,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:29,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {5091#true} call ULTIMATE.init(); {5091#true} is VALID [2018-11-14 18:59:29,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {5091#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5091#true} is VALID [2018-11-14 18:59:29,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {5091#true} assume true; {5091#true} is VALID [2018-11-14 18:59:29,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5091#true} {5091#true} #77#return; {5091#true} is VALID [2018-11-14 18:59:29,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {5091#true} call #t~ret2 := main(); {5091#true} is VALID [2018-11-14 18:59:29,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {5091#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {5111#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {5111#(<= 1500 main_~n~0)} ~i~0 := ~i~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,983 INFO L273 TraceCheckUtils]: 30: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,988 INFO L273 TraceCheckUtils]: 34: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,988 INFO L273 TraceCheckUtils]: 35: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,989 INFO L273 TraceCheckUtils]: 36: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,989 INFO L273 TraceCheckUtils]: 37: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,990 INFO L273 TraceCheckUtils]: 38: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,990 INFO L273 TraceCheckUtils]: 39: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,991 INFO L273 TraceCheckUtils]: 41: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,991 INFO L273 TraceCheckUtils]: 42: Hoare triple {5111#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,992 INFO L273 TraceCheckUtils]: 43: Hoare triple {5111#(<= 1500 main_~n~0)} ~i~0 := ~i~0 + 1; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,992 INFO L273 TraceCheckUtils]: 44: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:29,993 INFO L273 TraceCheckUtils]: 45: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5232#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:29,994 INFO L273 TraceCheckUtils]: 46: Hoare triple {5232#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {5232#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:29,995 INFO L273 TraceCheckUtils]: 47: Hoare triple {5232#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:29,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {5239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {5239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:29,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {5239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5246#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:29,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {5246#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {5246#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:29,999 INFO L273 TraceCheckUtils]: 51: Hoare triple {5246#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5253#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:30,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {5253#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {5253#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:30,001 INFO L273 TraceCheckUtils]: 53: Hoare triple {5253#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5260#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 18:59:30,002 INFO L273 TraceCheckUtils]: 54: Hoare triple {5260#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {5260#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 18:59:30,003 INFO L273 TraceCheckUtils]: 55: Hoare triple {5260#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5267#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 18:59:30,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {5267#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {5267#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 18:59:30,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {5267#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5274#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-14 18:59:30,006 INFO L273 TraceCheckUtils]: 58: Hoare triple {5274#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume true; {5274#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-14 18:59:30,007 INFO L273 TraceCheckUtils]: 59: Hoare triple {5274#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~j~0 := ~j~0 + 1; {5281#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-14 18:59:30,007 INFO L273 TraceCheckUtils]: 60: Hoare triple {5281#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume true; {5281#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-14 18:59:30,008 INFO L273 TraceCheckUtils]: 61: Hoare triple {5281#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !(~j~0 < ~n~0); {5092#false} is VALID [2018-11-14 18:59:30,009 INFO L273 TraceCheckUtils]: 62: Hoare triple {5092#false} ~i~0 := ~i~0 + 1; {5092#false} is VALID [2018-11-14 18:59:30,009 INFO L273 TraceCheckUtils]: 63: Hoare triple {5092#false} assume true; {5092#false} is VALID [2018-11-14 18:59:30,009 INFO L273 TraceCheckUtils]: 64: Hoare triple {5092#false} assume !(~i~0 < ~m~0); {5092#false} is VALID [2018-11-14 18:59:30,009 INFO L273 TraceCheckUtils]: 65: Hoare triple {5092#false} ~i~0 := 0;~j~0 := 0; {5092#false} is VALID [2018-11-14 18:59:30,010 INFO L273 TraceCheckUtils]: 66: Hoare triple {5092#false} assume true; {5092#false} is VALID [2018-11-14 18:59:30,010 INFO L273 TraceCheckUtils]: 67: Hoare triple {5092#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5092#false} is VALID [2018-11-14 18:59:30,011 INFO L273 TraceCheckUtils]: 68: Hoare triple {5092#false} assume true; {5092#false} is VALID [2018-11-14 18:59:30,011 INFO L273 TraceCheckUtils]: 69: Hoare triple {5092#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5092#false} is VALID [2018-11-14 18:59:30,011 INFO L256 TraceCheckUtils]: 70: Hoare triple {5092#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {5092#false} is VALID [2018-11-14 18:59:30,011 INFO L273 TraceCheckUtils]: 71: Hoare triple {5092#false} ~cond := #in~cond; {5092#false} is VALID [2018-11-14 18:59:30,012 INFO L273 TraceCheckUtils]: 72: Hoare triple {5092#false} assume ~cond == 0; {5092#false} is VALID [2018-11-14 18:59:30,012 INFO L273 TraceCheckUtils]: 73: Hoare triple {5092#false} assume !false; {5092#false} is VALID [2018-11-14 18:59:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 264 proven. 56 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-14 18:59:30,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:30,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-14 18:59:30,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-14 18:59:30,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:30,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:59:30,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:30,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:59:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:59:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:59:30,087 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 11 states. [2018-11-14 18:59:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:30,733 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2018-11-14 18:59:30,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:59:30,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-14 18:59:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:59:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-14 18:59:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:59:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-14 18:59:30,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2018-11-14 18:59:31,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:31,667 INFO L225 Difference]: With dead ends: 200 [2018-11-14 18:59:31,668 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 18:59:31,668 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:59:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 18:59:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-11-14 18:59:31,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:31,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 115 states. [2018-11-14 18:59:31,790 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 115 states. [2018-11-14 18:59:31,790 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 115 states. [2018-11-14 18:59:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:31,794 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-11-14 18:59:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2018-11-14 18:59:31,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:31,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:31,795 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 119 states. [2018-11-14 18:59:31,795 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 119 states. [2018-11-14 18:59:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:31,798 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-11-14 18:59:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2018-11-14 18:59:31,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:31,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:31,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:31,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-14 18:59:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-11-14 18:59:31,803 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 74 [2018-11-14 18:59:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:31,803 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-11-14 18:59:31,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:59:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-11-14 18:59:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-14 18:59:31,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:31,804 INFO L375 BasicCegarLoop]: trace histogram [27, 24, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:31,805 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:31,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash -138396943, now seen corresponding path program 10 times [2018-11-14 18:59:31,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:31,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:31,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:31,811 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:31,812 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:31,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:31,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST