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/add-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:33:13,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:33:13,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:33:13,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:33:13,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:33:13,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:33:13,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:33:13,497 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:33:13,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:33:13,499 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:33:13,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:33:13,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:33:13,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:33:13,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:33:13,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:33:13,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:33:13,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:33:13,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:33:13,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:33:13,511 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:33:13,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:33:13,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:33:13,516 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:33:13,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:33:13,516 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:33:13,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:33:13,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:33:13,519 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:33:13,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:33:13,521 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:33:13,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:33:13,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:33:13,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:33:13,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:33:13,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:33:13,524 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:33:13,524 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:33:13,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:33:13,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:33:13,549 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:33:13,549 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:33:13,549 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:33:13,550 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:33:13,550 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:33:13,551 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:33:13,551 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:33:13,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:33:13,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:33:13,552 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:33:13,552 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:33:13,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:33:13,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:33:13,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:33:13,553 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:33:13,553 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:33:13,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:33:13,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:33:13,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:33:13,555 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:33:13,555 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:33:13,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:33:13,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:33:13,556 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:33:13,556 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:33:13,556 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:33:13,556 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:33:13,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:33:13,557 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:33:13,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:33:13,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:33:13,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:33:13,632 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:33:13,632 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:33:13,633 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/add-2-n-u_true-unreach-call.i [2018-11-23 12:33:13,704 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692662c18/5781219e50d7488f9867e9b116ec7103/FLAG25f408103 [2018-11-23 12:33:14,176 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:33:14,177 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/add-2-n-u_true-unreach-call.i [2018-11-23 12:33:14,183 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692662c18/5781219e50d7488f9867e9b116ec7103/FLAG25f408103 [2018-11-23 12:33:14,537 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/692662c18/5781219e50d7488f9867e9b116ec7103 [2018-11-23 12:33:14,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:33:14,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:33:14,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:14,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:33:14,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:33:14,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347ec180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14, skipping insertion in model container [2018-11-23 12:33:14,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:33:14,594 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:33:14,802 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:14,807 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:33:14,845 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:33:14,881 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:33:14,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14 WrapperNode [2018-11-23 12:33:14,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:33:14,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:14,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:33:14,884 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:33:14,894 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:33:14" (1/1) ... [2018-11-23 12:33:14,903 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:33:14" (1/1) ... [2018-11-23 12:33:14,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:33:14,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:33:14,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:33:14,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:33:14,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (1/1) ... [2018-11-23 12:33:14,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:33:14,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:33:14,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:33:14,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:33:14,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (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:33:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:33:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:33:15,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:33:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:33:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:33:15,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:33:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:33:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:33:15,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:33:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:33:15,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:33:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:33:15,805 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:33:15,805 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:33:15,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:15 BoogieIcfgContainer [2018-11-23 12:33:15,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:33:15,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:33:15,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:33:15,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:33:15,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:33:14" (1/3) ... [2018-11-23 12:33:15,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9047ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:15, skipping insertion in model container [2018-11-23 12:33:15,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:14" (2/3) ... [2018-11-23 12:33:15,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9047ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:15, skipping insertion in model container [2018-11-23 12:33:15,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:15" (3/3) ... [2018-11-23 12:33:15,814 INFO L112 eAbstractionObserver]: Analyzing ICFG add-2-n-u_true-unreach-call.i [2018-11-23 12:33:15,823 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:33:15,831 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:33:15,847 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:33:15,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:33:15,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:33:15,886 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:33:15,887 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:33:15,887 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:33:15,887 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:33:15,887 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:33:15,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:33:15,888 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:33:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 12:33:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:33:15,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:15,913 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:33:15,915 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:15,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1035913628, now seen corresponding path program 1 times [2018-11-23 12:33:15,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:15,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:15,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:16,016 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:16,016 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:16,016 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:33:16,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:16,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:16,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 12:33:16,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 12:33:16,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 12:33:16,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #99#return; {33#true} is VALID [2018-11-23 12:33:16,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2018-11-23 12:33:16,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {53#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:16,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {34#false} is VALID [2018-11-23 12:33:16,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0;~j~0 := 0; {34#false} is VALID [2018-11-23 12:33:16,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !(~i~0 < ~m~0); {34#false} is VALID [2018-11-23 12:33:16,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0;~j~0 := 0; {34#false} is VALID [2018-11-23 12:33:16,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {34#false} is VALID [2018-11-23 12:33:16,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {34#false} is VALID [2018-11-23 12:33:16,404 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {34#false} is VALID [2018-11-23 12:33:16,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 12:33:16,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 12:33:16,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 12:33:16,410 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:33:16,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:16,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:33:16,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:33:16,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:16,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:33:16,501 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:33:16,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:33:16,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:33:16,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:33:16,517 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-11-23 12:33:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:17,183 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2018-11-23 12:33:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:33:17,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:33:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 12:33:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:33:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 12:33:17,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2018-11-23 12:33:17,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:17,778 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:33:17,779 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:33:17,782 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:33:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:33:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 12:33:17,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:17,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 12:33:17,842 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 12:33:17,842 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 12:33:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:17,847 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 12:33:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:33:17,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:17,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:17,849 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 12:33:17,849 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 12:33:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:17,853 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 12:33:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:33:17,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:17,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:17,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:17,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:33:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 12:33:17,859 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2018-11-23 12:33:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:17,860 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 12:33:17,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:33:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 12:33:17,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:33:17,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:17,862 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:33:17,862 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:17,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash 573516244, now seen corresponding path program 1 times [2018-11-23 12:33:17,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:17,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:17,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:17,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:17,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:17,872 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:17,873 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:17,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:33:17,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:17,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:18,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {257#true} is VALID [2018-11-23 12:33:18,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {257#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {257#true} is VALID [2018-11-23 12:33:18,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2018-11-23 12:33:18,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #99#return; {257#true} is VALID [2018-11-23 12:33:18,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret7 := main(); {257#true} is VALID [2018-11-23 12:33:18,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {257#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {277#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:18,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {277#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {281#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:18,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {258#false} is VALID [2018-11-23 12:33:18,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {258#false} ~i~0 := 1 + ~i~0; {258#false} is VALID [2018-11-23 12:33:18,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {258#false} assume !(~i~0 < ~m~0); {258#false} is VALID [2018-11-23 12:33:18,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {258#false} ~i~0 := 0;~j~0 := 0; {258#false} is VALID [2018-11-23 12:33:18,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {258#false} assume !(~i~0 < ~m~0); {258#false} is VALID [2018-11-23 12:33:18,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {258#false} ~i~0 := 0;~j~0 := 0; {258#false} is VALID [2018-11-23 12:33:18,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {258#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {258#false} is VALID [2018-11-23 12:33:18,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {258#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {258#false} is VALID [2018-11-23 12:33:18,057 INFO L256 TraceCheckUtils]: 15: Hoare triple {258#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {258#false} is VALID [2018-11-23 12:33:18,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2018-11-23 12:33:18,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2018-11-23 12:33:18,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {258#false} assume !false; {258#false} is VALID [2018-11-23 12:33:18,059 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:33:18,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:18,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:18,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:33:18,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:18,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:18,118 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:33:18,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:18,120 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-11-23 12:33:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:18,511 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2018-11-23 12:33:18,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:18,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:33:18,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 12:33:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 12:33:18,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-23 12:33:18,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:18,673 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:33:18,673 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:33:18,674 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:33:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:33:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-23 12:33:18,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:18,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 29 states. [2018-11-23 12:33:18,715 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 29 states. [2018-11-23 12:33:18,715 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 29 states. [2018-11-23 12:33:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:18,721 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 12:33:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 12:33:18,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:18,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:18,723 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 34 states. [2018-11-23 12:33:18,723 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 34 states. [2018-11-23 12:33:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:18,727 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 12:33:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 12:33:18,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:18,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:18,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:18,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:33:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:33:18,731 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 19 [2018-11-23 12:33:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:18,731 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:33:18,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:33:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:33:18,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:18,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:18,733 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:18,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1173975853, now seen corresponding path program 1 times [2018-11-23 12:33:18,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:18,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:18,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:18,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:18,742 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:18,742 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:18,743 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:33:18,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:18,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:18,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {510#true} call ULTIMATE.init(); {510#true} is VALID [2018-11-23 12:33:18,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {510#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {510#true} is VALID [2018-11-23 12:33:18,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {510#true} assume true; {510#true} is VALID [2018-11-23 12:33:18,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {510#true} {510#true} #99#return; {510#true} is VALID [2018-11-23 12:33:18,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {510#true} call #t~ret7 := main(); {510#true} is VALID [2018-11-23 12:33:18,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {510#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {530#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:18,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {530#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {534#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:18,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {534#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {538#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:33:18,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {511#false} is VALID [2018-11-23 12:33:18,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {511#false} ~i~0 := 1 + ~i~0; {511#false} is VALID [2018-11-23 12:33:18,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {511#false} assume !(~i~0 < ~m~0); {511#false} is VALID [2018-11-23 12:33:18,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {511#false} ~i~0 := 0;~j~0 := 0; {511#false} is VALID [2018-11-23 12:33:18,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {511#false} assume !(~i~0 < ~m~0); {511#false} is VALID [2018-11-23 12:33:18,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {511#false} ~i~0 := 0;~j~0 := 0; {511#false} is VALID [2018-11-23 12:33:18,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {511#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {511#false} is VALID [2018-11-23 12:33:18,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {511#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {511#false} is VALID [2018-11-23 12:33:18,997 INFO L256 TraceCheckUtils]: 16: Hoare triple {511#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {511#false} is VALID [2018-11-23 12:33:18,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {511#false} ~cond := #in~cond; {511#false} is VALID [2018-11-23 12:33:18,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {511#false} assume 0 == ~cond; {511#false} is VALID [2018-11-23 12:33:18,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {511#false} assume !false; {511#false} is VALID [2018-11-23 12:33:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:33:19,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:19,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:19,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:33:19,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:19,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:19,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:19,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:19,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:19,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:19,099 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2018-11-23 12:33:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:19,394 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 12:33:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:19,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:33:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:33:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 12:33:19,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 12:33:19,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:19,548 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:33:19,548 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:33:19,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:33:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:33:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-11-23 12:33:19,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:19,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 34 states. [2018-11-23 12:33:19,586 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 34 states. [2018-11-23 12:33:19,586 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 34 states. [2018-11-23 12:33:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:19,590 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-23 12:33:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:33:19,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:19,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:19,592 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 39 states. [2018-11-23 12:33:19,592 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 39 states. [2018-11-23 12:33:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:19,595 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-23 12:33:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:33:19,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:19,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:19,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:19,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:33:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 12:33:19,599 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2018-11-23 12:33:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:19,600 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 12:33:19,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 12:33:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:33:19,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:19,601 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] [2018-11-23 12:33:19,601 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:19,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash 488343988, now seen corresponding path program 2 times [2018-11-23 12:33:19,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:19,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:19,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:19,610 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:19,611 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:19,611 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:33:19,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:19,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:33:19,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:19,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:19,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {801#true} call ULTIMATE.init(); {801#true} is VALID [2018-11-23 12:33:19,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {801#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {801#true} is VALID [2018-11-23 12:33:19,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {801#true} assume true; {801#true} is VALID [2018-11-23 12:33:19,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {801#true} {801#true} #99#return; {801#true} is VALID [2018-11-23 12:33:19,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {801#true} call #t~ret7 := main(); {801#true} is VALID [2018-11-23 12:33:19,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {801#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {821#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:19,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {821#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:19,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {821#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:19,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {821#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {821#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:19,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {821#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:19,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {821#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:19,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {821#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:19,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0; {843#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:19,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {843#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {802#false} is VALID [2018-11-23 12:33:19,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {802#false} ~i~0 := 0;~j~0 := 0; {802#false} is VALID [2018-11-23 12:33:19,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {802#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {802#false} is VALID [2018-11-23 12:33:19,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {802#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {802#false} is VALID [2018-11-23 12:33:19,761 INFO L256 TraceCheckUtils]: 17: Hoare triple {802#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {802#false} is VALID [2018-11-23 12:33:19,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {802#false} ~cond := #in~cond; {802#false} is VALID [2018-11-23 12:33:19,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {802#false} assume 0 == ~cond; {802#false} is VALID [2018-11-23 12:33:19,762 INFO L273 TraceCheckUtils]: 20: Hoare triple {802#false} assume !false; {802#false} is VALID [2018-11-23 12:33:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:33:19,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:33:19,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:33:19,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:33:19,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:19,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:33:19,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:19,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:33:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:33:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:33:19,816 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 4 states. [2018-11-23 12:33:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:20,153 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-23 12:33:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:33:20,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:33:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 12:33:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:33:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 12:33:20,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 12:33:20,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:20,253 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:33:20,253 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:33:20,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:33:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:33:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2018-11-23 12:33:20,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:20,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 35 states. [2018-11-23 12:33:20,324 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 35 states. [2018-11-23 12:33:20,324 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 35 states. [2018-11-23 12:33:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:20,328 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:33:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:33:20,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:20,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:20,330 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 52 states. [2018-11-23 12:33:20,330 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 52 states. [2018-11-23 12:33:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:20,333 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:33:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-11-23 12:33:20,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:20,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:20,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:20,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:33:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 12:33:20,338 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 21 [2018-11-23 12:33:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:20,338 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 12:33:20,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:33:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:33:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:33:20,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:20,339 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:20,340 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:20,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1641208904, now seen corresponding path program 1 times [2018-11-23 12:33:20,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:20,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:20,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:20,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:20,348 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:20,348 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:20,349 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:33:20,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:20,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:20,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {1135#true} call ULTIMATE.init(); {1135#true} is VALID [2018-11-23 12:33:20,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {1135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1135#true} is VALID [2018-11-23 12:33:20,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {1135#true} assume true; {1135#true} is VALID [2018-11-23 12:33:20,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1135#true} #99#return; {1135#true} is VALID [2018-11-23 12:33:20,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {1135#true} call #t~ret7 := main(); {1135#true} is VALID [2018-11-23 12:33:20,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {1135#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {1155#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:33:20,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {1155#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1159#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:33:20,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {1159#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1163#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:33:20,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {1163#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1167#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:33:20,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {1167#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1136#false} is VALID [2018-11-23 12:33:20,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {1136#false} ~i~0 := 1 + ~i~0; {1136#false} is VALID [2018-11-23 12:33:20,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {1136#false} assume !(~i~0 < ~m~0); {1136#false} is VALID [2018-11-23 12:33:20,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {1136#false} ~i~0 := 0;~j~0 := 0; {1136#false} is VALID [2018-11-23 12:33:20,531 INFO L273 TraceCheckUtils]: 13: Hoare triple {1136#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1136#false} is VALID [2018-11-23 12:33:20,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {1136#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {1136#false} is VALID [2018-11-23 12:33:20,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {1136#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {1136#false} is VALID [2018-11-23 12:33:20,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {1136#false} assume !(~j~0 < ~n~0); {1136#false} is VALID [2018-11-23 12:33:20,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {1136#false} ~i~0 := 1 + ~i~0; {1136#false} is VALID [2018-11-23 12:33:20,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {1136#false} assume !(~i~0 < ~m~0); {1136#false} is VALID [2018-11-23 12:33:20,534 INFO L273 TraceCheckUtils]: 19: Hoare triple {1136#false} ~i~0 := 0;~j~0 := 0; {1136#false} is VALID [2018-11-23 12:33:20,534 INFO L273 TraceCheckUtils]: 20: Hoare triple {1136#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1136#false} is VALID [2018-11-23 12:33:20,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {1136#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1136#false} is VALID [2018-11-23 12:33:20,535 INFO L256 TraceCheckUtils]: 22: Hoare triple {1136#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1136#false} is VALID [2018-11-23 12:33:20,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {1136#false} ~cond := #in~cond; {1136#false} is VALID [2018-11-23 12:33:20,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {1136#false} assume 0 == ~cond; {1136#false} is VALID [2018-11-23 12:33:20,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {1136#false} assume !false; {1136#false} is VALID [2018-11-23 12:33:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:33:20,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:20,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:33:20,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 12:33:20,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:20,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:33:20,585 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:33:20,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:33:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:33:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:20,586 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 6 states. [2018-11-23 12:33:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:20,952 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2018-11-23 12:33:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:33:20,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 12:33:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:33:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-23 12:33:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:33:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-23 12:33:20,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2018-11-23 12:33:21,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:21,260 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:33:21,263 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:33:21,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:33:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:33:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-23 12:33:21,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:21,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 40 states. [2018-11-23 12:33:21,424 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 40 states. [2018-11-23 12:33:21,424 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 40 states. [2018-11-23 12:33:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:21,427 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 12:33:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 12:33:21,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:21,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:21,429 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states. [2018-11-23 12:33:21,429 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states. [2018-11-23 12:33:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:21,432 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 12:33:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 12:33:21,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:21,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:21,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:21,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:33:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-23 12:33:21,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2018-11-23 12:33:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:21,436 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-23 12:33:21,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:33:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-23 12:33:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:33:21,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:21,438 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:33:21,438 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:21,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:21,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1483393922, now seen corresponding path program 2 times [2018-11-23 12:33:21,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:21,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:21,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:21,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:33:21,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:21,447 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:21,447 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:21,447 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:33:21,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:33:21,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:33:21,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:21,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:21,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2018-11-23 12:33:21,654 INFO L273 TraceCheckUtils]: 1: Hoare triple {1483#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1483#true} is VALID [2018-11-23 12:33:21,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2018-11-23 12:33:21,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #99#return; {1483#true} is VALID [2018-11-23 12:33:21,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret7 := main(); {1483#true} is VALID [2018-11-23 12:33:21,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {1483#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * ~n~0 * ~m~0);~i~0 := 0;~j~0 := 0; {1503#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:21,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {1503#(<= 1000 main_~m~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1503#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:21,661 INFO L273 TraceCheckUtils]: 7: Hoare triple {1503#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1503#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:21,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {1503#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1503#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:21,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {1503#(<= 1000 main_~m~0)} assume !!(~j~0 < ~n~0);call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;call write~int(#t~nondet1, ~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet1;~j~0 := 1 + ~j~0; {1503#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:21,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {1503#(<= 1000 main_~m~0)} assume !(~j~0 < ~n~0); {1503#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:21,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {1503#(<= 1000 main_~m~0)} ~i~0 := 1 + ~i~0; {1503#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:21,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(<= 1000 main_~m~0)} assume !(~i~0 < ~m~0); {1503#(<= 1000 main_~m~0)} is VALID [2018-11-23 12:33:21,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {1503#(<= 1000 main_~m~0)} ~i~0 := 0;~j~0 := 0; {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:21,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:21,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:21,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:21,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call write~int(#t~mem2 + #t~mem3, ~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~mem3;havoc #t~mem2;~j~0 := 1 + ~j~0; {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:21,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:21,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {1528#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {1547#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:33:21,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {1547#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1484#false} is VALID [2018-11-23 12:33:21,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {1484#false} ~i~0 := 0;~j~0 := 0; {1484#false} is VALID [2018-11-23 12:33:21,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {1484#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1484#false} is VALID [2018-11-23 12:33:21,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {1484#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);call #t~mem5 := read~int(~#B~0.base, ~#B~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1484#false} is VALID [2018-11-23 12:33:21,689 INFO L256 TraceCheckUtils]: 24: Hoare triple {1484#false} call __VERIFIER_assert((if #t~mem6 % 4294967296 == (#t~mem4 + #t~mem5) % 4294967296 then 1 else 0)); {1484#false} is VALID [2018-11-23 12:33:21,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {1484#false} ~cond := #in~cond; {1484#false} is VALID [2018-11-23 12:33:21,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {1484#false} assume 0 == ~cond; {1484#false} is VALID [2018-11-23 12:33:21,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2018-11-23 12:33:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 12:33:21,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:33:21,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:33:21,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 12:33:21,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:33:21,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:33:21,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:21,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:33:21,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:33:21,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:33:21,742 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2018-11-23 12:33:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:22,290 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2018-11-23 12:33:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:33:22,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 12:33:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:33:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-23 12:33:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:33:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-23 12:33:22,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2018-11-23 12:33:22,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:33:22,399 INFO L225 Difference]: With dead ends: 113 [2018-11-23 12:33:22,399 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:33:22,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:33:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:33:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2018-11-23 12:33:22,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:33:22,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 52 states. [2018-11-23 12:33:22,689 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 52 states. [2018-11-23 12:33:22,690 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 52 states. [2018-11-23 12:33:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:22,696 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-23 12:33:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-11-23 12:33:22,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:22,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:22,698 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 86 states. [2018-11-23 12:33:22,698 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 86 states. [2018-11-23 12:33:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:33:22,703 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-23 12:33:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-11-23 12:33:22,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:33:22,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:33:22,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:33:22,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:33:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:33:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-23 12:33:22,707 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 28 [2018-11-23 12:33:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:33:22,707 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-23 12:33:22,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:33:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 12:33:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:33:22,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:33:22,710 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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:33:22,710 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:33:22,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:33:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash -347991136, now seen corresponding path program 3 times [2018-11-23 12:33:22,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:33:22,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:33:22,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:22,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:33:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:33:22,723 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:33:22,724 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:33:22,724 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:33:22,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:33:23,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 12:33:23,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:33:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:33:23,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:33:23,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:33:23,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 12:33:23,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:33:23,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:33:23,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:33:23,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:33:23,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:33:23,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:33:23,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2018-11-23 12:33:24,319 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:33:24,320 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:33:24,326 INFO L168 Benchmark]: Toolchain (without parser) took 9778.71 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 863.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -839.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:33:24,328 INFO L168 Benchmark]: CDTParser took 0.20 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:33:24,329 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.01 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:33:24,329 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.96 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:33:24,330 INFO L168 Benchmark]: Boogie Preprocessor took 52.60 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:33:24,330 INFO L168 Benchmark]: RCFGBuilder took 840.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:33:24,331 INFO L168 Benchmark]: TraceAbstraction took 8517.98 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 122.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -74.8 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:33:24,336 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.20 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 333.01 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 28.96 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 52.60 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 840.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8517.98 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 122.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -74.8 MB). Peak memory consumption was 47.9 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...