java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:02:54,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:02:54,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:02:54,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:02:54,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:02:54,843 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:02:54,846 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:02:54,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:02:54,851 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:02:54,852 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:02:54,853 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:02:54,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:02:54,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:02:54,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:02:54,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:02:54,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:02:54,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:02:54,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:02:54,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:02:54,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:02:54,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:02:54,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:02:54,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:02:54,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:02:54,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:02:54,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:02:54,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:02:54,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:02:54,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:02:54,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:02:54,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:02:54,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:02:54,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:02:54,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:02:54,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:02:54,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:02:54,885 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-18 23:02:54,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:02:54,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:02:54,912 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:02:54,912 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:02:54,913 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:02:54,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:02:54,913 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:02:54,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:02:54,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:02:54,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:02:54,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:02:54,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:02:54,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:02:54,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:02:54,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:02:54,915 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:02:54,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:02:54,915 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:02:54,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:02:54,918 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:02:54,918 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:02:54,918 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:02:54,918 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:02:54,919 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:02:54,919 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:02:54,919 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:02:54,920 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:02:54,920 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:02:54,920 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:02:54,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:02:54,920 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:02:54,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:02:54,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:02:54,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:02:54,999 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:02:55,000 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:02:55,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i [2018-11-18 23:02:55,065 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9625b04ff/6ad015e466704a578e14c33620dd92dc/FLAGdced18677 [2018-11-18 23:02:55,485 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:02:55,486 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i [2018-11-18 23:02:55,493 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9625b04ff/6ad015e466704a578e14c33620dd92dc/FLAGdced18677 [2018-11-18 23:02:55,877 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9625b04ff/6ad015e466704a578e14c33620dd92dc [2018-11-18 23:02:55,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:02:55,889 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:02:55,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:02:55,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:02:55,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:02:55,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:55" (1/1) ... [2018-11-18 23:02:55,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51548e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:55, skipping insertion in model container [2018-11-18 23:02:55,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:02:55" (1/1) ... [2018-11-18 23:02:55,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:02:55,940 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:02:56,202 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:02:56,208 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:02:56,248 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:02:56,269 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:02:56,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56 WrapperNode [2018-11-18 23:02:56,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:02:56,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:02:56,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:02:56,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:02:56,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (1/1) ... [2018-11-18 23:02:56,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (1/1) ... [2018-11-18 23:02:56,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (1/1) ... [2018-11-18 23:02:56,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (1/1) ... [2018-11-18 23:02:56,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (1/1) ... [2018-11-18 23:02:56,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (1/1) ... [2018-11-18 23:02:56,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (1/1) ... [2018-11-18 23:02:56,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:02:56,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:02:56,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:02:56,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:02:56,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (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-18 23:02:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:02:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:02:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:02:56,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:02:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:02:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:02:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2018-11-18 23:02:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:02:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:02:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:02:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:02:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:02:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:02:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:02:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:02:57,069 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:02:57,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:57 BoogieIcfgContainer [2018-11-18 23:02:57,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:02:57,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:02:57,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:02:57,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:02:57,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:02:55" (1/3) ... [2018-11-18 23:02:57,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d449236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:02:57, skipping insertion in model container [2018-11-18 23:02:57,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:02:56" (2/3) ... [2018-11-18 23:02:57,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d449236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:02:57, skipping insertion in model container [2018-11-18 23:02:57,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:02:57" (3/3) ... [2018-11-18 23:02:57,079 INFO L112 eAbstractionObserver]: Analyzing ICFG array_mul_init_true-unreach-call_true-termination.i [2018-11-18 23:02:57,088 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:02:57,098 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:02:57,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:02:57,146 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:02:57,147 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:02:57,148 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:02:57,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:02:57,148 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:02:57,148 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:02:57,149 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:02:57,149 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:02:57,149 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:02:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-18 23:02:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:02:57,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:57,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:02:57,181 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:57,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash 206551718, now seen corresponding path program 1 times [2018-11-18 23:02:57,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:57,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:57,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:57,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:02:57,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:57,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-18 23:02:57,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-18 23:02:57,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-18 23:02:57,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2018-11-18 23:02:57,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret11 := main(); {35#true} is VALID [2018-11-18 23:02:57,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {35#true} is VALID [2018-11-18 23:02:57,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-18 23:02:57,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-18 23:02:57,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-18 23:02:57,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2018-11-18 23:02:57,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-18 23:02:57,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {36#false} is VALID [2018-11-18 23:02:57,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} assume #t~short10; {36#false} is VALID [2018-11-18 23:02:57,355 INFO L256 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {36#false} is VALID [2018-11-18 23:02:57,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-18 23:02:57,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2018-11-18 23:02:57,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-18 23:02:57,359 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-18 23:02:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:02:57,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:02:57,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:02:57,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:57,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:02:57,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:57,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:02:57,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:02:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:02:57,555 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-18 23:02:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:57,856 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-18 23:02:57,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:02:57,856 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:02:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:02:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-18 23:02:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:02:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-18 23:02:57,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-18 23:02:58,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:58,158 INFO L225 Difference]: With dead ends: 55 [2018-11-18 23:02:58,158 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 23:02:58,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:02:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 23:02:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 23:02:58,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:58,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-18 23:02:58,318 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 23:02:58,318 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 23:02:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:58,323 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-18 23:02:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-18 23:02:58,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:58,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:58,325 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-18 23:02:58,325 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-18 23:02:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:58,330 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-18 23:02:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-18 23:02:58,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:58,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:58,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:58,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 23:02:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-18 23:02:58,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-11-18 23:02:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:58,337 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-18 23:02:58,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:02:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-18 23:02:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 23:02:58,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:58,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:02:58,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:58,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2117587094, now seen corresponding path program 1 times [2018-11-18 23:02:58,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:58,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:58,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:02:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:58,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-18 23:02:58,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {197#true} is VALID [2018-11-18 23:02:58,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-18 23:02:58,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #77#return; {197#true} is VALID [2018-11-18 23:02:58,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret11 := main(); {197#true} is VALID [2018-11-18 23:02:58,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {199#(= main_~i~0 0)} is VALID [2018-11-18 23:02:58,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {199#(= main_~i~0 0)} assume true; {199#(= main_~i~0 0)} is VALID [2018-11-18 23:02:58,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#(= main_~i~0 0)} assume !(~i~0 < 100000); {198#false} is VALID [2018-11-18 23:02:58,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-18 23:02:58,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-18 23:02:58,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#false} assume !(~i~0 < 100000); {198#false} is VALID [2018-11-18 23:02:58,517 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-18 23:02:58,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-18 23:02:58,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {198#false} is VALID [2018-11-18 23:02:58,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {198#false} assume #t~short10; {198#false} is VALID [2018-11-18 23:02:58,518 INFO L256 TraceCheckUtils]: 15: Hoare triple {198#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {198#false} is VALID [2018-11-18 23:02:58,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2018-11-18 23:02:58,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#false} assume 0 == ~cond; {198#false} is VALID [2018-11-18 23:02:58,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-18 23:02:58,521 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-18 23:02:58,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:02:58,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:02:58,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:02:58,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:02:58,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:02:58,604 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-18 23:02:58,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:02:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:02:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:02:58,606 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-18 23:02:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:59,223 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-11-18 23:02:59,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:02:59,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 23:02:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:02:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:02:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-18 23:02:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:02:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-18 23:02:59,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-18 23:02:59,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:02:59,477 INFO L225 Difference]: With dead ends: 58 [2018-11-18 23:02:59,477 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 23:02:59,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 23:02:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 23:02:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-11-18 23:02:59,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:02:59,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2018-11-18 23:02:59,559 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2018-11-18 23:02:59,560 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2018-11-18 23:02:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:59,564 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-18 23:02:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-18 23:02:59,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:59,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:59,566 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2018-11-18 23:02:59,566 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2018-11-18 23:02:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:02:59,570 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-18 23:02:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-18 23:02:59,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:02:59,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:02:59,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:02:59,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:02:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:02:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-18 23:02:59,574 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2018-11-18 23:02:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:02:59,574 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-18 23:02:59,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:02:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-18 23:02:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 23:02:59,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:02:59,576 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:02:59,576 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:02:59,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:02:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1257431516, now seen corresponding path program 1 times [2018-11-18 23:02:59,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:02:59,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:02:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:59,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:02:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:02:59,618 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:02:59,619 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:02:59,619 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-18 23:02:59,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:02:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:02:59,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:02:59,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {399#true} is VALID [2018-11-18 23:02:59,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {399#true} is VALID [2018-11-18 23:02:59,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2018-11-18 23:02:59,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #77#return; {399#true} is VALID [2018-11-18 23:02:59,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret11 := main(); {399#true} is VALID [2018-11-18 23:02:59,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {419#(<= main_~i~0 0)} is VALID [2018-11-18 23:02:59,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {419#(<= main_~i~0 0)} assume true; {419#(<= main_~i~0 0)} is VALID [2018-11-18 23:02:59,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {419#(<= main_~i~0 0)} is VALID [2018-11-18 23:02:59,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {429#(<= main_~i~0 1)} is VALID [2018-11-18 23:02:59,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {429#(<= main_~i~0 1)} assume true; {429#(<= main_~i~0 1)} is VALID [2018-11-18 23:02:59,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {429#(<= main_~i~0 1)} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-18 23:02:59,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-18 23:02:59,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-18 23:02:59,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {400#false} is VALID [2018-11-18 23:02:59,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {400#false} is VALID [2018-11-18 23:02:59,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {400#false} is VALID [2018-11-18 23:02:59,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-18 23:02:59,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {400#false} assume !(~i~0 < 100000); {400#false} is VALID [2018-11-18 23:02:59,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#false} ~i~0 := 0; {400#false} is VALID [2018-11-18 23:02:59,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {400#false} assume true; {400#false} is VALID [2018-11-18 23:02:59,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {400#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {400#false} is VALID [2018-11-18 23:02:59,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {400#false} assume #t~short10; {400#false} is VALID [2018-11-18 23:02:59,980 INFO L256 TraceCheckUtils]: 22: Hoare triple {400#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {400#false} is VALID [2018-11-18 23:02:59,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {400#false} ~cond := #in~cond; {400#false} is VALID [2018-11-18 23:02:59,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {400#false} assume 0 == ~cond; {400#false} is VALID [2018-11-18 23:02:59,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {400#false} assume !false; {400#false} is VALID [2018-11-18 23:02:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 23:03:00,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:03:00,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-18 23:03:00,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-18 23:03:00,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:00,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:03:00,059 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-18 23:03:00,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:03:00,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:03:00,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:03:00,060 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-18 23:03:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:00,476 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-11-18 23:03:00,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:03:00,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-18 23:03:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:03:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-18 23:03:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:03:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-18 23:03:00,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2018-11-18 23:03:00,690 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-18 23:03:00,692 INFO L225 Difference]: With dead ends: 73 [2018-11-18 23:03:00,693 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 23:03:00,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-18 23:03:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 23:03:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-11-18 23:03:00,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:00,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 38 states. [2018-11-18 23:03:00,757 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 38 states. [2018-11-18 23:03:00,757 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 38 states. [2018-11-18 23:03:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:00,767 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-18 23:03:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-18 23:03:00,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:00,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:00,769 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 53 states. [2018-11-18 23:03:00,769 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 53 states. [2018-11-18 23:03:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:00,778 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-18 23:03:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-18 23:03:00,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:00,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:00,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:00,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 23:03:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-18 23:03:00,784 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 26 [2018-11-18 23:03:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:00,784 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-18 23:03:00,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:03:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-18 23:03:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 23:03:00,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:00,786 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:03:00,787 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:00,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash -267016696, now seen corresponding path program 2 times [2018-11-18 23:03:00,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:00,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:00,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:03:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:00,803 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:03:00,803 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:03:00,803 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-18 23:03:00,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:03:00,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 23:03:00,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:03:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:00,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:00,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2018-11-18 23:03:00,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {732#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {732#true} is VALID [2018-11-18 23:03:00,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-18 23:03:00,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {732#true} {732#true} #77#return; {732#true} is VALID [2018-11-18 23:03:00,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {732#true} call #t~ret11 := main(); {732#true} is VALID [2018-11-18 23:03:00,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {732#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {732#true} is VALID [2018-11-18 23:03:00,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-18 23:03:00,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {732#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {732#true} is VALID [2018-11-18 23:03:00,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {732#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {732#true} is VALID [2018-11-18 23:03:00,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-18 23:03:00,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {732#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {732#true} is VALID [2018-11-18 23:03:00,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {732#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {732#true} is VALID [2018-11-18 23:03:00,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-18 23:03:00,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {732#true} assume !(~i~0 < 100000); {732#true} is VALID [2018-11-18 23:03:00,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {732#true} ~i~0 := 0; {732#true} is VALID [2018-11-18 23:03:00,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-18 23:03:00,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {732#true} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {732#true} is VALID [2018-11-18 23:03:00,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {732#true} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {732#true} is VALID [2018-11-18 23:03:00,984 INFO L273 TraceCheckUtils]: 18: Hoare triple {732#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {732#true} is VALID [2018-11-18 23:03:00,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-18 23:03:00,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {732#true} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {732#true} is VALID [2018-11-18 23:03:00,985 INFO L273 TraceCheckUtils]: 21: Hoare triple {732#true} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {732#true} is VALID [2018-11-18 23:03:00,986 INFO L273 TraceCheckUtils]: 22: Hoare triple {732#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {732#true} is VALID [2018-11-18 23:03:00,986 INFO L273 TraceCheckUtils]: 23: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-18 23:03:00,986 INFO L273 TraceCheckUtils]: 24: Hoare triple {732#true} assume !(~i~0 < 100000); {732#true} is VALID [2018-11-18 23:03:00,987 INFO L273 TraceCheckUtils]: 25: Hoare triple {732#true} ~i~0 := 0; {732#true} is VALID [2018-11-18 23:03:00,987 INFO L273 TraceCheckUtils]: 26: Hoare triple {732#true} assume true; {732#true} is VALID [2018-11-18 23:03:00,987 INFO L273 TraceCheckUtils]: 27: Hoare triple {732#true} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {732#true} is VALID [2018-11-18 23:03:00,989 INFO L273 TraceCheckUtils]: 28: Hoare triple {732#true} assume #t~short10; {821#|main_#t~short10|} is VALID [2018-11-18 23:03:00,990 INFO L256 TraceCheckUtils]: 29: Hoare triple {821#|main_#t~short10|} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {825#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:03:00,992 INFO L273 TraceCheckUtils]: 30: Hoare triple {825#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {829#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:03:00,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {829#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {733#false} is VALID [2018-11-18 23:03:00,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {733#false} assume !false; {733#false} is VALID [2018-11-18 23:03:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 23:03:01,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:03:01,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:03:01,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-18 23:03:01,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:01,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:03:01,049 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-18 23:03:01,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:03:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:03:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:03:01,050 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 5 states. [2018-11-18 23:03:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:01,322 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-18 23:03:01,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:03:01,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-18 23:03:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:03:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-18 23:03:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:03:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-18 23:03:01,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-18 23:03:01,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:01,442 INFO L225 Difference]: With dead ends: 46 [2018-11-18 23:03:01,443 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 23:03:01,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:03:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 23:03:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-18 23:03:01,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:01,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-18 23:03:01,464 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-18 23:03:01,464 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-18 23:03:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:01,467 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-18 23:03:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-18 23:03:01,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:01,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:01,468 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-18 23:03:01,468 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-18 23:03:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:01,471 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-18 23:03:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-18 23:03:01,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:01,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:01,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:01,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 23:03:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-18 23:03:01,477 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 33 [2018-11-18 23:03:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:01,477 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-18 23:03:01,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:03:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 23:03:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 23:03:01,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:01,479 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:03:01,480 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:01,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash -265169654, now seen corresponding path program 1 times [2018-11-18 23:03:01,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:01,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:01,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:01,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:03:01,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:01,495 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:03:01,495 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:03:01,495 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-18 23:03:01,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:03:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:01,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:01,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {1044#true} call ULTIMATE.init(); {1044#true} is VALID [2018-11-18 23:03:01,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {1044#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1044#true} is VALID [2018-11-18 23:03:01,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {1044#true} assume true; {1044#true} is VALID [2018-11-18 23:03:01,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1044#true} {1044#true} #77#return; {1044#true} is VALID [2018-11-18 23:03:01,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {1044#true} call #t~ret11 := main(); {1044#true} is VALID [2018-11-18 23:03:01,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {1044#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {1064#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:01,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {1064#(<= main_~i~0 0)} assume true; {1064#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:01,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {1064#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1064#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:01,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {1064#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1074#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:01,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {1074#(<= main_~i~0 1)} assume true; {1074#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:01,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {1074#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1074#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:01,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {1074#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1084#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:01,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {1084#(<= main_~i~0 2)} assume true; {1084#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:01,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {1084#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1045#false} is VALID [2018-11-18 23:03:01,680 INFO L273 TraceCheckUtils]: 14: Hoare triple {1045#false} ~i~0 := 0; {1045#false} is VALID [2018-11-18 23:03:01,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {1045#false} assume true; {1045#false} is VALID [2018-11-18 23:03:01,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {1045#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1045#false} is VALID [2018-11-18 23:03:01,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {1045#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1045#false} is VALID [2018-11-18 23:03:01,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {1045#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1045#false} is VALID [2018-11-18 23:03:01,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {1045#false} assume true; {1045#false} is VALID [2018-11-18 23:03:01,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {1045#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1045#false} is VALID [2018-11-18 23:03:01,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {1045#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1045#false} is VALID [2018-11-18 23:03:01,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {1045#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1045#false} is VALID [2018-11-18 23:03:01,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {1045#false} assume true; {1045#false} is VALID [2018-11-18 23:03:01,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {1045#false} assume !(~i~0 < 100000); {1045#false} is VALID [2018-11-18 23:03:01,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {1045#false} ~i~0 := 0; {1045#false} is VALID [2018-11-18 23:03:01,684 INFO L273 TraceCheckUtils]: 26: Hoare triple {1045#false} assume true; {1045#false} is VALID [2018-11-18 23:03:01,684 INFO L273 TraceCheckUtils]: 27: Hoare triple {1045#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {1045#false} is VALID [2018-11-18 23:03:01,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {1045#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {1045#false} is VALID [2018-11-18 23:03:01,685 INFO L256 TraceCheckUtils]: 29: Hoare triple {1045#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {1045#false} is VALID [2018-11-18 23:03:01,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {1045#false} ~cond := #in~cond; {1045#false} is VALID [2018-11-18 23:03:01,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {1045#false} assume 0 == ~cond; {1045#false} is VALID [2018-11-18 23:03:01,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {1045#false} assume !false; {1045#false} is VALID [2018-11-18 23:03:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 23:03:01,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:03:01,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 23:03:01,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-18 23:03:01,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:01,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:03:01,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:01,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:03:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:03:01,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:03:01,758 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2018-11-18 23:03:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:02,114 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2018-11-18 23:03:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:03:02,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-18 23:03:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:03:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2018-11-18 23:03:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:03:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2018-11-18 23:03:02,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2018-11-18 23:03:02,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:02,262 INFO L225 Difference]: With dead ends: 103 [2018-11-18 23:03:02,263 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 23:03:02,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-18 23:03:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 23:03:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2018-11-18 23:03:02,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:02,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 50 states. [2018-11-18 23:03:02,345 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 50 states. [2018-11-18 23:03:02,345 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 50 states. [2018-11-18 23:03:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:02,351 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-18 23:03:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-11-18 23:03:02,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:02,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:02,352 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 74 states. [2018-11-18 23:03:02,352 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 74 states. [2018-11-18 23:03:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:02,357 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-18 23:03:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-11-18 23:03:02,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:02,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:02,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:02,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 23:03:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-18 23:03:02,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 33 [2018-11-18 23:03:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:02,362 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-18 23:03:02,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:03:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-18 23:03:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 23:03:02,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:02,364 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:03:02,364 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:02,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:02,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1677259560, now seen corresponding path program 2 times [2018-11-18 23:03:02,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:02,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:02,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:02,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:03:02,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:02,379 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:03:02,380 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:03:02,380 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-18 23:03:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:03:02,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:03:02,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:03:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:02,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:02,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {1499#true} call ULTIMATE.init(); {1499#true} is VALID [2018-11-18 23:03:02,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {1499#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1499#true} is VALID [2018-11-18 23:03:02,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {1499#true} assume true; {1499#true} is VALID [2018-11-18 23:03:02,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1499#true} {1499#true} #77#return; {1499#true} is VALID [2018-11-18 23:03:02,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {1499#true} call #t~ret11 := main(); {1499#true} is VALID [2018-11-18 23:03:02,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {1499#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {1519#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:02,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {1519#(<= main_~i~0 0)} assume true; {1519#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:02,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {1519#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1519#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:02,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {1519#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1529#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:02,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {1529#(<= main_~i~0 1)} assume true; {1529#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:02,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {1529#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1529#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:02,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {1529#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1539#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:02,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {1539#(<= main_~i~0 2)} assume true; {1539#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:02,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {1539#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1539#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:02,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {1539#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1549#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:02,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {1549#(<= main_~i~0 3)} assume true; {1549#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:02,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {1549#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1500#false} is VALID [2018-11-18 23:03:02,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {1500#false} ~i~0 := 0; {1500#false} is VALID [2018-11-18 23:03:02,607 INFO L273 TraceCheckUtils]: 18: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-18 23:03:02,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {1500#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1500#false} is VALID [2018-11-18 23:03:02,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {1500#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1500#false} is VALID [2018-11-18 23:03:02,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {1500#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1500#false} is VALID [2018-11-18 23:03:02,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-18 23:03:02,609 INFO L273 TraceCheckUtils]: 23: Hoare triple {1500#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1500#false} is VALID [2018-11-18 23:03:02,610 INFO L273 TraceCheckUtils]: 24: Hoare triple {1500#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1500#false} is VALID [2018-11-18 23:03:02,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {1500#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1500#false} is VALID [2018-11-18 23:03:02,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-18 23:03:02,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {1500#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {1500#false} is VALID [2018-11-18 23:03:02,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {1500#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {1500#false} is VALID [2018-11-18 23:03:02,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {1500#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1500#false} is VALID [2018-11-18 23:03:02,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-18 23:03:02,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {1500#false} assume !(~i~0 < 100000); {1500#false} is VALID [2018-11-18 23:03:02,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {1500#false} ~i~0 := 0; {1500#false} is VALID [2018-11-18 23:03:02,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {1500#false} assume true; {1500#false} is VALID [2018-11-18 23:03:02,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {1500#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {1500#false} is VALID [2018-11-18 23:03:02,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {1500#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {1500#false} is VALID [2018-11-18 23:03:02,612 INFO L256 TraceCheckUtils]: 36: Hoare triple {1500#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {1500#false} is VALID [2018-11-18 23:03:02,613 INFO L273 TraceCheckUtils]: 37: Hoare triple {1500#false} ~cond := #in~cond; {1500#false} is VALID [2018-11-18 23:03:02,613 INFO L273 TraceCheckUtils]: 38: Hoare triple {1500#false} assume 0 == ~cond; {1500#false} is VALID [2018-11-18 23:03:02,613 INFO L273 TraceCheckUtils]: 39: Hoare triple {1500#false} assume !false; {1500#false} is VALID [2018-11-18 23:03:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 23:03:02,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:03:02,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 23:03:02,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-18 23:03:02,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:02,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:03:02,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:02,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:03:02,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:03:02,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:03:02,679 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-11-18 23:03:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:03,238 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2018-11-18 23:03:03,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:03:03,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-18 23:03:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:03:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2018-11-18 23:03:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:03:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2018-11-18 23:03:03,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 118 transitions. [2018-11-18 23:03:03,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:03,460 INFO L225 Difference]: With dead ends: 121 [2018-11-18 23:03:03,460 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 23:03:03,461 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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-18 23:03:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 23:03:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2018-11-18 23:03:03,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:03,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 57 states. [2018-11-18 23:03:03,495 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 57 states. [2018-11-18 23:03:03,495 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 57 states. [2018-11-18 23:03:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:03,500 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2018-11-18 23:03:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2018-11-18 23:03:03,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:03,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:03,502 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 88 states. [2018-11-18 23:03:03,502 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 88 states. [2018-11-18 23:03:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:03,507 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2018-11-18 23:03:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2018-11-18 23:03:03,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:03,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:03,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:03,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 23:03:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-11-18 23:03:03,511 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 40 [2018-11-18 23:03:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:03,512 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-11-18 23:03:03,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:03:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-18 23:03:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 23:03:03,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:03,513 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:03:03,514 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:03,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash 297554044, now seen corresponding path program 3 times [2018-11-18 23:03:03,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:03,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:03,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:03:03,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:03,529 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:03:03,529 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:03:03,530 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-18 23:03:03,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:03:43,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 23:03:43,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:03:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:43,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:43,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {2037#true} call ULTIMATE.init(); {2037#true} is VALID [2018-11-18 23:03:43,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {2037#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2037#true} is VALID [2018-11-18 23:03:43,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-18 23:03:43,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2037#true} {2037#true} #77#return; {2037#true} is VALID [2018-11-18 23:03:43,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {2037#true} call #t~ret11 := main(); {2037#true} is VALID [2018-11-18 23:03:43,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {2037#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {2037#true} is VALID [2018-11-18 23:03:43,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-18 23:03:43,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {2037#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2037#true} is VALID [2018-11-18 23:03:43,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {2037#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2037#true} is VALID [2018-11-18 23:03:43,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-18 23:03:43,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {2037#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2037#true} is VALID [2018-11-18 23:03:43,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {2037#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2037#true} is VALID [2018-11-18 23:03:43,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-18 23:03:43,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {2037#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2037#true} is VALID [2018-11-18 23:03:43,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {2037#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2037#true} is VALID [2018-11-18 23:03:43,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-18 23:03:43,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {2037#true} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2037#true} is VALID [2018-11-18 23:03:43,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {2037#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2037#true} is VALID [2018-11-18 23:03:43,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {2037#true} assume true; {2037#true} is VALID [2018-11-18 23:03:43,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {2037#true} assume !(~i~0 < 100000); {2037#true} is VALID [2018-11-18 23:03:43,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {2037#true} ~i~0 := 0; {2102#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:43,957 INFO L273 TraceCheckUtils]: 21: Hoare triple {2102#(<= main_~i~0 0)} assume true; {2102#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:43,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {2102#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2102#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:43,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {2102#(<= main_~i~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2102#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:43,964 INFO L273 TraceCheckUtils]: 24: Hoare triple {2102#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2115#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:43,965 INFO L273 TraceCheckUtils]: 25: Hoare triple {2115#(<= main_~i~0 1)} assume true; {2115#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:43,965 INFO L273 TraceCheckUtils]: 26: Hoare triple {2115#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2115#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:43,966 INFO L273 TraceCheckUtils]: 27: Hoare triple {2115#(<= main_~i~0 1)} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2115#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:43,966 INFO L273 TraceCheckUtils]: 28: Hoare triple {2115#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2128#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:43,967 INFO L273 TraceCheckUtils]: 29: Hoare triple {2128#(<= main_~i~0 2)} assume true; {2128#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:43,967 INFO L273 TraceCheckUtils]: 30: Hoare triple {2128#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2128#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:43,968 INFO L273 TraceCheckUtils]: 31: Hoare triple {2128#(<= main_~i~0 2)} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2128#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:43,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {2128#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2141#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:43,970 INFO L273 TraceCheckUtils]: 33: Hoare triple {2141#(<= main_~i~0 3)} assume true; {2141#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:43,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {2141#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2141#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:43,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {2141#(<= main_~i~0 3)} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2141#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:43,980 INFO L273 TraceCheckUtils]: 36: Hoare triple {2141#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2154#(<= main_~i~0 4)} is VALID [2018-11-18 23:03:43,981 INFO L273 TraceCheckUtils]: 37: Hoare triple {2154#(<= main_~i~0 4)} assume true; {2154#(<= main_~i~0 4)} is VALID [2018-11-18 23:03:43,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {2154#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2038#false} is VALID [2018-11-18 23:03:43,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {2038#false} ~i~0 := 0; {2038#false} is VALID [2018-11-18 23:03:43,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {2038#false} assume true; {2038#false} is VALID [2018-11-18 23:03:43,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {2038#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {2038#false} is VALID [2018-11-18 23:03:43,982 INFO L273 TraceCheckUtils]: 42: Hoare triple {2038#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {2038#false} is VALID [2018-11-18 23:03:43,982 INFO L256 TraceCheckUtils]: 43: Hoare triple {2038#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {2038#false} is VALID [2018-11-18 23:03:43,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {2038#false} ~cond := #in~cond; {2038#false} is VALID [2018-11-18 23:03:43,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {2038#false} assume 0 == ~cond; {2038#false} is VALID [2018-11-18 23:03:43,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {2038#false} assume !false; {2038#false} is VALID [2018-11-18 23:03:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 23:03:44,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:03:44,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-18 23:03:44,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-18 23:03:44,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:44,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:03:44,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:44,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:03:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:03:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:03:44,101 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 7 states. [2018-11-18 23:03:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:44,672 INFO L93 Difference]: Finished difference Result 139 states and 171 transitions. [2018-11-18 23:03:44,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:03:44,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-18 23:03:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:03:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-18 23:03:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:03:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-18 23:03:44,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 134 transitions. [2018-11-18 23:03:44,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:44,970 INFO L225 Difference]: With dead ends: 139 [2018-11-18 23:03:44,970 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 23:03:44,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:03:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 23:03:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64. [2018-11-18 23:03:45,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:45,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 64 states. [2018-11-18 23:03:45,039 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 64 states. [2018-11-18 23:03:45,039 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 64 states. [2018-11-18 23:03:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:45,044 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-18 23:03:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2018-11-18 23:03:45,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:45,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:45,046 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 102 states. [2018-11-18 23:03:45,046 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 102 states. [2018-11-18 23:03:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:45,051 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-18 23:03:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2018-11-18 23:03:45,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:45,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:45,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:45,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 23:03:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-11-18 23:03:45,055 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 47 [2018-11-18 23:03:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:45,056 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-18 23:03:45,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:03:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-18 23:03:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 23:03:45,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:45,057 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:03:45,057 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:45,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash 356762250, now seen corresponding path program 4 times [2018-11-18 23:03:45,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:45,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:45,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:03:45,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:45,078 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:03:45,078 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:03:45,078 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-18 23:03:45,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:03:45,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:03:45,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:03:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:03:45,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:03:45,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {2658#true} call ULTIMATE.init(); {2658#true} is VALID [2018-11-18 23:03:45,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {2658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2658#true} is VALID [2018-11-18 23:03:45,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {2658#true} assume true; {2658#true} is VALID [2018-11-18 23:03:45,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2658#true} {2658#true} #77#return; {2658#true} is VALID [2018-11-18 23:03:45,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {2658#true} call #t~ret11 := main(); {2658#true} is VALID [2018-11-18 23:03:45,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {2658#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);havoc ~k~0;havoc ~i~0;~i~0 := 0; {2678#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:45,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {2678#(<= main_~i~0 0)} assume true; {2678#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:45,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {2678#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2678#(<= main_~i~0 0)} is VALID [2018-11-18 23:03:45,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {2678#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2688#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:45,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {2688#(<= main_~i~0 1)} assume true; {2688#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:45,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {2688#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2688#(<= main_~i~0 1)} is VALID [2018-11-18 23:03:45,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {2688#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2698#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:45,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {2698#(<= main_~i~0 2)} assume true; {2698#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:45,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {2698#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2698#(<= main_~i~0 2)} is VALID [2018-11-18 23:03:45,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {2698#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2708#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:45,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {2708#(<= main_~i~0 3)} assume true; {2708#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:45,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {2708#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2708#(<= main_~i~0 3)} is VALID [2018-11-18 23:03:45,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {2708#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2718#(<= main_~i~0 4)} is VALID [2018-11-18 23:03:45,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {2718#(<= main_~i~0 4)} assume true; {2718#(<= main_~i~0 4)} is VALID [2018-11-18 23:03:45,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {2718#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~i~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2718#(<= main_~i~0 4)} is VALID [2018-11-18 23:03:45,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {2718#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2728#(<= main_~i~0 5)} is VALID [2018-11-18 23:03:45,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {2728#(<= main_~i~0 5)} assume true; {2728#(<= main_~i~0 5)} is VALID [2018-11-18 23:03:45,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {2728#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2659#false} is VALID [2018-11-18 23:03:45,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {2659#false} ~i~0 := 0; {2659#false} is VALID [2018-11-18 23:03:45,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-18 23:03:45,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-18 23:03:45,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {2659#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2659#false} is VALID [2018-11-18 23:03:45,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2659#false} is VALID [2018-11-18 23:03:45,475 INFO L273 TraceCheckUtils]: 28: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-18 23:03:45,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-18 23:03:45,476 INFO L273 TraceCheckUtils]: 30: Hoare triple {2659#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2659#false} is VALID [2018-11-18 23:03:45,476 INFO L273 TraceCheckUtils]: 31: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2659#false} is VALID [2018-11-18 23:03:45,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-18 23:03:45,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-18 23:03:45,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {2659#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2659#false} is VALID [2018-11-18 23:03:45,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2659#false} is VALID [2018-11-18 23:03:45,478 INFO L273 TraceCheckUtils]: 36: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-18 23:03:45,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-18 23:03:45,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {2659#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2659#false} is VALID [2018-11-18 23:03:45,479 INFO L273 TraceCheckUtils]: 39: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2659#false} is VALID [2018-11-18 23:03:45,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-18 23:03:45,479 INFO L273 TraceCheckUtils]: 41: Hoare triple {2659#false} assume !!(~i~0 < 100000);assume -32768 <= #t~nondet2 && #t~nondet2 <= 32767; {2659#false} is VALID [2018-11-18 23:03:45,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {2659#false} assume 0 != #t~nondet2;havoc #t~nondet2;assume -32768 <= #t~nondet3 && #t~nondet3 <= 32767;~k~0 := #t~nondet3;havoc #t~nondet3;call write~int(~k~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~int(~k~0 * ~k~0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4); {2659#false} is VALID [2018-11-18 23:03:45,480 INFO L273 TraceCheckUtils]: 43: Hoare triple {2659#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2659#false} is VALID [2018-11-18 23:03:45,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-18 23:03:45,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {2659#false} assume !(~i~0 < 100000); {2659#false} is VALID [2018-11-18 23:03:45,481 INFO L273 TraceCheckUtils]: 46: Hoare triple {2659#false} ~i~0 := 0; {2659#false} is VALID [2018-11-18 23:03:45,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {2659#false} assume true; {2659#false} is VALID [2018-11-18 23:03:45,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {2659#false} assume !!(~i~0 < 100000);call #t~mem5 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem6 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem5 == #t~mem6; {2659#false} is VALID [2018-11-18 23:03:45,482 INFO L273 TraceCheckUtils]: 49: Hoare triple {2659#false} assume !#t~short10;call #t~mem9 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call #t~mem8 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 == #t~mem7 * #t~mem8; {2659#false} is VALID [2018-11-18 23:03:45,482 INFO L256 TraceCheckUtils]: 50: Hoare triple {2659#false} call __VERIFIER_assert((if #t~short10 then 1 else 0)); {2659#false} is VALID [2018-11-18 23:03:45,482 INFO L273 TraceCheckUtils]: 51: Hoare triple {2659#false} ~cond := #in~cond; {2659#false} is VALID [2018-11-18 23:03:45,482 INFO L273 TraceCheckUtils]: 52: Hoare triple {2659#false} assume 0 == ~cond; {2659#false} is VALID [2018-11-18 23:03:45,483 INFO L273 TraceCheckUtils]: 53: Hoare triple {2659#false} assume !false; {2659#false} is VALID [2018-11-18 23:03:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 23:03:45,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:03:45,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-18 23:03:45,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-18 23:03:45,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:03:45,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:03:45,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:45,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:03:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:03:45,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:03:45,561 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 8 states. [2018-11-18 23:03:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:46,186 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2018-11-18 23:03:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 23:03:46,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-18 23:03:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:03:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:03:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-18 23:03:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:03:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-18 23:03:46,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 150 transitions. [2018-11-18 23:03:46,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:03:46,509 INFO L225 Difference]: With dead ends: 157 [2018-11-18 23:03:46,509 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 23:03:46,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:03:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 23:03:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 71. [2018-11-18 23:03:46,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:03:46,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 71 states. [2018-11-18 23:03:46,538 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 71 states. [2018-11-18 23:03:46,538 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 71 states. [2018-11-18 23:03:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:46,543 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2018-11-18 23:03:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2018-11-18 23:03:46,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:46,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:46,545 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 116 states. [2018-11-18 23:03:46,545 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 116 states. [2018-11-18 23:03:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:03:46,550 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2018-11-18 23:03:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2018-11-18 23:03:46,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:03:46,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:03:46,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:03:46,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:03:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 23:03:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-11-18 23:03:46,554 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 54 [2018-11-18 23:03:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:03:46,554 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-11-18 23:03:46,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:03:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-11-18 23:03:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 23:03:46,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:03:46,555 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:03:46,555 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:03:46,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:03:46,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1138003474, now seen corresponding path program 5 times [2018-11-18 23:03:46,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:03:46,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:03:46,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:46,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:03:46,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:03:46,574 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:03:46,574 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:03:46,574 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-18 23:03:46,595 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1