java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/max-3-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:28,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:28,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:28,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:28,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:28,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:28,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:28,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:28,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:28,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:28,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:28,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:28,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:28,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:28,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:28,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:28,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:28,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:28,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:28,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:28,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:28,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:28,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:28,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:28,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:28,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:28,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:28,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:28,328 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:28,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:28,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:28,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:28,333 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:28,333 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:28,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:28,335 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:28,336 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:34:28,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:28,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:28,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:28,366 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:28,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:28,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:28,368 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:28,368 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:28,368 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:28,368 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:28,368 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:28,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:28,369 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:28,369 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:28,369 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:28,369 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:28,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:28,371 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:28,371 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:28,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:28,372 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:28,372 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:28,372 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:28,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:28,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:28,373 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:28,373 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:28,373 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:28,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:28,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:28,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:28,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:28,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:28,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:28,448 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:28,448 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:28,449 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/max-3-n-u_true-unreach-call.i [2018-11-23 12:34:28,511 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a33310a/4d0cfbf7f8454458958680e60700d7e4/FLAGa71c47679 [2018-11-23 12:34:28,922 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:28,923 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/max-3-n-u_true-unreach-call.i [2018-11-23 12:34:28,930 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a33310a/4d0cfbf7f8454458958680e60700d7e4/FLAGa71c47679 [2018-11-23 12:34:29,293 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a33310a/4d0cfbf7f8454458958680e60700d7e4 [2018-11-23 12:34:29,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:29,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:29,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:29,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:29,308 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:29,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c08b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29, skipping insertion in model container [2018-11-23 12:34:29,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:29,354 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:29,619 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:29,625 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:29,668 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:29,689 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:29,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29 WrapperNode [2018-11-23 12:34:29,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:29,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:29,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:29,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:29,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:29,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:29,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:29,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:29,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... [2018-11-23 12:34:29,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:29,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:29,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:29,753 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:29,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:29,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:29,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:29,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:29,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:29,884 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:30,814 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:30,815 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 12:34:30,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:30 BoogieIcfgContainer [2018-11-23 12:34:30,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:30,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:30,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:30,819 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:30,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:34:29" (1/3) ... [2018-11-23 12:34:30,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0fa2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:30, skipping insertion in model container [2018-11-23 12:34:30,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:29" (2/3) ... [2018-11-23 12:34:30,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0fa2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:30, skipping insertion in model container [2018-11-23 12:34:30,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:30" (3/3) ... [2018-11-23 12:34:30,823 INFO L112 eAbstractionObserver]: Analyzing ICFG max-3-n-u_true-unreach-call.i [2018-11-23 12:34:30,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:30,841 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:30,859 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:30,890 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:30,891 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:30,891 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:30,891 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:30,892 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:30,892 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:30,892 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:30,892 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:30,892 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 12:34:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:34:30,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:30,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:30,923 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:30,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1187401570, now seen corresponding path program 1 times [2018-11-23 12:34:30,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:30,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:30,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:30,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:30,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:31,006 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:31,006 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:31,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:31,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:31,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:31,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-23 12:34:31,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41#true} is VALID [2018-11-23 12:34:31,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-23 12:34:31,160 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #145#return; {41#true} is VALID [2018-11-23 12:34:31,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2018-11-23 12:34:31,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {41#true} is VALID [2018-11-23 12:34:31,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-23 12:34:31,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {42#false} is VALID [2018-11-23 12:34:31,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#false} assume !(~i~0 < ~m~0); {42#false} is VALID [2018-11-23 12:34:31,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {42#false} is VALID [2018-11-23 12:34:31,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {42#false} is VALID [2018-11-23 12:34:31,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {42#false} is VALID [2018-11-23 12:34:31,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {42#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {42#false} is VALID [2018-11-23 12:34:31,165 INFO L256 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {42#false} is VALID [2018-11-23 12:34:31,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2018-11-23 12:34:31,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2018-11-23 12:34:31,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-23 12:34:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:31,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:31,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:34:31,204 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:34:31,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:31,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:34:31,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:31,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:34:31,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:34:31,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:31,274 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-23 12:34:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:31,483 INFO L93 Difference]: Finished difference Result 70 states and 109 transitions. [2018-11-23 12:34:31,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:34:31,484 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:34:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2018-11-23 12:34:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2018-11-23 12:34:31,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 109 transitions. [2018-11-23 12:34:32,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:32,404 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:34:32,404 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:34:32,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:34:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 12:34:32,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:32,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 12:34:32,460 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 12:34:32,460 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 12:34:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:32,465 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-23 12:34:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-23 12:34:32,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:32,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:32,467 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 12:34:32,467 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 12:34:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:32,473 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-23 12:34:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-23 12:34:32,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:32,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:32,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:32,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:34:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2018-11-23 12:34:32,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2018-11-23 12:34:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:32,480 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-11-23 12:34:32,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:34:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-23 12:34:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:34:32,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:32,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:32,482 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:32,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:32,483 INFO L82 PathProgramCache]: Analyzing trace with hash -738632508, now seen corresponding path program 1 times [2018-11-23 12:34:32,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:32,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:32,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:32,492 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:32,492 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:32,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:32,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:32,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:32,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2018-11-23 12:34:32,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {303#true} is VALID [2018-11-23 12:34:32,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2018-11-23 12:34:32,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #145#return; {303#true} is VALID [2018-11-23 12:34:32,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret5 := main(); {303#true} is VALID [2018-11-23 12:34:32,823 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {323#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:32,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {323#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {304#false} is VALID [2018-11-23 12:34:32,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {304#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {304#false} is VALID [2018-11-23 12:34:32,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {304#false} assume !(~i~0 < ~m~0); {304#false} is VALID [2018-11-23 12:34:32,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {304#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {304#false} is VALID [2018-11-23 12:34:32,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {304#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {304#false} is VALID [2018-11-23 12:34:32,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {304#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {304#false} is VALID [2018-11-23 12:34:32,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {304#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {304#false} is VALID [2018-11-23 12:34:32,826 INFO L256 TraceCheckUtils]: 13: Hoare triple {304#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {304#false} is VALID [2018-11-23 12:34:32,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2018-11-23 12:34:32,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2018-11-23 12:34:32,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {304#false} assume !false; {304#false} is VALID [2018-11-23 12:34:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:32,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:32,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:34:32,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:34:32,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:32,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:34:32,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:32,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:34:32,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:34:32,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:32,932 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 3 states. [2018-11-23 12:34:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,234 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2018-11-23 12:34:33,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:34:33,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:34:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 12:34:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 12:34:33,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-23 12:34:33,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:33,426 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:34:33,426 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:34:33,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:33,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:34:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-23 12:34:33,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:33,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2018-11-23 12:34:33,447 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2018-11-23 12:34:33,447 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2018-11-23 12:34:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,451 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 12:34:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 12:34:33,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:33,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:33,452 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2018-11-23 12:34:33,452 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2018-11-23 12:34:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:33,456 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 12:34:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 12:34:33,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:33,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:33,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:33,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:34:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-23 12:34:33,460 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2018-11-23 12:34:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:33,460 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-23 12:34:33,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:34:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 12:34:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:34:33,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:33,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:33,462 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:33,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:33,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1951122805, now seen corresponding path program 1 times [2018-11-23 12:34:33,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:33,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:33,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:33,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:33,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:33,471 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:33,471 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:33,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:33,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:33,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:33,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2018-11-23 12:34:33,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {568#true} is VALID [2018-11-23 12:34:33,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 12:34:33,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {568#true} {568#true} #145#return; {568#true} is VALID [2018-11-23 12:34:33,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {568#true} call #t~ret5 := main(); {568#true} is VALID [2018-11-23 12:34:33,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {568#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {588#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:33,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {588#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {592#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:33,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {592#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {569#false} is VALID [2018-11-23 12:34:33,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {569#false} ~i~0 := 1 + ~i~0; {569#false} is VALID [2018-11-23 12:34:33,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {569#false} assume !(~i~0 < ~m~0); {569#false} is VALID [2018-11-23 12:34:33,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {569#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {569#false} is VALID [2018-11-23 12:34:33,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {569#false} assume !(~i~0 < ~m~0); {569#false} is VALID [2018-11-23 12:34:33,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {569#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {569#false} is VALID [2018-11-23 12:34:33,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {569#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {569#false} is VALID [2018-11-23 12:34:33,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {569#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {569#false} is VALID [2018-11-23 12:34:33,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {569#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {569#false} is VALID [2018-11-23 12:34:33,622 INFO L256 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {569#false} is VALID [2018-11-23 12:34:33,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2018-11-23 12:34:33,622 INFO L273 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2018-11-23 12:34:33,622 INFO L273 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2018-11-23 12:34:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:33,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:33,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:33,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:34:33,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:33,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:33,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:33,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:33,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:33,683 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 4 states. [2018-11-23 12:34:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:34,163 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2018-11-23 12:34:34,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:34,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 12:34:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2018-11-23 12:34:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2018-11-23 12:34:34,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 104 transitions. [2018-11-23 12:34:34,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:34,323 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:34:34,323 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:34:34,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:34:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2018-11-23 12:34:34,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:34,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 37 states. [2018-11-23 12:34:34,376 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 37 states. [2018-11-23 12:34:34,377 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 37 states. [2018-11-23 12:34:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:34,381 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 12:34:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2018-11-23 12:34:34,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:34,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:34,383 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 50 states. [2018-11-23 12:34:34,383 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 50 states. [2018-11-23 12:34:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:34,387 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 12:34:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2018-11-23 12:34:34,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:34,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:34,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:34,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:34:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2018-11-23 12:34:34,390 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 20 [2018-11-23 12:34:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:34,391 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-11-23 12:34:34,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 12:34:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:34:34,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:34,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:34,392 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:34,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash 271293506, now seen corresponding path program 1 times [2018-11-23 12:34:34,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:34,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:34,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:34,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:34,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:34,401 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:34,401 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:34,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:34,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:34,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-23 12:34:34,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-23 12:34:34,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-23 12:34:34,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #145#return; {900#true} is VALID [2018-11-23 12:34:34,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2018-11-23 12:34:34,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {920#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:34,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {920#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {920#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:34,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {920#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {927#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:34,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {927#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {901#false} is VALID [2018-11-23 12:34:34,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {901#false} ~j~0 := 1 + ~j~0; {901#false} is VALID [2018-11-23 12:34:34,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {901#false} assume !(~j~0 < ~n~0); {901#false} is VALID [2018-11-23 12:34:34,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {901#false} ~i~0 := 1 + ~i~0; {901#false} is VALID [2018-11-23 12:34:34,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {901#false} assume !(~i~0 < ~m~0); {901#false} is VALID [2018-11-23 12:34:34,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {901#false} is VALID [2018-11-23 12:34:34,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {901#false} assume !(~i~0 < ~m~0); {901#false} is VALID [2018-11-23 12:34:34,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {901#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {901#false} is VALID [2018-11-23 12:34:34,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {901#false} is VALID [2018-11-23 12:34:34,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {901#false} is VALID [2018-11-23 12:34:34,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {901#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {901#false} is VALID [2018-11-23 12:34:34,534 INFO L256 TraceCheckUtils]: 19: Hoare triple {901#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {901#false} is VALID [2018-11-23 12:34:34,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID [2018-11-23 12:34:34,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#false} assume 0 == ~cond; {901#false} is VALID [2018-11-23 12:34:34,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-23 12:34:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:34,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:34,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:34,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:34:34,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:34,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:34,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:34,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:34,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:34,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:34,580 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 4 states. [2018-11-23 12:34:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:34,917 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2018-11-23 12:34:34,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:34,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 12:34:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2018-11-23 12:34:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2018-11-23 12:34:34,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 98 transitions. [2018-11-23 12:34:35,037 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-23 12:34:35,040 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:34:35,040 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:34:35,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:34:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-11-23 12:34:35,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:35,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 40 states. [2018-11-23 12:34:35,155 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 40 states. [2018-11-23 12:34:35,155 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 40 states. [2018-11-23 12:34:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,159 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 12:34:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 12:34:35,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:35,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:35,161 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 47 states. [2018-11-23 12:34:35,161 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 47 states. [2018-11-23 12:34:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,164 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 12:34:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 12:34:35,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:35,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:35,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:35,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:34:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-11-23 12:34:35,168 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 23 [2018-11-23 12:34:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:35,168 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-23 12:34:35,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-23 12:34:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:34:35,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:35,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:35,170 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:35,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2014780548, now seen corresponding path program 1 times [2018-11-23 12:34:35,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:35,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:35,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:35,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:35,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:35,178 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:35,178 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:35,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:35,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:35,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:35,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {1244#true} call ULTIMATE.init(); {1244#true} is VALID [2018-11-23 12:34:35,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {1244#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1244#true} is VALID [2018-11-23 12:34:35,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {1244#true} assume true; {1244#true} is VALID [2018-11-23 12:34:35,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1244#true} {1244#true} #145#return; {1244#true} is VALID [2018-11-23 12:34:35,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {1244#true} call #t~ret5 := main(); {1244#true} is VALID [2018-11-23 12:34:35,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {1244#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1264#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:35,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {1264#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1264#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:35,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {1264#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1271#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:35,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {1271#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1275#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:35,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {1275#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !(~k~0 < ~p~0); {1245#false} is VALID [2018-11-23 12:34:35,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {1245#false} ~j~0 := 1 + ~j~0; {1245#false} is VALID [2018-11-23 12:34:35,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {1245#false} assume !(~j~0 < ~n~0); {1245#false} is VALID [2018-11-23 12:34:35,415 INFO L273 TraceCheckUtils]: 12: Hoare triple {1245#false} ~i~0 := 1 + ~i~0; {1245#false} is VALID [2018-11-23 12:34:35,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {1245#false} assume !(~i~0 < ~m~0); {1245#false} is VALID [2018-11-23 12:34:35,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {1245#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {1245#false} is VALID [2018-11-23 12:34:35,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {1245#false} assume !(~i~0 < ~m~0); {1245#false} is VALID [2018-11-23 12:34:35,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {1245#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1245#false} is VALID [2018-11-23 12:34:35,417 INFO L273 TraceCheckUtils]: 17: Hoare triple {1245#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1245#false} is VALID [2018-11-23 12:34:35,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {1245#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1245#false} is VALID [2018-11-23 12:34:35,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {1245#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1245#false} is VALID [2018-11-23 12:34:35,418 INFO L256 TraceCheckUtils]: 20: Hoare triple {1245#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {1245#false} is VALID [2018-11-23 12:34:35,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {1245#false} ~cond := #in~cond; {1245#false} is VALID [2018-11-23 12:34:35,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {1245#false} assume 0 == ~cond; {1245#false} is VALID [2018-11-23 12:34:35,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {1245#false} assume !false; {1245#false} is VALID [2018-11-23 12:34:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:35,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:35,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:35,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:34:35,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:35,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:35,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:35,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:35,466 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 5 states. [2018-11-23 12:34:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:35,781 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2018-11-23 12:34:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:35,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 12:34:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2018-11-23 12:34:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2018-11-23 12:34:35,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 107 transitions. [2018-11-23 12:34:35,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:35,971 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:34:35,975 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:34:35,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:34:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-23 12:34:36,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:36,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 47 states. [2018-11-23 12:34:36,043 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 47 states. [2018-11-23 12:34:36,043 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 47 states. [2018-11-23 12:34:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:36,046 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-11-23 12:34:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2018-11-23 12:34:36,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:36,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:36,048 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states. [2018-11-23 12:34:36,048 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states. [2018-11-23 12:34:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:36,051 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-11-23 12:34:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2018-11-23 12:34:36,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:36,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:36,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:36,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:34:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-23 12:34:36,055 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 24 [2018-11-23 12:34:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:36,055 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-23 12:34:36,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 12:34:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:34:36,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:36,056 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:36,057 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:36,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash 131367810, now seen corresponding path program 2 times [2018-11-23 12:34:36,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:36,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:36,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:36,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:36,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:36,065 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:36,065 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:36,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:36,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:36,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:34:36,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:36,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:36,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {1634#true} call ULTIMATE.init(); {1634#true} is VALID [2018-11-23 12:34:36,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {1634#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1634#true} is VALID [2018-11-23 12:34:36,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {1634#true} assume true; {1634#true} is VALID [2018-11-23 12:34:36,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1634#true} {1634#true} #145#return; {1634#true} is VALID [2018-11-23 12:34:36,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {1634#true} call #t~ret5 := main(); {1634#true} is VALID [2018-11-23 12:34:36,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {1634#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {1654#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {1654#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {1654#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {1654#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,243 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {1654#(<= 1000 main_~m~0)} ~j~0 := 1 + ~j~0; {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {1654#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {1654#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {1654#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {1654#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:36,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {1654#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {1685#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:36,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {1685#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1635#false} is VALID [2018-11-23 12:34:36,247 INFO L273 TraceCheckUtils]: 17: Hoare triple {1635#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1635#false} is VALID [2018-11-23 12:34:36,247 INFO L273 TraceCheckUtils]: 18: Hoare triple {1635#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {1635#false} is VALID [2018-11-23 12:34:36,247 INFO L273 TraceCheckUtils]: 19: Hoare triple {1635#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1635#false} is VALID [2018-11-23 12:34:36,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {1635#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {1635#false} is VALID [2018-11-23 12:34:36,248 INFO L256 TraceCheckUtils]: 21: Hoare triple {1635#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {1635#false} is VALID [2018-11-23 12:34:36,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {1635#false} ~cond := #in~cond; {1635#false} is VALID [2018-11-23 12:34:36,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {1635#false} assume 0 == ~cond; {1635#false} is VALID [2018-11-23 12:34:36,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {1635#false} assume !false; {1635#false} is VALID [2018-11-23 12:34:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:34:36,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:36,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:36,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:34:36,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:36,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:36,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:36,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:36,313 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 4 states. [2018-11-23 12:34:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:36,830 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2018-11-23 12:34:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:36,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:34:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-23 12:34:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-23 12:34:36,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2018-11-23 12:34:36,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:36,941 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:34:36,941 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:34:36,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:34:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2018-11-23 12:34:37,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:37,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 48 states. [2018-11-23 12:34:37,092 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 48 states. [2018-11-23 12:34:37,093 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 48 states. [2018-11-23 12:34:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:37,096 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2018-11-23 12:34:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2018-11-23 12:34:37,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:37,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:37,098 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 78 states. [2018-11-23 12:34:37,098 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 78 states. [2018-11-23 12:34:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:37,101 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2018-11-23 12:34:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2018-11-23 12:34:37,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:37,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:37,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:37,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:34:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 12:34:37,105 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 25 [2018-11-23 12:34:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:37,105 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 12:34:37,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 12:34:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:34:37,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:37,107 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:37,107 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:37,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1605521934, now seen corresponding path program 1 times [2018-11-23 12:34:37,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:37,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:37,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:37,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:37,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:37,116 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:37,116 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:37,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:37,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:37,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:37,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2018-11-23 12:34:37,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {2094#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2094#true} is VALID [2018-11-23 12:34:37,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2018-11-23 12:34:37,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #145#return; {2094#true} is VALID [2018-11-23 12:34:37,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret5 := main(); {2094#true} is VALID [2018-11-23 12:34:37,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {2094#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {2114#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:37,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {2114#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2114#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:37,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {2114#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2121#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:37,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {2121#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2125#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:37,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {2125#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2129#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:37,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {2129#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !(~k~0 < ~p~0); {2095#false} is VALID [2018-11-23 12:34:37,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {2095#false} ~j~0 := 1 + ~j~0; {2095#false} is VALID [2018-11-23 12:34:37,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {2095#false} assume !(~j~0 < ~n~0); {2095#false} is VALID [2018-11-23 12:34:37,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {2095#false} ~i~0 := 1 + ~i~0; {2095#false} is VALID [2018-11-23 12:34:37,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {2095#false} assume !(~i~0 < ~m~0); {2095#false} is VALID [2018-11-23 12:34:37,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {2095#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {2095#false} is VALID [2018-11-23 12:34:37,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {2095#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2095#false} is VALID [2018-11-23 12:34:37,655 INFO L273 TraceCheckUtils]: 17: Hoare triple {2095#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2095#false} is VALID [2018-11-23 12:34:37,655 INFO L273 TraceCheckUtils]: 18: Hoare triple {2095#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2095#false} is VALID [2018-11-23 12:34:37,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {2095#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2095#false} is VALID [2018-11-23 12:34:37,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {2095#false} ~k~0 := 1 + ~k~0; {2095#false} is VALID [2018-11-23 12:34:37,656 INFO L273 TraceCheckUtils]: 21: Hoare triple {2095#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2095#false} is VALID [2018-11-23 12:34:37,656 INFO L273 TraceCheckUtils]: 22: Hoare triple {2095#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2095#false} is VALID [2018-11-23 12:34:37,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {2095#false} ~k~0 := 1 + ~k~0; {2095#false} is VALID [2018-11-23 12:34:37,656 INFO L273 TraceCheckUtils]: 24: Hoare triple {2095#false} assume !(~k~0 < ~p~0); {2095#false} is VALID [2018-11-23 12:34:37,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {2095#false} ~j~0 := 1 + ~j~0; {2095#false} is VALID [2018-11-23 12:34:37,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {2095#false} assume !(~j~0 < ~n~0); {2095#false} is VALID [2018-11-23 12:34:37,657 INFO L273 TraceCheckUtils]: 27: Hoare triple {2095#false} ~i~0 := 1 + ~i~0; {2095#false} is VALID [2018-11-23 12:34:37,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {2095#false} assume !(~i~0 < ~m~0); {2095#false} is VALID [2018-11-23 12:34:37,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {2095#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2095#false} is VALID [2018-11-23 12:34:37,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2095#false} is VALID [2018-11-23 12:34:37,657 INFO L273 TraceCheckUtils]: 31: Hoare triple {2095#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2095#false} is VALID [2018-11-23 12:34:37,658 INFO L273 TraceCheckUtils]: 32: Hoare triple {2095#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2095#false} is VALID [2018-11-23 12:34:37,658 INFO L256 TraceCheckUtils]: 33: Hoare triple {2095#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {2095#false} is VALID [2018-11-23 12:34:37,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2018-11-23 12:34:37,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2018-11-23 12:34:37,658 INFO L273 TraceCheckUtils]: 36: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2018-11-23 12:34:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:34:37,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:37,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:34:37,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 12:34:37,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:37,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:37,954 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-23 12:34:37,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:37,955 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 6 states. [2018-11-23 12:34:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:38,769 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2018-11-23 12:34:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:38,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-23 12:34:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-23 12:34:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-23 12:34:38,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2018-11-23 12:34:38,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:38,944 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:34:38,944 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:34:38,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:34:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-11-23 12:34:39,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:39,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 55 states. [2018-11-23 12:34:39,037 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 55 states. [2018-11-23 12:34:39,037 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 55 states. [2018-11-23 12:34:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:39,040 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 12:34:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:34:39,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:39,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:39,041 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 60 states. [2018-11-23 12:34:39,041 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 60 states. [2018-11-23 12:34:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:39,044 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 12:34:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:34:39,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:39,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:39,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:39,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:34:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2018-11-23 12:34:39,047 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 37 [2018-11-23 12:34:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:39,047 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2018-11-23 12:34:39,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-23 12:34:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:34:39,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:39,048 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:39,049 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:39,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash -675781077, now seen corresponding path program 2 times [2018-11-23 12:34:39,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:39,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:39,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:39,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:39,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:39,056 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:39,056 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:39,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:39,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:39,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:39,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:39,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:39,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {2572#true} call ULTIMATE.init(); {2572#true} is VALID [2018-11-23 12:34:39,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {2572#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2572#true} is VALID [2018-11-23 12:34:39,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2018-11-23 12:34:39,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2572#true} #145#return; {2572#true} is VALID [2018-11-23 12:34:39,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {2572#true} call #t~ret5 := main(); {2572#true} is VALID [2018-11-23 12:34:39,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {2572#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {2592#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:39,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {2592#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2592#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:39,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {2592#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2599#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:39,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {2599#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2603#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} is VALID [2018-11-23 12:34:39,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {2603#(and (<= 1800 main_~p~0) (<= main_~k~0 1))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2607#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} is VALID [2018-11-23 12:34:39,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {2607#(and (<= 1800 main_~p~0) (<= main_~k~0 2))} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {2611#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} is VALID [2018-11-23 12:34:39,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {2611#(and (<= 1800 main_~p~0) (<= main_~k~0 3))} assume !(~k~0 < ~p~0); {2573#false} is VALID [2018-11-23 12:34:39,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {2573#false} ~j~0 := 1 + ~j~0; {2573#false} is VALID [2018-11-23 12:34:39,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {2573#false} assume !(~j~0 < ~n~0); {2573#false} is VALID [2018-11-23 12:34:39,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {2573#false} ~i~0 := 1 + ~i~0; {2573#false} is VALID [2018-11-23 12:34:39,266 INFO L273 TraceCheckUtils]: 15: Hoare triple {2573#false} assume !(~i~0 < ~m~0); {2573#false} is VALID [2018-11-23 12:34:39,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {2573#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {2573#false} is VALID [2018-11-23 12:34:39,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {2573#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2573#false} is VALID [2018-11-23 12:34:39,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {2573#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2573#false} is VALID [2018-11-23 12:34:39,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {2573#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2573#false} is VALID [2018-11-23 12:34:39,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {2573#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2573#false} is VALID [2018-11-23 12:34:39,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {2573#false} ~k~0 := 1 + ~k~0; {2573#false} is VALID [2018-11-23 12:34:39,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {2573#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2573#false} is VALID [2018-11-23 12:34:39,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {2573#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2573#false} is VALID [2018-11-23 12:34:39,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {2573#false} ~k~0 := 1 + ~k~0; {2573#false} is VALID [2018-11-23 12:34:39,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {2573#false} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2573#false} is VALID [2018-11-23 12:34:39,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {2573#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {2573#false} is VALID [2018-11-23 12:34:39,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {2573#false} ~k~0 := 1 + ~k~0; {2573#false} is VALID [2018-11-23 12:34:39,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {2573#false} assume !(~k~0 < ~p~0); {2573#false} is VALID [2018-11-23 12:34:39,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {2573#false} ~j~0 := 1 + ~j~0; {2573#false} is VALID [2018-11-23 12:34:39,269 INFO L273 TraceCheckUtils]: 30: Hoare triple {2573#false} assume !(~j~0 < ~n~0); {2573#false} is VALID [2018-11-23 12:34:39,269 INFO L273 TraceCheckUtils]: 31: Hoare triple {2573#false} ~i~0 := 1 + ~i~0; {2573#false} is VALID [2018-11-23 12:34:39,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {2573#false} assume !(~i~0 < ~m~0); {2573#false} is VALID [2018-11-23 12:34:39,269 INFO L273 TraceCheckUtils]: 33: Hoare triple {2573#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2573#false} is VALID [2018-11-23 12:34:39,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {2573#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {2573#false} is VALID [2018-11-23 12:34:39,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {2573#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2573#false} is VALID [2018-11-23 12:34:39,270 INFO L273 TraceCheckUtils]: 36: Hoare triple {2573#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {2573#false} is VALID [2018-11-23 12:34:39,270 INFO L256 TraceCheckUtils]: 37: Hoare triple {2573#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {2573#false} is VALID [2018-11-23 12:34:39,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {2573#false} ~cond := #in~cond; {2573#false} is VALID [2018-11-23 12:34:39,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {2573#false} assume 0 == ~cond; {2573#false} is VALID [2018-11-23 12:34:39,271 INFO L273 TraceCheckUtils]: 40: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2018-11-23 12:34:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 12:34:39,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:39,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:34:39,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 12:34:39,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:39,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:34:39,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:39,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:34:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:34:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:39,331 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 7 states. [2018-11-23 12:34:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:39,818 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2018-11-23 12:34:39,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:34:39,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 12:34:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-11-23 12:34:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2018-11-23 12:34:39,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 123 transitions. [2018-11-23 12:34:40,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:40,019 INFO L225 Difference]: With dead ends: 115 [2018-11-23 12:34:40,019 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 12:34:40,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-23 12:34:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 12:34:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-23 12:34:40,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:40,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 62 states. [2018-11-23 12:34:40,175 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 62 states. [2018-11-23 12:34:40,175 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 62 states. [2018-11-23 12:34:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:40,179 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2018-11-23 12:34:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2018-11-23 12:34:40,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:40,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:40,180 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 67 states. [2018-11-23 12:34:40,180 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 67 states. [2018-11-23 12:34:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:40,185 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2018-11-23 12:34:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2018-11-23 12:34:40,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:40,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:40,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:40,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:34:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2018-11-23 12:34:40,188 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 41 [2018-11-23 12:34:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:40,189 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2018-11-23 12:34:40,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:34:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2018-11-23 12:34:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:34:40,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:40,189 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:40,190 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:40,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1399380910, now seen corresponding path program 3 times [2018-11-23 12:34:40,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:40,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:40,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:40,196 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:40,197 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:40,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:40,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:40,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:34:40,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:40,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:40,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {3110#true} call ULTIMATE.init(); {3110#true} is VALID [2018-11-23 12:34:40,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {3110#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3110#true} is VALID [2018-11-23 12:34:40,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {3110#true} assume true; {3110#true} is VALID [2018-11-23 12:34:40,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3110#true} {3110#true} #145#return; {3110#true} is VALID [2018-11-23 12:34:40,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {3110#true} call #t~ret5 := main(); {3110#true} is VALID [2018-11-23 12:34:40,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {3110#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~p~0 * ~n~0 * ~m~0);havoc ~max~0;~i~0 := 0;~j~0 := 0;~k~0 := 0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {3130#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {3130#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {3130#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {3130#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {3130#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {3130#(<= 1000 main_~m~0)} assume !!(~k~0 < ~p~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);havoc #t~nondet0;~k~0 := 1 + ~k~0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {3130#(<= 1000 main_~m~0)} assume !(~k~0 < ~p~0); {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {3130#(<= 1000 main_~m~0)} ~j~0 := 1 + ~j~0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {3130#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {3130#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {3130#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {3130#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:34:40,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {3130#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~max~0 := #t~mem1;havoc #t~mem1; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~k~0 := 1 + ~k~0; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~k~0 := 1 + ~k~0; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,408 INFO L273 TraceCheckUtils]: 28: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~k~0 := 1 + ~k~0; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,409 INFO L273 TraceCheckUtils]: 29: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,410 INFO L273 TraceCheckUtils]: 30: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4);~max~0 := #t~mem3;havoc #t~mem3; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~k~0 := 1 + ~k~0; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~k~0 < ~p~0); {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~j~0 := 1 + ~j~0; {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {3167#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {3222#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:40,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {3222#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {3111#false} is VALID [2018-11-23 12:34:40,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {3111#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3111#false} is VALID [2018-11-23 12:34:40,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0; {3111#false} is VALID [2018-11-23 12:34:40,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {3111#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3111#false} is VALID [2018-11-23 12:34:40,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#false} assume !!(~k~0 < ~p~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~p~0 * ~n~0) + ~j~0 * (4 * ~p~0) + 4 * ~k~0, 4); {3111#false} is VALID [2018-11-23 12:34:40,416 INFO L256 TraceCheckUtils]: 41: Hoare triple {3111#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {3111#false} is VALID [2018-11-23 12:34:40,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#false} ~cond := #in~cond; {3111#false} is VALID [2018-11-23 12:34:40,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#false} assume 0 == ~cond; {3111#false} is VALID [2018-11-23 12:34:40,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#false} assume !false; {3111#false} is VALID [2018-11-23 12:34:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 12:34:40,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:40,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:40,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:34:40,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:40,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:40,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:40,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:40,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:40,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:40,482 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 5 states. [2018-11-23 12:34:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:41,155 INFO L93 Difference]: Finished difference Result 197 states and 254 transitions. [2018-11-23 12:34:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:41,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:34:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2018-11-23 12:34:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2018-11-23 12:34:41,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 126 transitions. [2018-11-23 12:34:41,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:41,320 INFO L225 Difference]: With dead ends: 197 [2018-11-23 12:34:41,320 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 12:34:41,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 12:34:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2018-11-23 12:34:41,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:41,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 90 states. [2018-11-23 12:34:41,631 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 90 states. [2018-11-23 12:34:41,632 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 90 states. [2018-11-23 12:34:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:41,638 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2018-11-23 12:34:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2018-11-23 12:34:41,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:41,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:41,639 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 152 states. [2018-11-23 12:34:41,639 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 152 states. [2018-11-23 12:34:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:41,644 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2018-11-23 12:34:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2018-11-23 12:34:41,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:41,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:41,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:41,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 12:34:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2018-11-23 12:34:41,647 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 45 [2018-11-23 12:34:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:41,648 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2018-11-23 12:34:41,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2018-11-23 12:34:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:34:41,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:41,649 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:41,649 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:41,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1340791648, now seen corresponding path program 4 times [2018-11-23 12:34:41,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:41,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:41,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:41,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:41,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:41,656 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:41,657 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:41,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:41,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:41,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:41,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:41,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:42,034 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:42,035 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.derSimple(XnfDer.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.tryToEliminate(XnfDer.java:97) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.applyEliminationTechniques(QuantifierPusher.java:302) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:215) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$LiveVariablesPostprocessorForward.postprocess(TraceCheckSpWp.java:533) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:34:42,039 INFO L168 Benchmark]: Toolchain (without parser) took 12736.93 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 865.1 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -363.5 MB). Peak memory consumption was 501.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:42,041 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:42,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:42,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:42,042 INFO L168 Benchmark]: Boogie Preprocessor took 38.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:34:42,043 INFO L168 Benchmark]: RCFGBuilder took 1063.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:42,046 INFO L168 Benchmark]: TraceAbstraction took 11221.94 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.1 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 403.9 MB). Peak memory consumption was 525.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:42,050 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 385.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1063.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11221.94 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.1 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 403.9 MB). Peak memory consumption was 525.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...