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/init-4-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:11,453 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:11,456 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:11,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:11,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:11,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:11,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:11,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:11,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:11,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:11,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:11,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:11,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:11,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:11,480 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:11,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:11,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:11,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:11,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:11,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:11,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:11,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:11,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:11,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:11,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:11,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:11,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:11,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:11,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:11,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:11,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:11,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:11,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:11,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:11,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:11,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:11,501 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:11,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:11,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:11,535 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:11,535 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:11,536 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:11,536 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:11,536 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:11,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:11,537 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:11,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:11,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:11,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:11,538 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:11,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:11,538 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:11,539 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:11,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:11,539 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:11,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:11,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:11,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:11,541 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:11,541 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:11,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:11,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:11,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:11,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:11,542 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:11,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:11,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:11,543 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:11,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:11,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:11,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:11,634 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:11,634 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:11,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-4-n-u_true-unreach-call.i [2018-11-23 12:34:11,702 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf00c45b/41772d3b4eeb4a449fd275e6741dbe78/FLAG614f4151c [2018-11-23 12:34:12,184 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:12,185 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-4-n-u_true-unreach-call.i [2018-11-23 12:34:12,195 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf00c45b/41772d3b4eeb4a449fd275e6741dbe78/FLAG614f4151c [2018-11-23 12:34:12,540 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf00c45b/41772d3b4eeb4a449fd275e6741dbe78 [2018-11-23 12:34:12,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:12,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:12,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:12,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:12,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:12,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:12" (1/1) ... [2018-11-23 12:34:12,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50669a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:12, skipping insertion in model container [2018-11-23 12:34:12,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:12" (1/1) ... [2018-11-23 12:34:12,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:12,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:12,816 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:12,824 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:12,869 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:12,894 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:12,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:12 WrapperNode [2018-11-23 12:34:12,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:12,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:12,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:12,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:12,907 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:12" (1/1) ... [2018-11-23 12:34:12,920 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:12" (1/1) ... [2018-11-23 12:34:12,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:12,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:12,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:12,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:12,944 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:12" (1/1) ... [2018-11-23 12:34:12,944 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:12" (1/1) ... [2018-11-23 12:34:12,946 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:12" (1/1) ... [2018-11-23 12:34:12,948 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:12" (1/1) ... [2018-11-23 12:34:12,972 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:12" (1/1) ... [2018-11-23 12:34:12,987 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:12" (1/1) ... [2018-11-23 12:34:12,992 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:12" (1/1) ... [2018-11-23 12:34:13,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:13,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:13,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:13,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:13,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:12" (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:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:13,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:13,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:13,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:13,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:13,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:13,883 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:13,884 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:34:13,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:13 BoogieIcfgContainer [2018-11-23 12:34:13,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:13,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:13,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:13,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:13,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:34:12" (1/3) ... [2018-11-23 12:34:13,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29797a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:13, skipping insertion in model container [2018-11-23 12:34:13,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:12" (2/3) ... [2018-11-23 12:34:13,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29797a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:13, skipping insertion in model container [2018-11-23 12:34:13,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:13" (3/3) ... [2018-11-23 12:34:13,894 INFO L112 eAbstractionObserver]: Analyzing ICFG init-4-n-u_true-unreach-call.i [2018-11-23 12:34:13,903 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:13,910 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:13,927 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:13,973 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:13,974 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:13,974 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:13,974 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:13,975 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:13,975 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:13,975 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:13,975 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:13,975 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 12:34:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:34:14,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:14,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:14,002 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:14,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash -129587761, now seen corresponding path program 1 times [2018-11-23 12:34:14,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:14,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:14,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:14,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:14,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:14,092 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:14,092 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:14,092 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:14,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:14,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:14,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 12:34:14,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-23 12:34:14,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 12:34:14,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #125#return; {37#true} is VALID [2018-11-23 12:34:14,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret2 := main(); {37#true} is VALID [2018-11-23 12:34:14,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;~q~0 := 2000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~q~0 * ~p~0 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {37#true} is VALID [2018-11-23 12:34:14,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-23 12:34:14,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {38#false} is VALID [2018-11-23 12:34:14,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {38#false} is VALID [2018-11-23 12:34:14,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {38#false} is VALID [2018-11-23 12:34:14,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !!(~k~0 < ~p~0);~l~0 := 0; {38#false} is VALID [2018-11-23 12:34:14,410 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume !!(~l~0 < ~q~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4); {38#false} is VALID [2018-11-23 12:34:14,410 INFO L256 TraceCheckUtils]: 12: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {38#false} is VALID [2018-11-23 12:34:14,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-23 12:34:14,411 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-23 12:34:14,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 12:34:14,415 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:14,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:14,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:34:14,445 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:34:14,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:14,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:34:14,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:14,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:34:14,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:34:14,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:14,559 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 12:34:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:14,715 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2018-11-23 12:34:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:34:14,716 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:34:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-23 12:34:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:34:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-23 12:34:14,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 95 transitions. [2018-11-23 12:34:15,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:15,145 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:34:15,145 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:34:15,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:34:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:34:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 12:34:15,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:15,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 12:34:15,371 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:34:15,372 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:34:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,379 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 12:34:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 12:34:15,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:15,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:15,381 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:34:15,381 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:34:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:15,389 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 12:34:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 12:34:15,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:15,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:15,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:15,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:34:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 12:34:15,398 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2018-11-23 12:34:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:15,398 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 12:34:15,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:34:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 12:34:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:34:15,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:15,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:15,401 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:15,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash -269441638, now seen corresponding path program 1 times [2018-11-23 12:34:15,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:15,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:15,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:15,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:15,420 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:15,420 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:15,420 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:15,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:15,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:15,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2018-11-23 12:34:15,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {273#true} is VALID [2018-11-23 12:34:15,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2018-11-23 12:34:15,695 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #125#return; {273#true} is VALID [2018-11-23 12:34:15,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret2 := main(); {273#true} is VALID [2018-11-23 12:34:15,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {273#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;~q~0 := 2000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~q~0 * ~p~0 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {293#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:15,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {293#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {274#false} is VALID [2018-11-23 12:34:15,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {274#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {274#false} is VALID [2018-11-23 12:34:15,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {274#false} is VALID [2018-11-23 12:34:15,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {274#false} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {274#false} is VALID [2018-11-23 12:34:15,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {274#false} assume !!(~k~0 < ~p~0);~l~0 := 0; {274#false} is VALID [2018-11-23 12:34:15,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {274#false} assume !!(~l~0 < ~q~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4); {274#false} is VALID [2018-11-23 12:34:15,701 INFO L256 TraceCheckUtils]: 12: Hoare triple {274#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {274#false} is VALID [2018-11-23 12:34:15,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2018-11-23 12:34:15,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {274#false} assume 0 == ~cond; {274#false} is VALID [2018-11-23 12:34:15,702 INFO L273 TraceCheckUtils]: 15: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-11-23 12:34:15,704 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:15,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:15,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:34:15,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:34:15,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:15,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:34:15,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:15,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:34:15,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:34:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:15,819 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2018-11-23 12:34:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,238 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2018-11-23 12:34:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:34:16,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:34:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 12:34:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 12:34:16,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 12:34:16,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:16,402 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:34:16,402 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:34:16,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:34:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 12:34:16,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:16,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2018-11-23 12:34:16,429 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2018-11-23 12:34:16,429 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2018-11-23 12:34:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,433 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:34:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:34:16,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:16,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:16,434 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2018-11-23 12:34:16,434 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2018-11-23 12:34:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,437 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 12:34:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 12:34:16,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:16,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:16,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:16,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:34:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 12:34:16,442 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2018-11-23 12:34:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:16,442 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 12:34:16,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:34:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:34:16,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:16,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:16,444 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:16,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:16,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1901462552, now seen corresponding path program 1 times [2018-11-23 12:34:16,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:16,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:16,452 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:16,453 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:16,453 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:16,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:16,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:16,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2018-11-23 12:34:16,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {516#true} is VALID [2018-11-23 12:34:16,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2018-11-23 12:34:16,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #125#return; {516#true} is VALID [2018-11-23 12:34:16,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret2 := main(); {516#true} is VALID [2018-11-23 12:34:16,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {516#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;~q~0 := 2000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~q~0 * ~p~0 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {536#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:16,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {540#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:16,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {517#false} is VALID [2018-11-23 12:34:16,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {517#false} ~i~0 := 1 + ~i~0; {517#false} is VALID [2018-11-23 12:34:16,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {517#false} assume !(~i~0 < ~m~0); {517#false} is VALID [2018-11-23 12:34:16,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {517#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {517#false} is VALID [2018-11-23 12:34:16,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {517#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {517#false} is VALID [2018-11-23 12:34:16,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {517#false} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {517#false} is VALID [2018-11-23 12:34:16,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {517#false} assume !!(~k~0 < ~p~0);~l~0 := 0; {517#false} is VALID [2018-11-23 12:34:16,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#false} assume !!(~l~0 < ~q~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4); {517#false} is VALID [2018-11-23 12:34:16,633 INFO L256 TraceCheckUtils]: 15: Hoare triple {517#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {517#false} is VALID [2018-11-23 12:34:16,633 INFO L273 TraceCheckUtils]: 16: Hoare triple {517#false} ~cond := #in~cond; {517#false} is VALID [2018-11-23 12:34:16,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {517#false} assume 0 == ~cond; {517#false} is VALID [2018-11-23 12:34:16,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {517#false} assume !false; {517#false} is VALID [2018-11-23 12:34:16,635 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:16,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:16,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:16,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:34:16,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:16,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:16,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:16,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:16,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:16,723 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2018-11-23 12:34:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:16,952 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2018-11-23 12:34:16,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:16,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:34:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 12:34:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 12:34:16,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-23 12:34:17,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:17,233 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:34:17,233 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:34:17,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:34:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-11-23 12:34:17,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:17,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 32 states. [2018-11-23 12:34:17,273 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 32 states. [2018-11-23 12:34:17,274 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 32 states. [2018-11-23 12:34:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,279 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-23 12:34:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 12:34:17,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:17,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:17,280 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 43 states. [2018-11-23 12:34:17,280 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 43 states. [2018-11-23 12:34:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,284 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-23 12:34:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 12:34:17,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:17,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:17,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:17,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:34:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 12:34:17,290 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2018-11-23 12:34:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:17,291 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 12:34:17,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-23 12:34:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:34:17,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:17,292 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] [2018-11-23 12:34:17,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:17,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:17,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1769523126, now seen corresponding path program 1 times [2018-11-23 12:34:17,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:17,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:17,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:17,308 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:17,308 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:17,309 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:17,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:17,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:17,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {810#true} call ULTIMATE.init(); {810#true} is VALID [2018-11-23 12:34:17,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {810#true} is VALID [2018-11-23 12:34:17,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {810#true} assume true; {810#true} is VALID [2018-11-23 12:34:17,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {810#true} {810#true} #125#return; {810#true} is VALID [2018-11-23 12:34:17,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {810#true} call #t~ret2 := main(); {810#true} is VALID [2018-11-23 12:34:17,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {810#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;~q~0 := 2000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~q~0 * ~p~0 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {830#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:17,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {830#(<= 1800 main_~p~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {830#(<= 1800 main_~p~0)} is VALID [2018-11-23 12:34:17,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {830#(<= 1800 main_~p~0)} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {837#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} is VALID [2018-11-23 12:34:17,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {837#(and (<= 1800 main_~p~0) (<= main_~k~0 0))} assume !(~k~0 < ~p~0); {811#false} is VALID [2018-11-23 12:34:17,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {811#false} ~j~0 := 1 + ~j~0; {811#false} is VALID [2018-11-23 12:34:17,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {811#false} assume !(~j~0 < ~n~0); {811#false} is VALID [2018-11-23 12:34:17,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {811#false} ~i~0 := 1 + ~i~0; {811#false} is VALID [2018-11-23 12:34:17,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {811#false} assume !(~i~0 < ~m~0); {811#false} is VALID [2018-11-23 12:34:17,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {811#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {811#false} is VALID [2018-11-23 12:34:17,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {811#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {811#false} is VALID [2018-11-23 12:34:17,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {811#false} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {811#false} is VALID [2018-11-23 12:34:17,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {811#false} assume !!(~k~0 < ~p~0);~l~0 := 0; {811#false} is VALID [2018-11-23 12:34:17,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {811#false} assume !!(~l~0 < ~q~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4); {811#false} is VALID [2018-11-23 12:34:17,488 INFO L256 TraceCheckUtils]: 18: Hoare triple {811#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {811#false} is VALID [2018-11-23 12:34:17,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {811#false} ~cond := #in~cond; {811#false} is VALID [2018-11-23 12:34:17,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {811#false} assume 0 == ~cond; {811#false} is VALID [2018-11-23 12:34:17,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {811#false} assume !false; {811#false} is VALID [2018-11-23 12:34:17,490 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:17,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:17,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:17,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:34:17,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:17,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:17,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:17,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:17,549 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2018-11-23 12:34:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:17,895 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-23 12:34:17,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:17,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:34:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 12:34:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 12:34:17,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2018-11-23 12:34:18,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:18,103 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:34:18,103 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:34:18,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:34:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-11-23 12:34:18,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:18,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 34 states. [2018-11-23 12:34:18,161 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 34 states. [2018-11-23 12:34:18,161 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 34 states. [2018-11-23 12:34:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,164 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 12:34:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2018-11-23 12:34:18,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:18,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:18,165 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 41 states. [2018-11-23 12:34:18,166 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 41 states. [2018-11-23 12:34:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,168 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 12:34:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2018-11-23 12:34:18,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:18,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:18,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:18,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:34:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 12:34:18,172 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 22 [2018-11-23 12:34:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:18,172 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 12:34:18,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 12:34:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:34:18,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:18,174 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, 1] [2018-11-23 12:34:18,174 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:18,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash -914412998, now seen corresponding path program 1 times [2018-11-23 12:34:18,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:18,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:18,182 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:18,182 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:18,183 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:18,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:18,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:18,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2018-11-23 12:34:18,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {1115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1115#true} is VALID [2018-11-23 12:34:18,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2018-11-23 12:34:18,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #125#return; {1115#true} is VALID [2018-11-23 12:34:18,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret2 := main(); {1115#true} is VALID [2018-11-23 12:34:18,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {1115#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;~q~0 := 2000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~q~0 * ~p~0 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {1135#(<= 2000 main_~q~0)} is VALID [2018-11-23 12:34:18,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {1135#(<= 2000 main_~q~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {1135#(<= 2000 main_~q~0)} is VALID [2018-11-23 12:34:18,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {1135#(<= 2000 main_~q~0)} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {1135#(<= 2000 main_~q~0)} is VALID [2018-11-23 12:34:18,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {1135#(<= 2000 main_~q~0)} assume !!(~k~0 < ~p~0);~l~0 := 0; {1145#(and (<= 2000 main_~q~0) (<= main_~l~0 0))} is VALID [2018-11-23 12:34:18,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {1145#(and (<= 2000 main_~q~0) (<= main_~l~0 0))} assume !(~l~0 < ~q~0); {1116#false} is VALID [2018-11-23 12:34:18,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {1116#false} ~k~0 := 1 + ~k~0; {1116#false} is VALID [2018-11-23 12:34:18,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#false} assume !(~k~0 < ~p~0); {1116#false} is VALID [2018-11-23 12:34:18,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {1116#false} ~j~0 := 1 + ~j~0; {1116#false} is VALID [2018-11-23 12:34:18,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {1116#false} assume !(~j~0 < ~n~0); {1116#false} is VALID [2018-11-23 12:34:18,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {1116#false} ~i~0 := 1 + ~i~0; {1116#false} is VALID [2018-11-23 12:34:18,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {1116#false} assume !(~i~0 < ~m~0); {1116#false} is VALID [2018-11-23 12:34:18,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {1116#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {1116#false} is VALID [2018-11-23 12:34:18,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {1116#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {1116#false} is VALID [2018-11-23 12:34:18,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {1116#false} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {1116#false} is VALID [2018-11-23 12:34:18,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {1116#false} assume !!(~k~0 < ~p~0);~l~0 := 0; {1116#false} is VALID [2018-11-23 12:34:18,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {1116#false} assume !!(~l~0 < ~q~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4); {1116#false} is VALID [2018-11-23 12:34:18,361 INFO L256 TraceCheckUtils]: 21: Hoare triple {1116#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1116#false} is VALID [2018-11-23 12:34:18,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {1116#false} ~cond := #in~cond; {1116#false} is VALID [2018-11-23 12:34:18,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {1116#false} assume 0 == ~cond; {1116#false} is VALID [2018-11-23 12:34:18,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2018-11-23 12:34:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:18,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:18,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:18,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:34:18,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:18,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:18,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:18,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:18,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:18,410 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-11-23 12:34:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,681 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2018-11-23 12:34:18,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:18,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 12:34:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-23 12:34:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-23 12:34:18,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2018-11-23 12:34:18,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:18,802 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:34:18,802 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:34:18,803 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:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:34:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 12:34:18,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:18,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2018-11-23 12:34:18,899 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2018-11-23 12:34:18,899 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2018-11-23 12:34:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,902 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-23 12:34:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:34:18,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:18,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:18,903 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2018-11-23 12:34:18,903 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2018-11-23 12:34:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:18,906 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-23 12:34:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:34:18,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:18,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:18,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:18,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:34:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 12:34:18,909 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 25 [2018-11-23 12:34:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:18,910 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 12:34:18,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 12:34:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:34:18,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:18,911 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, 1, 1] [2018-11-23 12:34:18,911 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:18,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2078217125, now seen corresponding path program 1 times [2018-11-23 12:34:18,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:18,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:18,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:18,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:18,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:18,919 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:18,919 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:18,920 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:18,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:18,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:19,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {1431#true} call ULTIMATE.init(); {1431#true} is VALID [2018-11-23 12:34:19,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {1431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1431#true} is VALID [2018-11-23 12:34:19,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-23 12:34:19,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1431#true} {1431#true} #125#return; {1431#true} is VALID [2018-11-23 12:34:19,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {1431#true} call #t~ret2 := main(); {1431#true} is VALID [2018-11-23 12:34:19,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {1431#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;~q~0 := 2000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~q~0 * ~p~0 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {1451#(<= 2000 main_~q~0)} is VALID [2018-11-23 12:34:19,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {1451#(<= 2000 main_~q~0)} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {1451#(<= 2000 main_~q~0)} is VALID [2018-11-23 12:34:19,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {1451#(<= 2000 main_~q~0)} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {1451#(<= 2000 main_~q~0)} is VALID [2018-11-23 12:34:19,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {1451#(<= 2000 main_~q~0)} assume !!(~k~0 < ~p~0);~l~0 := 0; {1461#(and (<= 2000 main_~q~0) (<= main_~l~0 0))} is VALID [2018-11-23 12:34:19,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {1461#(and (<= 2000 main_~q~0) (<= main_~l~0 0))} assume !!(~l~0 < ~q~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4);~l~0 := 1 + ~l~0; {1465#(and (<= main_~l~0 1) (<= 2000 main_~q~0))} is VALID [2018-11-23 12:34:19,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {1465#(and (<= main_~l~0 1) (<= 2000 main_~q~0))} assume !(~l~0 < ~q~0); {1432#false} is VALID [2018-11-23 12:34:19,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {1432#false} ~k~0 := 1 + ~k~0; {1432#false} is VALID [2018-11-23 12:34:19,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {1432#false} assume !(~k~0 < ~p~0); {1432#false} is VALID [2018-11-23 12:34:19,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {1432#false} ~j~0 := 1 + ~j~0; {1432#false} is VALID [2018-11-23 12:34:19,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {1432#false} assume !(~j~0 < ~n~0); {1432#false} is VALID [2018-11-23 12:34:19,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {1432#false} ~i~0 := 1 + ~i~0; {1432#false} is VALID [2018-11-23 12:34:19,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {1432#false} assume !(~i~0 < ~m~0); {1432#false} is VALID [2018-11-23 12:34:19,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {1432#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {1432#false} is VALID [2018-11-23 12:34:19,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {1432#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {1432#false} is VALID [2018-11-23 12:34:19,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {1432#false} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {1432#false} is VALID [2018-11-23 12:34:19,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {1432#false} assume !!(~k~0 < ~p~0);~l~0 := 0; {1432#false} is VALID [2018-11-23 12:34:19,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {1432#false} assume !!(~l~0 < ~q~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4); {1432#false} is VALID [2018-11-23 12:34:19,131 INFO L256 TraceCheckUtils]: 22: Hoare triple {1432#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1432#false} is VALID [2018-11-23 12:34:19,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {1432#false} ~cond := #in~cond; {1432#false} is VALID [2018-11-23 12:34:19,132 INFO L273 TraceCheckUtils]: 24: Hoare triple {1432#false} assume 0 == ~cond; {1432#false} is VALID [2018-11-23 12:34:19,132 INFO L273 TraceCheckUtils]: 25: Hoare triple {1432#false} assume !false; {1432#false} is VALID [2018-11-23 12:34:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:19,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:19,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:19,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 12:34:19,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:19,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:19,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:19,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:19,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:19,189 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2018-11-23 12:34:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:19,588 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2018-11-23 12:34:19,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:19,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 12:34:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 12:34:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 12:34:19,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2018-11-23 12:34:19,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:19,817 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:34:19,817 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:34:19,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:34:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-23 12:34:19,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:19,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 40 states. [2018-11-23 12:34:19,907 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 40 states. [2018-11-23 12:34:19,907 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 40 states. [2018-11-23 12:34:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:19,910 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 12:34:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:34:19,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:19,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:19,911 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states. [2018-11-23 12:34:19,911 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states. [2018-11-23 12:34:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:19,914 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 12:34:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 12:34:19,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:19,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:19,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:19,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:34:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 12:34:19,917 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 26 [2018-11-23 12:34:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:19,918 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 12:34:19,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 12:34:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:34:19,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:19,919 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, 1, 1] [2018-11-23 12:34:19,919 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:19,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash 360470426, now seen corresponding path program 2 times [2018-11-23 12:34:19,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:19,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:19,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:19,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:19,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:19,927 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:19,927 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:19,927 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:19,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:19,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:19,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:19,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:20,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2018-11-23 12:34:20,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {1777#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1777#true} is VALID [2018-11-23 12:34:20,126 INFO L273 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2018-11-23 12:34:20,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #125#return; {1777#true} is VALID [2018-11-23 12:34:20,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret2 := main(); {1777#true} is VALID [2018-11-23 12:34:20,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {1777#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000;~n~0 := 1500;~p~0 := 1800;~q~0 := 2000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~q~0 * ~p~0 * ~n~0 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~k~0 < ~p~0);~l~0 := 0; {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~l~0 < ~q~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4);~l~0 := 1 + ~l~0; {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~l~0 < ~q~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4);~l~0 := 1 + ~l~0; {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~l~0 < ~q~0); {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~k~0 := 1 + ~k~0; {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,208 INFO L273 TraceCheckUtils]: 13: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~k~0 < ~p~0); {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~j~0 := 1 + ~j~0; {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {1797#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {1831#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:20,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {1831#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1778#false} is VALID [2018-11-23 12:34:20,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {1778#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {1778#false} is VALID [2018-11-23 12:34:20,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {1778#false} assume !!(~i~0 < ~m~0);~j~0 := 0;~k~0 := 0;~l~0 := 0; {1778#false} is VALID [2018-11-23 12:34:20,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {1778#false} assume !!(~j~0 < ~n~0);~k~0 := 0;~l~0 := 0; {1778#false} is VALID [2018-11-23 12:34:20,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {1778#false} assume !!(~k~0 < ~p~0);~l~0 := 0; {1778#false} is VALID [2018-11-23 12:34:20,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {1778#false} assume !!(~l~0 < ~q~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~q~0 * ~p~0 * ~n~0) + ~j~0 * (4 * ~q~0 * ~p~0) + ~k~0 * (4 * ~q~0) + 4 * ~l~0, 4); {1778#false} is VALID [2018-11-23 12:34:20,214 INFO L256 TraceCheckUtils]: 23: Hoare triple {1778#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1778#false} is VALID [2018-11-23 12:34:20,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2018-11-23 12:34:20,215 INFO L273 TraceCheckUtils]: 25: Hoare triple {1778#false} assume 0 == ~cond; {1778#false} is VALID [2018-11-23 12:34:20,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2018-11-23 12:34:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:34:20,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:20,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:34:20,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 12:34:20,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:20,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:20,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:20,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:20,280 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 12:34:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:20,747 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2018-11-23 12:34:20,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:20,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 12:34:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-23 12:34:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2018-11-23 12:34:20,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2018-11-23 12:34:20,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:20,950 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:34:20,950 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:34:20,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:34:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-11-23 12:34:21,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:21,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 51 states. [2018-11-23 12:34:21,357 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 51 states. [2018-11-23 12:34:21,357 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 51 states. [2018-11-23 12:34:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:21,361 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-23 12:34:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-23 12:34:21,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:21,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:21,362 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 61 states. [2018-11-23 12:34:21,362 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 61 states. [2018-11-23 12:34:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:21,365 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-23 12:34:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-23 12:34:21,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:21,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:21,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:21,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:34:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2018-11-23 12:34:21,368 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 27 [2018-11-23 12:34:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:21,368 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2018-11-23 12:34:21,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-23 12:34:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:34:21,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:21,369 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-11-23 12:34:21,369 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:21,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash 537748890, now seen corresponding path program 3 times [2018-11-23 12:34:21,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:21,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:21,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:21,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:21,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:21,377 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:21,378 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:21,378 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:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:21,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:34:21,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:21,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:21,960 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 12:34:22,826 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:34:22,828 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.modelcheckerutils.smt.predicates.TermDomainOperationProvider.constructQuantifiedFormula(TermDomainOperationProvider.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:197) 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:22,833 INFO L168 Benchmark]: Toolchain (without parser) took 10283.09 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 875.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -860.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:22,834 INFO L168 Benchmark]: CDTParser took 0.25 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:22,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.75 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:22,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.87 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:22,836 INFO L168 Benchmark]: Boogie Preprocessor took 69.95 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:22,836 INFO L168 Benchmark]: RCFGBuilder took 884.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:22,837 INFO L168 Benchmark]: TraceAbstraction took 8945.58 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 143.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -117.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:34:22,844 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.25 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 343.75 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 34.87 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 69.95 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 884.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8945.58 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 143.1 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -117.5 MB). Peak memory consumption was 25.6 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...