/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:02,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:02,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:02,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:02,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:02,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:02,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:02,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:02,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:02,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:02,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:02,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:02,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:02,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:02,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:02,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:02,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:02,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:02,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:02,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:02,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:02,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:02,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:02,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:02,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:02,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:02,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:02,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:02,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:02,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:02,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:02,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:02,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:02,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:02,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:02,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:02,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:02,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:02,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:02,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:02,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:02,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:49:02,906 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:02,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:02,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:02,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:02,908 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:02,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:02,908 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:02,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:02,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:02,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:02,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:02,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:02,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:02,910 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:02,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:02,911 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:02,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:02,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:02,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:02,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:02,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:02,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:02,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:02,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:02,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:02,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:02,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:02,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:02,914 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:02,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:03,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:03,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:03,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:03,309 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:03,310 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:03,311 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-17 22:49:03,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52aaf4013/a0bb7c80a14042f2b28a7796c08b19b3/FLAG57da303c6 [2020-07-17 22:49:03,828 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:03,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-17 22:49:03,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52aaf4013/a0bb7c80a14042f2b28a7796c08b19b3/FLAG57da303c6 [2020-07-17 22:49:04,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52aaf4013/a0bb7c80a14042f2b28a7796c08b19b3 [2020-07-17 22:49:04,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:04,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:04,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:04,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:04,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:04,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a2a688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04, skipping insertion in model container [2020-07-17 22:49:04,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:04,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:04,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:04,500 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:04,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:04,551 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:04,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04 WrapperNode [2020-07-17 22:49:04,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:04,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:04,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:04,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:04,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (1/1) ... [2020-07-17 22:49:04,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:04,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:04,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:04,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:04,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (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 [2020-07-17 22:49:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:04,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:04,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:04,849 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:04,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:05,443 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:05,443 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:49:05,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:05 BoogieIcfgContainer [2020-07-17 22:49:05,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:05,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:05,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:05,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:05,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:04" (1/3) ... [2020-07-17 22:49:05,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe107ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:05, skipping insertion in model container [2020-07-17 22:49:05,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:04" (2/3) ... [2020-07-17 22:49:05,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe107ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:05, skipping insertion in model container [2020-07-17 22:49:05,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:05" (3/3) ... [2020-07-17 22:49:05,463 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn5f.c [2020-07-17 22:49:05,475 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:05,482 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:05,497 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:05,532 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:05,533 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:05,533 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:05,533 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:05,534 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:05,534 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:05,535 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:05,535 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-17 22:49:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:05,576 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:05,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:05,578 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:05,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-17 22:49:05,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:05,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943955576] [2020-07-17 22:49:05,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:05,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {37#true} is VALID [2020-07-17 22:49:05,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-17 22:49:05,871 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-17 22:49:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:05,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-17 22:49:05,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-17 22:49:05,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-17 22:49:05,886 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-17 22:49:05,889 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:05,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {37#true} is VALID [2020-07-17 22:49:05,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-17 22:49:05,890 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-17 22:49:05,891 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2020-07-17 22:49:05,891 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {37#true} is VALID [2020-07-17 22:49:05,892 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~N~0 <= 0); {37#true} is VALID [2020-07-17 22:49:05,892 INFO L263 TraceCheckUtils]: 7: Hoare triple {37#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {37#true} is VALID [2020-07-17 22:49:05,892 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-17 22:49:05,893 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-17 22:49:05,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-17 22:49:05,894 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-17 22:49:05,895 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {38#false} is VALID [2020-07-17 22:49:05,895 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-17 22:49:05,896 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 1; {38#false} is VALID [2020-07-17 22:49:05,896 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-17 22:49:05,896 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-17 22:49:05,897 INFO L280 TraceCheckUtils]: 17: Hoare triple {38#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {38#false} is VALID [2020-07-17 22:49:05,897 INFO L263 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {38#false} is VALID [2020-07-17 22:49:05,898 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2020-07-17 22:49:05,898 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2020-07-17 22:49:05,899 INFO L280 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-17 22:49:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:05,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943955576] [2020-07-17 22:49:05,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:05,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:05,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569322254] [2020-07-17 22:49:05,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:05,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:05,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:06,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:06,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:06,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:06,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:06,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:06,015 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-17 22:49:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:06,292 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-17 22:49:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:06,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-17 22:49:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-17 22:49:06,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-17 22:49:06,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:06,470 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:49:06,470 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:49:06,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:49:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-17 22:49:06,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:06,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:06,561 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:06,561 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:06,566 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:49:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:06,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:06,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:06,568 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:06,568 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:06,572 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-17 22:49:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:06,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:06,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:06,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:06,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:49:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-17 22:49:06,579 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-17 22:49:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:06,579 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-17 22:49:06,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-17 22:49:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:06,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:06,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:06,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:06,582 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:06,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-17 22:49:06,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:06,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393450969] [2020-07-17 22:49:06,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:06,614 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:06,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009487451] [2020-07-17 22:49:06,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:49:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:06,680 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:49:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:06,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:06,824 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-07-17 22:49:06,826 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-07-17 22:49:06,827 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:06,835 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:06,838 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 22:49:06,839 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:15 [2020-07-17 22:49:06,846 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:06,847 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, main_~a~0.base, main_~a~0.offset]. (= (let ((.cse0 (store |v_#memory_int_11| main_~a~0.base (store (select |v_#memory_int_11| main_~a~0.base) main_~a~0.offset 1)))) (store .cse0 main_~b~0.base (store (select .cse0 main_~b~0.base) main_~b~0.offset 1))) |#memory_int|) [2020-07-17 22:49:06,847 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~a~0.base, main_~a~0.offset]. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2020-07-17 22:49:06,954 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:06,955 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-17 22:49:06,959 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-17 22:49:06,977 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-17 22:49:06,977 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:06,978 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-17 22:49:06,984 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:06,984 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~b~0.base, main_~b~0.offset]. (let ((.cse0 (select |#memory_int| main_~b~0.base))) (and (= (select .cse0 main_~b~0.offset) 1) (= (select .cse0 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|) (= 0 main_~i~0))) [2020-07-17 22:49:06,984 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-17 22:49:07,063 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2020-07-17 22:49:07,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-17 22:49:07,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:07,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-17 22:49:07,065 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret10 := main(); {221#true} is VALID [2020-07-17 22:49:07,066 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-17 22:49:07,066 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {221#true} is VALID [2020-07-17 22:49:07,067 INFO L263 TraceCheckUtils]: 7: Hoare triple {221#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-17 22:49:07,067 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:49:07,067 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:49:07,068 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:07,068 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {221#true} #77#return; {221#true} is VALID [2020-07-17 22:49:07,071 INFO L280 TraceCheckUtils]: 12: Hoare triple {221#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:07,072 INFO L280 TraceCheckUtils]: 13: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} assume !(~i~0 < ~N~0); {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:07,074 INFO L280 TraceCheckUtils]: 14: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} ~i~0 := 1; {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:07,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} assume !(~i~0 < ~N~0); {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:07,077 INFO L280 TraceCheckUtils]: 16: Hoare triple {262#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} ~i~0 := 0; {275#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:07,079 INFO L280 TraceCheckUtils]: 17: Hoare triple {275#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {279#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-17 22:49:07,081 INFO L263 TraceCheckUtils]: 18: Hoare triple {279#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:07,082 INFO L280 TraceCheckUtils]: 19: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:07,083 INFO L280 TraceCheckUtils]: 20: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {222#false} is VALID [2020-07-17 22:49:07,083 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-17 22:49:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:07,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393450969] [2020-07-17 22:49:07,089 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:07,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009487451] [2020-07-17 22:49:07,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:07,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:49:07,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120749154] [2020-07-17 22:49:07,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:49:07,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:07,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:49:07,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:07,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:49:07,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:49:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:07,137 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-17 22:49:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,593 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-17 22:49:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:49:07,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-17 22:49:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-17 22:49:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2020-07-17 22:49:07,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2020-07-17 22:49:07,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:07,698 INFO L225 Difference]: With dead ends: 47 [2020-07-17 22:49:07,698 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 22:49:07,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:49:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 22:49:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-17 22:49:07,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:07,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 39 states. [2020-07-17 22:49:07,735 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 39 states. [2020-07-17 22:49:07,736 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 39 states. [2020-07-17 22:49:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,741 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-17 22:49:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-17 22:49:07,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:07,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:07,743 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 45 states. [2020-07-17 22:49:07,743 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 45 states. [2020-07-17 22:49:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,748 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-17 22:49:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-17 22:49:07,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:07,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:07,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:07,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:49:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-17 22:49:07,754 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-17 22:49:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:07,754 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-17 22:49:07,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:49:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-17 22:49:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:07,756 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:07,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:07,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:49:07,971 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:07,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-17 22:49:07,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:07,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810112774] [2020-07-17 22:49:07,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:08,000 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:08,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035074571] [2020-07-17 22:49:08,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:49:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:49:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:08,163 INFO L263 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2020-07-17 22:49:08,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {507#true} is VALID [2020-07-17 22:49:08,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2020-07-17 22:49:08,164 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #81#return; {507#true} is VALID [2020-07-17 22:49:08,165 INFO L263 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret10 := main(); {507#true} is VALID [2020-07-17 22:49:08,165 INFO L280 TraceCheckUtils]: 5: Hoare triple {507#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {507#true} is VALID [2020-07-17 22:49:08,165 INFO L280 TraceCheckUtils]: 6: Hoare triple {507#true} assume !(~N~0 <= 0); {507#true} is VALID [2020-07-17 22:49:08,165 INFO L263 TraceCheckUtils]: 7: Hoare triple {507#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {507#true} is VALID [2020-07-17 22:49:08,166 INFO L280 TraceCheckUtils]: 8: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2020-07-17 22:49:08,166 INFO L280 TraceCheckUtils]: 9: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2020-07-17 22:49:08,166 INFO L280 TraceCheckUtils]: 10: Hoare triple {507#true} assume true; {507#true} is VALID [2020-07-17 22:49:08,167 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {507#true} {507#true} #77#return; {507#true} is VALID [2020-07-17 22:49:08,168 INFO L280 TraceCheckUtils]: 12: Hoare triple {507#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {548#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:08,169 INFO L280 TraceCheckUtils]: 13: Hoare triple {548#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {552#(<= ~N~0 1)} is VALID [2020-07-17 22:49:08,170 INFO L280 TraceCheckUtils]: 14: Hoare triple {552#(<= ~N~0 1)} ~i~0 := 1; {556#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:08,172 INFO L280 TraceCheckUtils]: 15: Hoare triple {556#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {508#false} is VALID [2020-07-17 22:49:08,172 INFO L280 TraceCheckUtils]: 16: Hoare triple {508#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {508#false} is VALID [2020-07-17 22:49:08,173 INFO L280 TraceCheckUtils]: 17: Hoare triple {508#false} assume !(~i~0 < ~N~0); {508#false} is VALID [2020-07-17 22:49:08,173 INFO L280 TraceCheckUtils]: 18: Hoare triple {508#false} ~i~0 := 0; {508#false} is VALID [2020-07-17 22:49:08,173 INFO L280 TraceCheckUtils]: 19: Hoare triple {508#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {508#false} is VALID [2020-07-17 22:49:08,173 INFO L263 TraceCheckUtils]: 20: Hoare triple {508#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {508#false} is VALID [2020-07-17 22:49:08,174 INFO L280 TraceCheckUtils]: 21: Hoare triple {508#false} ~cond := #in~cond; {508#false} is VALID [2020-07-17 22:49:08,174 INFO L280 TraceCheckUtils]: 22: Hoare triple {508#false} assume 0 == ~cond; {508#false} is VALID [2020-07-17 22:49:08,174 INFO L280 TraceCheckUtils]: 23: Hoare triple {508#false} assume !false; {508#false} is VALID [2020-07-17 22:49:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:08,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810112774] [2020-07-17 22:49:08,176 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:08,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035074571] [2020-07-17 22:49:08,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:08,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:08,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269746270] [2020-07-17 22:49:08,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:08,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:08,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:08,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:08,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:08,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:08,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:08,209 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-17 22:49:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,528 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-17 22:49:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:08,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-17 22:49:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-17 22:49:08,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2020-07-17 22:49:08,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,684 INFO L225 Difference]: With dead ends: 71 [2020-07-17 22:49:08,685 INFO L226 Difference]: Without dead ends: 58 [2020-07-17 22:49:08,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-17 22:49:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-17 22:49:08,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:08,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 39 states. [2020-07-17 22:49:08,740 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 39 states. [2020-07-17 22:49:08,740 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 39 states. [2020-07-17 22:49:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,744 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-17 22:49:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-17 22:49:08,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,745 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 58 states. [2020-07-17 22:49:08,745 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 58 states. [2020-07-17 22:49:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,750 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-17 22:49:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2020-07-17 22:49:08,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:08,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:49:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-17 22:49:08,754 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-17 22:49:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:08,755 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-17 22:49:08,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-17 22:49:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:08,756 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:08,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:08,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:08,971 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-17 22:49:08,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:08,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248625584] [2020-07-17 22:49:08,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:08,999 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:08,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766224943] [2020-07-17 22:49:09,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:49:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:49:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:09,142 INFO L263 TraceCheckUtils]: 0: Hoare triple {856#true} call ULTIMATE.init(); {856#true} is VALID [2020-07-17 22:49:09,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {856#true} is VALID [2020-07-17 22:49:09,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {856#true} assume true; {856#true} is VALID [2020-07-17 22:49:09,143 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {856#true} {856#true} #81#return; {856#true} is VALID [2020-07-17 22:49:09,144 INFO L263 TraceCheckUtils]: 4: Hoare triple {856#true} call #t~ret10 := main(); {856#true} is VALID [2020-07-17 22:49:09,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {856#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {856#true} is VALID [2020-07-17 22:49:09,145 INFO L280 TraceCheckUtils]: 6: Hoare triple {856#true} assume !(~N~0 <= 0); {856#true} is VALID [2020-07-17 22:49:09,145 INFO L263 TraceCheckUtils]: 7: Hoare triple {856#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {856#true} is VALID [2020-07-17 22:49:09,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {856#true} ~cond := #in~cond; {856#true} is VALID [2020-07-17 22:49:09,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {856#true} assume !(0 == ~cond); {856#true} is VALID [2020-07-17 22:49:09,146 INFO L280 TraceCheckUtils]: 10: Hoare triple {856#true} assume true; {856#true} is VALID [2020-07-17 22:49:09,146 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {856#true} {856#true} #77#return; {856#true} is VALID [2020-07-17 22:49:09,148 INFO L280 TraceCheckUtils]: 12: Hoare triple {856#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {897#(<= 1 main_~i~0)} is VALID [2020-07-17 22:49:09,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {897#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {901#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:09,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {901#(<= 2 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {901#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:09,155 INFO L280 TraceCheckUtils]: 15: Hoare triple {901#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {901#(<= 2 ~N~0)} is VALID [2020-07-17 22:49:09,156 INFO L280 TraceCheckUtils]: 16: Hoare triple {901#(<= 2 ~N~0)} ~i~0 := 1; {911#(and (<= 2 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:49:09,160 INFO L280 TraceCheckUtils]: 17: Hoare triple {911#(and (<= 2 ~N~0) (<= main_~i~0 1))} assume !(~i~0 < ~N~0); {857#false} is VALID [2020-07-17 22:49:09,161 INFO L280 TraceCheckUtils]: 18: Hoare triple {857#false} ~i~0 := 0; {857#false} is VALID [2020-07-17 22:49:09,161 INFO L280 TraceCheckUtils]: 19: Hoare triple {857#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {857#false} is VALID [2020-07-17 22:49:09,161 INFO L263 TraceCheckUtils]: 20: Hoare triple {857#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {857#false} is VALID [2020-07-17 22:49:09,162 INFO L280 TraceCheckUtils]: 21: Hoare triple {857#false} ~cond := #in~cond; {857#false} is VALID [2020-07-17 22:49:09,162 INFO L280 TraceCheckUtils]: 22: Hoare triple {857#false} assume 0 == ~cond; {857#false} is VALID [2020-07-17 22:49:09,162 INFO L280 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2020-07-17 22:49:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:09,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248625584] [2020-07-17 22:49:09,164 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:09,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766224943] [2020-07-17 22:49:09,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:09,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-17 22:49:09,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021400709] [2020-07-17 22:49:09,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:09,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:09,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:09,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:09,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:09,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:09,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:09,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:09,204 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2020-07-17 22:49:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,521 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-17 22:49:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:49:09,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-17 22:49:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-17 22:49:09,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2020-07-17 22:49:09,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:09,621 INFO L225 Difference]: With dead ends: 66 [2020-07-17 22:49:09,621 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 22:49:09,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 22:49:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-17 22:49:09,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:09,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 40 states. [2020-07-17 22:49:09,661 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 40 states. [2020-07-17 22:49:09,662 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 40 states. [2020-07-17 22:49:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,666 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-17 22:49:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:49:09,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:09,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:09,667 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 55 states. [2020-07-17 22:49:09,667 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 55 states. [2020-07-17 22:49:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,671 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-17 22:49:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:49:09,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:09,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:09,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:09,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:49:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-17 22:49:09,675 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-17 22:49:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:09,675 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-17 22:49:09,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-17 22:49:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:49:09,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:09,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:09,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:09,884 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-17 22:49:09,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:09,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637391387] [2020-07-17 22:49:09,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:09,909 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:09,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537006535] [2020-07-17 22:49:09,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:49:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-17 22:49:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:10,036 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-17 22:49:10,038 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:10,046 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:10,056 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-17 22:49:10,056 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:10,068 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:10,069 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:10,070 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-17 22:49:10,074 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:10,074 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, |v_#valid_10|]. (and (= (let ((.cse0 (store |v_#memory_int_12| main_~a~0.base (store (select |v_#memory_int_12| main_~a~0.base) main_~a~0.offset 1)))) (store .cse0 main_~b~0.base (store (select .cse0 main_~b~0.base) main_~b~0.offset 1))) |#memory_int|) (<= (select (store |v_#valid_10| main_~a~0.base 1) main_~b~0.base) 0)) [2020-07-17 22:49:10,075 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) [2020-07-17 22:49:10,156 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-17 22:49:10,157 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-17 22:49:10,165 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:10,200 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-17 22:49:10,209 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:10,221 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:49:10,222 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-17 22:49:10,235 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:10,236 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, main_~i~0]. (let ((.cse0 (select |v_#memory_int_13| main_~a~0.base))) (and (= 1 (select .cse0 main_~a~0.offset)) (= 1 (select (select |v_#memory_int_13| main_~b~0.base) main_~b~0.offset)) (= (store |v_#memory_int_13| main_~a~0.base (let ((.cse1 (* main_~i~0 8))) (store .cse0 (+ .cse1 main_~a~0.offset) (+ (select .cse0 (+ .cse1 main_~a~0.offset (- 8))) 10)))) |#memory_int|) (not (= main_~a~0.base main_~b~0.base)))) [2020-07-17 22:49:10,236 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse2 (* main_~i~0 8))) (let ((.cse1 (select |#memory_int| main_~a~0.base)) (.cse0 (+ .cse2 main_~a~0.offset))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (or (= main_~a~0.offset .cse0) (= 1 (select .cse1 main_~a~0.offset))) (= (+ (select .cse1 (+ .cse2 main_~a~0.offset (- 8))) 10) (select .cse1 .cse0)) (not (= main_~a~0.base main_~b~0.base))))) [2020-07-17 22:49:10,239 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:10,283 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:10,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:10,409 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:10,517 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-17 22:49:10,518 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:10,560 INFO L440 ElimStorePlain]: Different costs {12=[|v_#memory_int_14|], 20=[v_prenex_3]} [2020-07-17 22:49:10,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:10,583 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-17 22:49:10,584 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2020-07-17 22:49:10,592 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:10,656 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:10,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:10,715 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-17 22:49:10,716 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2020-07-17 22:49:10,726 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:10,811 INFO L624 ElimStorePlain]: treesize reduction 53, result has 65.6 percent of original size [2020-07-17 22:49:10,819 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2020-07-17 22:49:10,819 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:101 [2020-07-17 22:49:10,833 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:10,834 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_3, v_prenex_4, v_prenex_2, v_prenex_1, |v_#memory_int_14|, main_~a~0.base, main_~a~0.offset]. (let ((.cse2 (+ main_~b~0.offset 8))) (or (let ((.cse4 (select |v_#memory_int_14| main_~a~0.base)) (.cse1 (select |v_#memory_int_14| main_~b~0.base))) (let ((.cse0 (select .cse1 main_~b~0.offset)) (.cse3 (select .cse4 main_~a~0.offset))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_14| main_~b~0.base (store .cse1 .cse2 (+ .cse3 .cse0)))) (not (= main_~a~0.base main_~b~0.base)) (= (+ (select .cse4 (+ main_~a~0.offset (- 8))) 10) .cse3)))) (let ((.cse9 (select v_prenex_3 main_~b~0.base)) (.cse6 (select v_prenex_3 v_prenex_4))) (let ((.cse8 (select .cse6 v_prenex_2)) (.cse5 (select .cse9 main_~b~0.offset))) (and (= 1 .cse5) (let ((.cse7 (* v_prenex_1 8))) (= (select .cse6 (+ .cse7 v_prenex_2)) (+ (select .cse6 (+ .cse7 v_prenex_2 (- 8))) 10))) (not (= v_prenex_4 main_~b~0.base)) (= 1 .cse8) (= |#memory_int| (store v_prenex_3 main_~b~0.base (store .cse9 .cse2 (+ .cse8 .cse5))))))))) [2020-07-17 22:49:10,834 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_4, v_prenex_2, v_prenex_1, main_~a~0.base, main_~a~0.offset]. (let ((.cse7 (select |#memory_int| main_~b~0.base))) (let ((.cse0 (= (select .cse7 main_~b~0.offset) 1)) (.cse1 (select .cse7 (+ main_~b~0.offset 8)))) (or (let ((.cse3 (select |#memory_int| main_~a~0.base))) (let ((.cse2 (select .cse3 (+ main_~a~0.offset (- 8))))) (and .cse0 (= .cse1 (+ .cse2 11)) (= (+ .cse2 10) (select .cse3 main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (let ((.cse5 (select |#memory_int| v_prenex_4))) (let ((.cse4 (select .cse5 v_prenex_2))) (and .cse0 (= (+ .cse4 1) .cse1) (let ((.cse6 (* v_prenex_1 8))) (= (+ (select .cse5 (+ v_prenex_2 .cse6 (- 8))) 10) (select .cse5 (+ v_prenex_2 .cse6)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 .cse4))))))) [2020-07-17 22:49:13,609 WARN L193 SmtUtils]: Spent 2.61 s on a formula simplification that was a NOOP. DAG size: 49 [2020-07-17 22:49:16,254 WARN L193 SmtUtils]: Spent 2.47 s on a formula simplification that was a NOOP. DAG size: 52 [2020-07-17 22:49:16,270 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:16,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:16,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:49:16,331 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:16,335 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:49:16,366 INFO L350 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2020-07-17 22:49:16,367 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 45 [2020-07-17 22:49:16,375 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:49:16,376 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:49:16,388 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,432 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-17 22:49:16,433 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 43 [2020-07-17 22:49:16,439 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-17 22:49:16,484 INFO L624 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2020-07-17 22:49:16,488 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,489 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:7 [2020-07-17 22:49:16,501 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:16,502 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_prenex_4, v_prenex_2, main_~b~0.base, main_~b~0.offset, v_prenex_1, main_~a~0.base, main_~a~0.offset]. (let ((.cse9 (select |#memory_int| main_~b~0.base))) (let ((.cse0 (= (select .cse9 main_~b~0.offset) 1)) (.cse2 (select .cse9 (+ main_~b~0.offset 8))) (.cse5 (= (select .cse9 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|)) (.cse6 (= 0 main_~i~0))) (or (let ((.cse3 (select |#memory_int| v_prenex_4))) (let ((.cse1 (select .cse3 v_prenex_2))) (and .cse0 (= (+ .cse1 1) .cse2) (let ((.cse4 (* v_prenex_1 8))) (= (+ (select .cse3 (+ v_prenex_2 .cse4 (- 8))) 10) (select .cse3 (+ v_prenex_2 .cse4)))) .cse5 (not (= v_prenex_4 main_~b~0.base)) .cse6 (= 1 .cse1)))) (let ((.cse8 (select |#memory_int| main_~a~0.base))) (let ((.cse7 (select .cse8 (+ main_~a~0.offset (- 8))))) (and .cse0 (= .cse2 (+ .cse7 11)) .cse5 (= (+ .cse7 10) (select .cse8 main_~a~0.offset)) .cse6 (not (= main_~a~0.base main_~b~0.base)))))))) [2020-07-17 22:49:16,502 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-17 22:49:16,588 INFO L263 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2020-07-17 22:49:16,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1194#true} is VALID [2020-07-17 22:49:16,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-17 22:49:16,589 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #81#return; {1194#true} is VALID [2020-07-17 22:49:16,590 INFO L263 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret10 := main(); {1194#true} is VALID [2020-07-17 22:49:16,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {1194#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1194#true} is VALID [2020-07-17 22:49:16,590 INFO L280 TraceCheckUtils]: 6: Hoare triple {1194#true} assume !(~N~0 <= 0); {1194#true} is VALID [2020-07-17 22:49:16,591 INFO L263 TraceCheckUtils]: 7: Hoare triple {1194#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1194#true} is VALID [2020-07-17 22:49:16,591 INFO L280 TraceCheckUtils]: 8: Hoare triple {1194#true} ~cond := #in~cond; {1194#true} is VALID [2020-07-17 22:49:16,591 INFO L280 TraceCheckUtils]: 9: Hoare triple {1194#true} assume !(0 == ~cond); {1194#true} is VALID [2020-07-17 22:49:16,592 INFO L280 TraceCheckUtils]: 10: Hoare triple {1194#true} assume true; {1194#true} is VALID [2020-07-17 22:49:16,592 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1194#true} {1194#true} #77#return; {1194#true} is VALID [2020-07-17 22:49:16,597 INFO L280 TraceCheckUtils]: 12: Hoare triple {1194#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {1235#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,600 INFO L280 TraceCheckUtils]: 13: Hoare triple {1235#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,602 INFO L280 TraceCheckUtils]: 14: Hoare triple {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,603 INFO L280 TraceCheckUtils]: 15: Hoare triple {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} assume !(~i~0 < ~N~0); {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,614 INFO L280 TraceCheckUtils]: 16: Hoare triple {1239#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} ~i~0 := 1; {1249#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (exists ((v_prenex_1 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset)))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-17 22:49:18,653 INFO L280 TraceCheckUtils]: 17: Hoare triple {1249#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (exists ((v_prenex_1 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_1 8) main_~a~0.offset)))) (not (= main_~a~0.base main_~b~0.base))))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} is UNKNOWN [2020-07-17 22:49:18,656 INFO L280 TraceCheckUtils]: 18: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} is VALID [2020-07-17 22:49:18,657 INFO L280 TraceCheckUtils]: 19: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} assume !(~i~0 < ~N~0); {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} is VALID [2020-07-17 22:49:18,664 INFO L280 TraceCheckUtils]: 20: Hoare triple {1253#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2))))))} ~i~0 := 0; {1263#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2)))) (= 0 main_~i~0)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))))} is VALID [2020-07-17 22:49:18,669 INFO L280 TraceCheckUtils]: 21: Hoare triple {1263#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (= (+ (select (select |#memory_int| v_prenex_4) v_prenex_2) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8) (- 8))) 10) (select (select |#memory_int| v_prenex_4) (+ v_prenex_2 (* v_prenex_1 8)))) (not (= v_prenex_4 main_~b~0.base)) (= 1 (select (select |#memory_int| v_prenex_4) v_prenex_2)))) (= 0 main_~i~0)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 11)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))))))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1267#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-17 22:49:18,675 INFO L263 TraceCheckUtils]: 22: Hoare triple {1267#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {1271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:18,677 INFO L280 TraceCheckUtils]: 23: Hoare triple {1271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:18,677 INFO L280 TraceCheckUtils]: 24: Hoare triple {1275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1195#false} is VALID [2020-07-17 22:49:18,678 INFO L280 TraceCheckUtils]: 25: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2020-07-17 22:49:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:18,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637391387] [2020-07-17 22:49:18,684 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:18,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537006535] [2020-07-17 22:49:18,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:18,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 22:49:18,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485475558] [2020-07-17 22:49:18,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:49:18,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:18,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:49:24,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 23 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:24,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:49:24,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:49:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:49:24,853 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 10 states. [2020-07-17 22:49:39,818 WARN L193 SmtUtils]: Spent 7.29 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-07-17 22:49:50,886 WARN L193 SmtUtils]: Spent 10.83 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-07-17 22:50:04,458 WARN L193 SmtUtils]: Spent 11.17 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2020-07-17 22:50:13,376 WARN L193 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2020-07-17 22:50:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:23,650 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-07-17 22:50:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:50:23,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 22:50:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2020-07-17 22:50:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2020-07-17 22:50:23,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2020-07-17 22:50:32,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 66 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:32,223 INFO L225 Difference]: With dead ends: 69 [2020-07-17 22:50:32,223 INFO L226 Difference]: Without dead ends: 67 [2020-07-17 22:50:32,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2020-07-17 22:50:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-17 22:50:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2020-07-17 22:50:32,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:32,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2020-07-17 22:50:32,328 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2020-07-17 22:50:32,328 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2020-07-17 22:50:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:32,332 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-17 22:50:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-17 22:50:32,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:32,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:32,333 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2020-07-17 22:50:32,334 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2020-07-17 22:50:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:32,339 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2020-07-17 22:50:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2020-07-17 22:50:32,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:32,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:32,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:32,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:50:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-07-17 22:50:32,347 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 26 [2020-07-17 22:50:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:32,347 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-07-17 22:50:32,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:50:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-07-17 22:50:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:50:32,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:32,348 INFO L422 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, 1, 1] [2020-07-17 22:50:32,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:32,551 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1499578309, now seen corresponding path program 2 times [2020-07-17 22:50:32,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:32,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067778740] [2020-07-17 22:50:32,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,800 INFO L280 TraceCheckUtils]: 0: Hoare triple {1604#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1590#true} is VALID [2020-07-17 22:50:32,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {1590#true} assume true; {1590#true} is VALID [2020-07-17 22:50:32,801 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1590#true} {1590#true} #81#return; {1590#true} is VALID [2020-07-17 22:50:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {1590#true} ~cond := #in~cond; {1590#true} is VALID [2020-07-17 22:50:32,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {1590#true} assume !(0 == ~cond); {1590#true} is VALID [2020-07-17 22:50:32,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {1590#true} assume true; {1590#true} is VALID [2020-07-17 22:50:32,810 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1590#true} {1590#true} #77#return; {1590#true} is VALID [2020-07-17 22:50:32,811 INFO L263 TraceCheckUtils]: 0: Hoare triple {1590#true} call ULTIMATE.init(); {1604#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:32,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {1604#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1590#true} is VALID [2020-07-17 22:50:32,812 INFO L280 TraceCheckUtils]: 2: Hoare triple {1590#true} assume true; {1590#true} is VALID [2020-07-17 22:50:32,812 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1590#true} {1590#true} #81#return; {1590#true} is VALID [2020-07-17 22:50:32,812 INFO L263 TraceCheckUtils]: 4: Hoare triple {1590#true} call #t~ret10 := main(); {1590#true} is VALID [2020-07-17 22:50:32,812 INFO L280 TraceCheckUtils]: 5: Hoare triple {1590#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1590#true} is VALID [2020-07-17 22:50:32,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {1590#true} assume !(~N~0 <= 0); {1590#true} is VALID [2020-07-17 22:50:32,812 INFO L263 TraceCheckUtils]: 7: Hoare triple {1590#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1590#true} is VALID [2020-07-17 22:50:32,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {1590#true} ~cond := #in~cond; {1590#true} is VALID [2020-07-17 22:50:32,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {1590#true} assume !(0 == ~cond); {1590#true} is VALID [2020-07-17 22:50:32,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {1590#true} assume true; {1590#true} is VALID [2020-07-17 22:50:32,813 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1590#true} {1590#true} #77#return; {1590#true} is VALID [2020-07-17 22:50:32,815 INFO L280 TraceCheckUtils]: 12: Hoare triple {1590#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {1599#(= 1 main_~i~0)} is VALID [2020-07-17 22:50:32,816 INFO L280 TraceCheckUtils]: 13: Hoare triple {1599#(= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1599#(= 1 main_~i~0)} is VALID [2020-07-17 22:50:32,817 INFO L280 TraceCheckUtils]: 14: Hoare triple {1599#(= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1600#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:32,819 INFO L280 TraceCheckUtils]: 15: Hoare triple {1600#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1601#(<= ~N~0 2)} is VALID [2020-07-17 22:50:32,821 INFO L280 TraceCheckUtils]: 16: Hoare triple {1601#(<= ~N~0 2)} ~i~0 := 1; {1602#(and (<= ~N~0 2) (= 1 main_~i~0))} is VALID [2020-07-17 22:50:32,823 INFO L280 TraceCheckUtils]: 17: Hoare triple {1602#(and (<= ~N~0 2) (= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1602#(and (<= ~N~0 2) (= 1 main_~i~0))} is VALID [2020-07-17 22:50:32,824 INFO L280 TraceCheckUtils]: 18: Hoare triple {1602#(and (<= ~N~0 2) (= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1603#(<= ~N~0 main_~i~0)} is VALID [2020-07-17 22:50:32,825 INFO L280 TraceCheckUtils]: 19: Hoare triple {1603#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1591#false} is VALID [2020-07-17 22:50:32,826 INFO L280 TraceCheckUtils]: 20: Hoare triple {1591#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1591#false} is VALID [2020-07-17 22:50:32,826 INFO L280 TraceCheckUtils]: 21: Hoare triple {1591#false} assume !(~i~0 < ~N~0); {1591#false} is VALID [2020-07-17 22:50:32,826 INFO L280 TraceCheckUtils]: 22: Hoare triple {1591#false} ~i~0 := 0; {1591#false} is VALID [2020-07-17 22:50:32,826 INFO L280 TraceCheckUtils]: 23: Hoare triple {1591#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1591#false} is VALID [2020-07-17 22:50:32,826 INFO L263 TraceCheckUtils]: 24: Hoare triple {1591#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {1591#false} is VALID [2020-07-17 22:50:32,827 INFO L280 TraceCheckUtils]: 25: Hoare triple {1591#false} ~cond := #in~cond; {1591#false} is VALID [2020-07-17 22:50:32,827 INFO L280 TraceCheckUtils]: 26: Hoare triple {1591#false} assume 0 == ~cond; {1591#false} is VALID [2020-07-17 22:50:32,827 INFO L280 TraceCheckUtils]: 27: Hoare triple {1591#false} assume !false; {1591#false} is VALID [2020-07-17 22:50:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:32,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067778740] [2020-07-17 22:50:32,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220584411] [2020-07-17 22:50:32,829 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-07-17 22:50:32,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:32,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:32,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:33,103 INFO L263 TraceCheckUtils]: 0: Hoare triple {1590#true} call ULTIMATE.init(); {1590#true} is VALID [2020-07-17 22:50:33,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {1590#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1590#true} is VALID [2020-07-17 22:50:33,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {1590#true} assume true; {1590#true} is VALID [2020-07-17 22:50:33,104 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1590#true} {1590#true} #81#return; {1590#true} is VALID [2020-07-17 22:50:33,104 INFO L263 TraceCheckUtils]: 4: Hoare triple {1590#true} call #t~ret10 := main(); {1590#true} is VALID [2020-07-17 22:50:33,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {1590#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1590#true} is VALID [2020-07-17 22:50:33,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {1590#true} assume !(~N~0 <= 0); {1590#true} is VALID [2020-07-17 22:50:33,105 INFO L263 TraceCheckUtils]: 7: Hoare triple {1590#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1590#true} is VALID [2020-07-17 22:50:33,105 INFO L280 TraceCheckUtils]: 8: Hoare triple {1590#true} ~cond := #in~cond; {1590#true} is VALID [2020-07-17 22:50:33,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {1590#true} assume !(0 == ~cond); {1590#true} is VALID [2020-07-17 22:50:33,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {1590#true} assume true; {1590#true} is VALID [2020-07-17 22:50:33,106 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1590#true} {1590#true} #77#return; {1590#true} is VALID [2020-07-17 22:50:33,108 INFO L280 TraceCheckUtils]: 12: Hoare triple {1590#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {1644#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:33,110 INFO L280 TraceCheckUtils]: 13: Hoare triple {1644#(<= main_~i~0 1)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1644#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:33,121 INFO L280 TraceCheckUtils]: 14: Hoare triple {1644#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1600#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:33,124 INFO L280 TraceCheckUtils]: 15: Hoare triple {1600#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {1601#(<= ~N~0 2)} is VALID [2020-07-17 22:50:33,126 INFO L280 TraceCheckUtils]: 16: Hoare triple {1601#(<= ~N~0 2)} ~i~0 := 1; {1657#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:50:33,128 INFO L280 TraceCheckUtils]: 17: Hoare triple {1657#(and (<= ~N~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1657#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:50:33,133 INFO L280 TraceCheckUtils]: 18: Hoare triple {1657#(and (<= ~N~0 2) (<= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1664#(and (<= ~N~0 2) (<= 2 main_~i~0))} is VALID [2020-07-17 22:50:33,137 INFO L280 TraceCheckUtils]: 19: Hoare triple {1664#(and (<= ~N~0 2) (<= 2 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1591#false} is VALID [2020-07-17 22:50:33,138 INFO L280 TraceCheckUtils]: 20: Hoare triple {1591#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1591#false} is VALID [2020-07-17 22:50:33,138 INFO L280 TraceCheckUtils]: 21: Hoare triple {1591#false} assume !(~i~0 < ~N~0); {1591#false} is VALID [2020-07-17 22:50:33,138 INFO L280 TraceCheckUtils]: 22: Hoare triple {1591#false} ~i~0 := 0; {1591#false} is VALID [2020-07-17 22:50:33,139 INFO L280 TraceCheckUtils]: 23: Hoare triple {1591#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1591#false} is VALID [2020-07-17 22:50:33,139 INFO L263 TraceCheckUtils]: 24: Hoare triple {1591#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {1591#false} is VALID [2020-07-17 22:50:33,139 INFO L280 TraceCheckUtils]: 25: Hoare triple {1591#false} ~cond := #in~cond; {1591#false} is VALID [2020-07-17 22:50:33,139 INFO L280 TraceCheckUtils]: 26: Hoare triple {1591#false} assume 0 == ~cond; {1591#false} is VALID [2020-07-17 22:50:33,140 INFO L280 TraceCheckUtils]: 27: Hoare triple {1591#false} assume !false; {1591#false} is VALID [2020-07-17 22:50:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:33,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:33,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-17 22:50:33,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320157074] [2020-07-17 22:50:33,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:50:33,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:33,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:50:33,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:33,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:50:33,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:33,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:50:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:50:33,263 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 11 states. [2020-07-17 22:50:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:37,119 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-07-17 22:50:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:50:37,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:50:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:50:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2020-07-17 22:50:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:50:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2020-07-17 22:50:37,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 87 transitions. [2020-07-17 22:50:37,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:37,416 INFO L225 Difference]: With dead ends: 84 [2020-07-17 22:50:37,417 INFO L226 Difference]: Without dead ends: 71 [2020-07-17 22:50:37,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:50:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-17 22:50:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 45. [2020-07-17 22:50:39,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:39,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 45 states. [2020-07-17 22:50:39,553 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 45 states. [2020-07-17 22:50:39,553 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 45 states. [2020-07-17 22:50:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:39,557 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-17 22:50:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-17 22:50:39,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:39,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:39,558 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 71 states. [2020-07-17 22:50:39,558 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 71 states. [2020-07-17 22:50:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:39,563 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-17 22:50:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2020-07-17 22:50:39,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:39,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:39,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:39,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:50:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-17 22:50:39,566 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28 [2020-07-17 22:50:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:39,569 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-17 22:50:39,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:50:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-17 22:50:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:50:39,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:39,572 INFO L422 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, 1, 1] [2020-07-17 22:50:39,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:50:39,787 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1048027141, now seen corresponding path program 3 times [2020-07-17 22:50:39,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:39,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409446879] [2020-07-17 22:50:39,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:39,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {2041#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2027#true} is VALID [2020-07-17 22:50:39,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {2027#true} assume true; {2027#true} is VALID [2020-07-17 22:50:39,983 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2027#true} {2027#true} #81#return; {2027#true} is VALID [2020-07-17 22:50:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:39,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {2027#true} ~cond := #in~cond; {2027#true} is VALID [2020-07-17 22:50:39,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {2027#true} assume !(0 == ~cond); {2027#true} is VALID [2020-07-17 22:50:39,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {2027#true} assume true; {2027#true} is VALID [2020-07-17 22:50:39,996 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2027#true} {2027#true} #77#return; {2027#true} is VALID [2020-07-17 22:50:39,998 INFO L263 TraceCheckUtils]: 0: Hoare triple {2027#true} call ULTIMATE.init(); {2041#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:50:39,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {2041#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2027#true} is VALID [2020-07-17 22:50:39,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {2027#true} assume true; {2027#true} is VALID [2020-07-17 22:50:39,999 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2027#true} {2027#true} #81#return; {2027#true} is VALID [2020-07-17 22:50:39,999 INFO L263 TraceCheckUtils]: 4: Hoare triple {2027#true} call #t~ret10 := main(); {2027#true} is VALID [2020-07-17 22:50:39,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {2027#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2027#true} is VALID [2020-07-17 22:50:40,000 INFO L280 TraceCheckUtils]: 6: Hoare triple {2027#true} assume !(~N~0 <= 0); {2027#true} is VALID [2020-07-17 22:50:40,000 INFO L263 TraceCheckUtils]: 7: Hoare triple {2027#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2027#true} is VALID [2020-07-17 22:50:40,000 INFO L280 TraceCheckUtils]: 8: Hoare triple {2027#true} ~cond := #in~cond; {2027#true} is VALID [2020-07-17 22:50:40,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {2027#true} assume !(0 == ~cond); {2027#true} is VALID [2020-07-17 22:50:40,000 INFO L280 TraceCheckUtils]: 10: Hoare triple {2027#true} assume true; {2027#true} is VALID [2020-07-17 22:50:40,001 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2027#true} {2027#true} #77#return; {2027#true} is VALID [2020-07-17 22:50:40,002 INFO L280 TraceCheckUtils]: 12: Hoare triple {2027#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {2036#(= 1 main_~i~0)} is VALID [2020-07-17 22:50:40,003 INFO L280 TraceCheckUtils]: 13: Hoare triple {2036#(= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2036#(= 1 main_~i~0)} is VALID [2020-07-17 22:50:40,004 INFO L280 TraceCheckUtils]: 14: Hoare triple {2036#(= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2037#(<= 2 main_~i~0)} is VALID [2020-07-17 22:50:40,005 INFO L280 TraceCheckUtils]: 15: Hoare triple {2037#(<= 2 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2038#(<= 3 ~N~0)} is VALID [2020-07-17 22:50:40,006 INFO L280 TraceCheckUtils]: 16: Hoare triple {2038#(<= 3 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2038#(<= 3 ~N~0)} is VALID [2020-07-17 22:50:40,007 INFO L280 TraceCheckUtils]: 17: Hoare triple {2038#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2038#(<= 3 ~N~0)} is VALID [2020-07-17 22:50:40,008 INFO L280 TraceCheckUtils]: 18: Hoare triple {2038#(<= 3 ~N~0)} ~i~0 := 1; {2039#(and (<= 3 ~N~0) (= 1 main_~i~0))} is VALID [2020-07-17 22:50:40,014 INFO L280 TraceCheckUtils]: 19: Hoare triple {2039#(and (<= 3 ~N~0) (= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2039#(and (<= 3 ~N~0) (= 1 main_~i~0))} is VALID [2020-07-17 22:50:40,015 INFO L280 TraceCheckUtils]: 20: Hoare triple {2039#(and (<= 3 ~N~0) (= 1 main_~i~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2040#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-17 22:50:40,017 INFO L280 TraceCheckUtils]: 21: Hoare triple {2040#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {2028#false} is VALID [2020-07-17 22:50:40,018 INFO L280 TraceCheckUtils]: 22: Hoare triple {2028#false} ~i~0 := 0; {2028#false} is VALID [2020-07-17 22:50:40,018 INFO L280 TraceCheckUtils]: 23: Hoare triple {2028#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2028#false} is VALID [2020-07-17 22:50:40,018 INFO L263 TraceCheckUtils]: 24: Hoare triple {2028#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2028#false} is VALID [2020-07-17 22:50:40,018 INFO L280 TraceCheckUtils]: 25: Hoare triple {2028#false} ~cond := #in~cond; {2028#false} is VALID [2020-07-17 22:50:40,018 INFO L280 TraceCheckUtils]: 26: Hoare triple {2028#false} assume 0 == ~cond; {2028#false} is VALID [2020-07-17 22:50:40,019 INFO L280 TraceCheckUtils]: 27: Hoare triple {2028#false} assume !false; {2028#false} is VALID [2020-07-17 22:50:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:40,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409446879] [2020-07-17 22:50:40,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816587648] [2020-07-17 22:50:40,020 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-07-17 22:50:40,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 22:50:40,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:40,071 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:40,085 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:40,261 INFO L263 TraceCheckUtils]: 0: Hoare triple {2027#true} call ULTIMATE.init(); {2027#true} is VALID [2020-07-17 22:50:40,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {2027#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2027#true} is VALID [2020-07-17 22:50:40,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {2027#true} assume true; {2027#true} is VALID [2020-07-17 22:50:40,262 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2027#true} {2027#true} #81#return; {2027#true} is VALID [2020-07-17 22:50:40,263 INFO L263 TraceCheckUtils]: 4: Hoare triple {2027#true} call #t~ret10 := main(); {2027#true} is VALID [2020-07-17 22:50:40,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {2027#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2027#true} is VALID [2020-07-17 22:50:40,263 INFO L280 TraceCheckUtils]: 6: Hoare triple {2027#true} assume !(~N~0 <= 0); {2027#true} is VALID [2020-07-17 22:50:40,264 INFO L263 TraceCheckUtils]: 7: Hoare triple {2027#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2027#true} is VALID [2020-07-17 22:50:40,264 INFO L280 TraceCheckUtils]: 8: Hoare triple {2027#true} ~cond := #in~cond; {2027#true} is VALID [2020-07-17 22:50:40,264 INFO L280 TraceCheckUtils]: 9: Hoare triple {2027#true} assume !(0 == ~cond); {2027#true} is VALID [2020-07-17 22:50:40,264 INFO L280 TraceCheckUtils]: 10: Hoare triple {2027#true} assume true; {2027#true} is VALID [2020-07-17 22:50:40,264 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2027#true} {2027#true} #77#return; {2027#true} is VALID [2020-07-17 22:50:40,268 INFO L280 TraceCheckUtils]: 12: Hoare triple {2027#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {2081#(<= 1 main_~i~0)} is VALID [2020-07-17 22:50:40,270 INFO L280 TraceCheckUtils]: 13: Hoare triple {2081#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2081#(<= 1 main_~i~0)} is VALID [2020-07-17 22:50:40,275 INFO L280 TraceCheckUtils]: 14: Hoare triple {2081#(<= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2037#(<= 2 main_~i~0)} is VALID [2020-07-17 22:50:40,278 INFO L280 TraceCheckUtils]: 15: Hoare triple {2037#(<= 2 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2038#(<= 3 ~N~0)} is VALID [2020-07-17 22:50:40,281 INFO L280 TraceCheckUtils]: 16: Hoare triple {2038#(<= 3 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2038#(<= 3 ~N~0)} is VALID [2020-07-17 22:50:40,283 INFO L280 TraceCheckUtils]: 17: Hoare triple {2038#(<= 3 ~N~0)} assume !(~i~0 < ~N~0); {2038#(<= 3 ~N~0)} is VALID [2020-07-17 22:50:40,284 INFO L280 TraceCheckUtils]: 18: Hoare triple {2038#(<= 3 ~N~0)} ~i~0 := 1; {2100#(and (<= 3 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:40,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {2100#(and (<= 3 ~N~0) (<= main_~i~0 1))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2100#(and (<= 3 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:50:40,294 INFO L280 TraceCheckUtils]: 20: Hoare triple {2100#(and (<= 3 ~N~0) (<= main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2107#(and (<= 3 ~N~0) (<= main_~i~0 2))} is VALID [2020-07-17 22:50:40,296 INFO L280 TraceCheckUtils]: 21: Hoare triple {2107#(and (<= 3 ~N~0) (<= main_~i~0 2))} assume !(~i~0 < ~N~0); {2028#false} is VALID [2020-07-17 22:50:40,296 INFO L280 TraceCheckUtils]: 22: Hoare triple {2028#false} ~i~0 := 0; {2028#false} is VALID [2020-07-17 22:50:40,296 INFO L280 TraceCheckUtils]: 23: Hoare triple {2028#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2028#false} is VALID [2020-07-17 22:50:40,297 INFO L263 TraceCheckUtils]: 24: Hoare triple {2028#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2028#false} is VALID [2020-07-17 22:50:40,297 INFO L280 TraceCheckUtils]: 25: Hoare triple {2028#false} ~cond := #in~cond; {2028#false} is VALID [2020-07-17 22:50:40,297 INFO L280 TraceCheckUtils]: 26: Hoare triple {2028#false} assume 0 == ~cond; {2028#false} is VALID [2020-07-17 22:50:40,297 INFO L280 TraceCheckUtils]: 27: Hoare triple {2028#false} assume !false; {2028#false} is VALID [2020-07-17 22:50:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:40,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:40,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-17 22:50:40,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481591727] [2020-07-17 22:50:40,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:50:40,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:40,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:50:40,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:40,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:50:40,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:40,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:50:40,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:50:40,410 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 11 states. [2020-07-17 22:50:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:42,850 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-07-17 22:50:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 22:50:42,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-17 22:50:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:50:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2020-07-17 22:50:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:50:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2020-07-17 22:50:42,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2020-07-17 22:50:43,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:43,129 INFO L225 Difference]: With dead ends: 79 [2020-07-17 22:50:43,129 INFO L226 Difference]: Without dead ends: 68 [2020-07-17 22:50:43,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:50:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-17 22:50:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-07-17 22:50:43,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:43,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 47 states. [2020-07-17 22:50:43,228 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 47 states. [2020-07-17 22:50:43,228 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 47 states. [2020-07-17 22:50:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:43,231 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-17 22:50:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-17 22:50:43,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:43,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:43,232 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 68 states. [2020-07-17 22:50:43,233 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 68 states. [2020-07-17 22:50:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:43,236 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-17 22:50:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-07-17 22:50:43,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:43,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:43,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:43,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:50:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-17 22:50:43,239 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 28 [2020-07-17 22:50:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:43,239 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-17 22:50:43,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:50:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-17 22:50:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:50:43,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:43,241 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:43,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:43,454 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-17 22:50:43,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:43,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911474594] [2020-07-17 22:50:43,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:43,471 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:43,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193484207] [2020-07-17 22:50:43,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:50:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:43,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-17 22:50:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:43,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:43,712 INFO L263 TraceCheckUtils]: 0: Hoare triple {2453#true} call ULTIMATE.init(); {2453#true} is VALID [2020-07-17 22:50:43,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {2453#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2453#true} is VALID [2020-07-17 22:50:43,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {2453#true} assume true; {2453#true} is VALID [2020-07-17 22:50:43,714 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2453#true} {2453#true} #81#return; {2453#true} is VALID [2020-07-17 22:50:43,714 INFO L263 TraceCheckUtils]: 4: Hoare triple {2453#true} call #t~ret10 := main(); {2453#true} is VALID [2020-07-17 22:50:43,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {2453#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2453#true} is VALID [2020-07-17 22:50:43,714 INFO L280 TraceCheckUtils]: 6: Hoare triple {2453#true} assume !(~N~0 <= 0); {2453#true} is VALID [2020-07-17 22:50:43,715 INFO L263 TraceCheckUtils]: 7: Hoare triple {2453#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2453#true} is VALID [2020-07-17 22:50:43,715 INFO L280 TraceCheckUtils]: 8: Hoare triple {2453#true} ~cond := #in~cond; {2453#true} is VALID [2020-07-17 22:50:43,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {2453#true} assume !(0 == ~cond); {2453#true} is VALID [2020-07-17 22:50:43,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {2453#true} assume true; {2453#true} is VALID [2020-07-17 22:50:43,716 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2453#true} {2453#true} #77#return; {2453#true} is VALID [2020-07-17 22:50:43,722 INFO L280 TraceCheckUtils]: 12: Hoare triple {2453#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {2494#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:43,727 INFO L280 TraceCheckUtils]: 13: Hoare triple {2494#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {2498#(<= ~N~0 1)} is VALID [2020-07-17 22:50:43,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {2498#(<= ~N~0 1)} ~i~0 := 1; {2498#(<= ~N~0 1)} is VALID [2020-07-17 22:50:43,731 INFO L280 TraceCheckUtils]: 15: Hoare triple {2498#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {2498#(<= ~N~0 1)} is VALID [2020-07-17 22:50:43,733 INFO L280 TraceCheckUtils]: 16: Hoare triple {2498#(<= ~N~0 1)} ~i~0 := 0; {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:50:43,736 INFO L280 TraceCheckUtils]: 17: Hoare triple {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:50:43,738 INFO L263 TraceCheckUtils]: 18: Hoare triple {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2498#(<= ~N~0 1)} is VALID [2020-07-17 22:50:43,740 INFO L280 TraceCheckUtils]: 19: Hoare triple {2498#(<= ~N~0 1)} ~cond := #in~cond; {2498#(<= ~N~0 1)} is VALID [2020-07-17 22:50:43,742 INFO L280 TraceCheckUtils]: 20: Hoare triple {2498#(<= ~N~0 1)} assume !(0 == ~cond); {2498#(<= ~N~0 1)} is VALID [2020-07-17 22:50:43,744 INFO L280 TraceCheckUtils]: 21: Hoare triple {2498#(<= ~N~0 1)} assume true; {2498#(<= ~N~0 1)} is VALID [2020-07-17 22:50:43,746 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2498#(<= ~N~0 1)} {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} #79#return; {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:50:43,748 INFO L280 TraceCheckUtils]: 23: Hoare triple {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} havoc #t~mem9; {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:50:43,756 INFO L280 TraceCheckUtils]: 24: Hoare triple {2508#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2533#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-17 22:50:43,758 INFO L280 TraceCheckUtils]: 25: Hoare triple {2533#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2454#false} is VALID [2020-07-17 22:50:43,759 INFO L263 TraceCheckUtils]: 26: Hoare triple {2454#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2454#false} is VALID [2020-07-17 22:50:43,759 INFO L280 TraceCheckUtils]: 27: Hoare triple {2454#false} ~cond := #in~cond; {2454#false} is VALID [2020-07-17 22:50:43,759 INFO L280 TraceCheckUtils]: 28: Hoare triple {2454#false} assume 0 == ~cond; {2454#false} is VALID [2020-07-17 22:50:43,759 INFO L280 TraceCheckUtils]: 29: Hoare triple {2454#false} assume !false; {2454#false} is VALID [2020-07-17 22:50:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:43,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911474594] [2020-07-17 22:50:43,762 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:50:43,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193484207] [2020-07-17 22:50:43,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:43,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:50:43,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055849742] [2020-07-17 22:50:43,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-17 22:50:43,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:43,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:43,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:43,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:43,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:43,859 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2020-07-17 22:50:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:44,614 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-17 22:50:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:50:44,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-17 22:50:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-17 22:50:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2020-07-17 22:50:44,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2020-07-17 22:50:44,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:44,813 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:50:44,813 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:50:44,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:50:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2020-07-17 22:50:44,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:44,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 46 states. [2020-07-17 22:50:44,932 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 46 states. [2020-07-17 22:50:44,932 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 46 states. [2020-07-17 22:50:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:44,935 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-17 22:50:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-17 22:50:44,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:44,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:44,936 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 50 states. [2020-07-17 22:50:44,936 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 50 states. [2020-07-17 22:50:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:44,937 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-17 22:50:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-17 22:50:44,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:44,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:44,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:44,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:50:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-07-17 22:50:44,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 30 [2020-07-17 22:50:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:44,940 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-07-17 22:50:44,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-07-17 22:50:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:50:44,941 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:44,941 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:45,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:45,143 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 4 times [2020-07-17 22:50:45,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:45,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405745792] [2020-07-17 22:50:45,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:45,174 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:50:45,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682271824] [2020-07-17 22:50:45,175 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:45,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:50:45,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:45,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-17 22:50:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:45,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:45,298 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-17 22:50:45,298 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:45,315 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:45,329 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-17 22:50:45,330 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:45,341 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:45,342 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:50:45,342 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-17 22:50:45,352 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:45,353 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, |v_#valid_11|]. (and (= 0 (select (store |v_#valid_11| main_~a~0.base 1) main_~b~0.base)) (= (let ((.cse0 (store |v_#memory_int_15| main_~a~0.base (store (select |v_#memory_int_15| main_~a~0.base) main_~a~0.offset 1)))) (store .cse0 main_~b~0.base (store (select .cse0 main_~b~0.base) main_~b~0.offset 1))) |#memory_int|)) [2020-07-17 22:50:45,353 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) [2020-07-17 22:50:45,581 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2020-07-17 22:50:45,582 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-17 22:50:45,583 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-17 22:50:45,590 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:45,717 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-07-17 22:50:45,719 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-17 22:50:45,722 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:45,729 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:50:45,730 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-17 22:50:45,790 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:45,791 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, main_~i~0]. (let ((.cse0 (select |v_#memory_int_16| main_~a~0.base))) (and (= 1 (select (select |v_#memory_int_16| main_~b~0.base) main_~b~0.offset)) (= 1 (select .cse0 main_~a~0.offset)) (= |#memory_int| (store |v_#memory_int_16| main_~a~0.base (let ((.cse1 (* main_~i~0 8))) (store .cse0 (+ .cse1 main_~a~0.offset) (+ (select .cse0 (+ .cse1 main_~a~0.offset (- 8))) 10))))) (not (= main_~a~0.base main_~b~0.base)))) [2020-07-17 22:50:45,791 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse2 (* main_~i~0 8))) (let ((.cse1 (select |#memory_int| main_~a~0.base)) (.cse0 (+ .cse2 main_~a~0.offset))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (or (= main_~a~0.offset .cse0) (= 1 (select .cse1 main_~a~0.offset))) (= (+ (select .cse1 (+ .cse2 main_~a~0.offset (- 8))) 10) (select .cse1 .cse0)) (not (= main_~a~0.base main_~b~0.base))))) [2020-07-17 22:50:45,799 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:45,899 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:45,983 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:45,995 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:46,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:46,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:46,163 INFO L244 Elim1Store]: Index analysis took 101 ms [2020-07-17 22:50:46,645 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-17 22:50:46,646 INFO L350 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2020-07-17 22:50:46,648 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2020-07-17 22:50:46,670 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-17 22:50:46,671 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-17 22:50:46,685 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-17 22:50:46,685 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 22:50:46,698 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-17 22:50:46,698 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:50:46,715 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:50:46,716 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:46,727 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:50:46,728 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:46,748 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:46,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:46,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:46,910 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:46,911 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 143 [2020-07-17 22:50:46,927 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-17 22:50:46,927 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:50:46,940 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:50:46,941 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:46,946 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:50:46,947 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:46,955 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:47,598 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 45 [2020-07-17 22:50:47,600 INFO L624 ElimStorePlain]: treesize reduction 800, result has 14.5 percent of original size [2020-07-17 22:50:47,608 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:47,622 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-07-17 22:50:47,622 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:101 [2020-07-17 22:50:47,705 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:47,706 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~i~0, v_prenex_5]. (let ((.cse1 (select |v_#memory_int_17| main_~a~0.base))) (let ((.cse0 (= 1 (select (select |v_#memory_int_17| main_~b~0.base) main_~b~0.offset))) (.cse4 (= |#memory_int| (store |v_#memory_int_17| main_~a~0.base (let ((.cse6 (* main_~i~0 8))) (store .cse1 (+ .cse6 main_~a~0.offset) (+ (select .cse1 (+ .cse6 main_~a~0.offset (- 8))) 10)))))) (.cse5 (not (= main_~a~0.base main_~b~0.base))) (.cse3 (select .cse1 main_~a~0.offset))) (or (and .cse0 (let ((.cse2 (* v_prenex_5 8))) (= (+ (select .cse1 (+ .cse2 main_~a~0.offset (- 8))) 10) (select .cse1 (+ .cse2 main_~a~0.offset)))) (= 1 .cse3) .cse4 .cse5) (and .cse0 .cse4 .cse5 (= .cse3 (+ (select .cse1 (+ main_~a~0.offset (- 8))) 10)))))) [2020-07-17 22:50:47,706 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0, v_prenex_6]. (let ((.cse2 (select |#memory_int| main_~a~0.base))) (let ((.cse0 (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (.cse1 (select .cse2 main_~a~0.offset)) (.cse4 (not (= main_~a~0.base main_~b~0.base)))) (or (and .cse0 (= 1 .cse1) (let ((.cse3 (* main_~i~0 8))) (= (+ (select .cse2 (+ .cse3 main_~a~0.offset (- 8))) 10) (select .cse2 (+ .cse3 main_~a~0.offset)))) .cse4) (let ((.cse7 (* v_prenex_6 8))) (let ((.cse6 (+ .cse7 main_~a~0.offset))) (and .cse0 (let ((.cse5 (+ main_~a~0.offset (- 8)))) (or (= .cse5 .cse6) (= (+ .cse1 (- 10)) (select .cse2 .cse5)))) (= (+ (select .cse2 (+ .cse7 main_~a~0.offset (- 8))) 10) (select .cse2 .cse6)) .cse4)))))) [2020-07-17 22:50:47,710 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:47,911 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-07-17 22:50:47,930 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:48,068 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:48,227 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:50:48,618 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2020-07-17 22:50:48,637 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:50:48,709 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:48,710 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:48,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:48,734 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:48,758 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:48,820 INFO L350 Elim1Store]: treesize reduction 17, result has 67.9 percent of original size [2020-07-17 22:50:48,821 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 107 [2020-07-17 22:50:48,831 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:48,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:48,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:48,899 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:48,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:48,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:49,001 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:49,095 INFO L244 Elim1Store]: Index analysis took 215 ms [2020-07-17 22:50:49,100 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2020-07-17 22:50:49,120 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:49,159 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:49,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:49,162 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:50:49,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:49,168 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2020-07-17 22:50:49,189 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:49,583 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-07-17 22:50:49,585 INFO L624 ElimStorePlain]: treesize reduction 53, result has 80.9 percent of original size [2020-07-17 22:50:49,586 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2020-07-17 22:50:49,586 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:212, output treesize:225 [2020-07-17 22:50:50,097 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-07-17 22:50:50,127 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 6, 1] term [2020-07-17 22:50:50,128 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:50:50,510 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-07-17 22:50:50,535 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:50:50,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:50,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:50,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:50,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:50,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:50,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,037 INFO L244 Elim1Store]: Index analysis took 320 ms [2020-07-17 22:50:51,200 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-07-17 22:50:51,201 INFO L350 Elim1Store]: treesize reduction 17, result has 81.7 percent of original size [2020-07-17 22:50:51,201 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 173 [2020-07-17 22:50:51,212 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:51,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,680 INFO L244 Elim1Store]: Index analysis took 402 ms [2020-07-17 22:50:51,706 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:51,706 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 100 [2020-07-17 22:50:51,722 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:51,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:50:51,848 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:50:51,849 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 109 [2020-07-17 22:50:51,864 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 22:50:52,345 WARN L193 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2020-07-17 22:50:52,347 INFO L624 ElimStorePlain]: treesize reduction 210, result has 53.6 percent of original size [2020-07-17 22:50:52,427 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2020-07-17 22:50:52,428 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:275, output treesize:243 [2020-07-17 22:50:52,484 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:50:52,485 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, main_~a~0.base, main_~i~0, main_~a~0.offset, v_prenex_7]. (let ((.cse6 (select |v_#memory_int_19| main_~a~0.base)) (.cse11 (select |v_#memory_int_19| main_~b~0.base))) (let ((.cse1 (select .cse11 main_~b~0.offset)) (.cse3 (select .cse6 main_~a~0.offset)) (.cse5 (select .cse11 (+ main_~b~0.offset 8)))) (let ((.cse0 (<= 2 main_~i~0)) (.cse2 (= (store |v_#memory_int_19| main_~b~0.base (let ((.cse12 (* main_~i~0 8))) (store .cse11 (+ main_~b~0.offset .cse12) (+ (select .cse6 (+ .cse12 main_~a~0.offset (- 8))) (select .cse11 (+ main_~b~0.offset .cse12 (- 8))))))) |#memory_int|)) (.cse10 (select .cse6 (+ main_~a~0.offset (- 8)))) (.cse8 (= (+ .cse1 .cse3) .cse5)) (.cse4 (not (= main_~a~0.base main_~b~0.base))) (.cse9 (= .cse5 (+ .cse3 1)))) (or (and .cse0 (= 1 .cse1) .cse2 (= 1 .cse3) .cse4 (= 2 .cse5) (let ((.cse7 (* v_prenex_7 8))) (= (+ (select .cse6 (+ .cse7 main_~a~0.offset (- 8))) 10) (select .cse6 (+ .cse7 main_~a~0.offset))))) (and .cse0 .cse2 .cse8 .cse4 .cse9 (= (+ .cse10 10) .cse3)) (and .cse0 .cse2 (= (+ (select .cse6 (+ main_~a~0.offset (- 16))) 10) .cse10) .cse8 .cse4 .cse9))))) [2020-07-17 22:50:52,485 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_8, v_prenex_10, v_prenex_9, v_prenex_7, main_~i~0, main_~a~0.base, main_~a~0.offset, v_prenex_11, v_prenex_13, v_prenex_12]. (let ((.cse0 (select |#memory_int| main_~b~0.base))) (let ((.cse6 (select .cse0 main_~b~0.offset))) (let ((.cse3 (= .cse6 1)) (.cse5 (select .cse0 (+ main_~b~0.offset 8)))) (or (let ((.cse2 (select |#memory_int| main_~a~0.base))) (let ((.cse4 (select .cse2 main_~a~0.offset))) (and (<= 2 main_~i~0) (let ((.cse1 (* main_~i~0 8))) (= (select .cse0 (+ main_~b~0.offset .cse1)) (+ (select .cse0 (+ main_~b~0.offset .cse1 (- 8))) (select .cse2 (+ .cse1 main_~a~0.offset (- 8)))))) .cse3 (= (+ (select .cse2 (+ main_~a~0.offset (- 8))) 10) .cse4) (not (= main_~a~0.base main_~b~0.base)) (= .cse5 (+ .cse4 .cse6))))) (let ((.cse8 (select |#memory_int| v_prenex_10))) (and (<= 2 v_prenex_8) (let ((.cse7 (* v_prenex_8 8))) (= (select .cse0 (+ main_~b~0.offset .cse7)) (+ (select .cse0 (+ main_~b~0.offset .cse7 (- 8))) (select .cse8 (+ .cse7 v_prenex_9 (- 8)))))) (let ((.cse9 (* v_prenex_7 8))) (= (select .cse8 (+ .cse9 v_prenex_9)) (+ (select .cse8 (+ .cse9 v_prenex_9 (- 8))) 10))) .cse3 (= 1 (select .cse8 v_prenex_9)) (= 2 .cse5) (not (= v_prenex_10 main_~b~0.base)))) (let ((.cse11 (select |#memory_int| v_prenex_13))) (and (<= 2 v_prenex_11) (let ((.cse10 (* v_prenex_11 8))) (= (select .cse0 (+ main_~b~0.offset .cse10)) (+ (select .cse0 (+ main_~b~0.offset .cse10 (- 8))) (select .cse11 (+ .cse10 v_prenex_12 (- 8)))))) .cse3 (= (+ (select .cse11 v_prenex_12) 1) .cse5) (= (select .cse11 (+ v_prenex_12 (- 8))) (+ (select .cse11 (+ v_prenex_12 (- 16))) 10)) (not (= v_prenex_13 main_~b~0.base)))))))) [2020-07-17 22:50:57,140 WARN L193 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 99 [2020-07-17 22:51:07,530 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 102 [2020-07-17 22:51:07,573 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:51:07,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:07,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:07,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:07,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:07,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:07,840 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:51:07,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:07,868 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:51:07,999 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-07-17 22:51:08,000 INFO L350 Elim1Store]: treesize reduction 10, result has 81.5 percent of original size [2020-07-17 22:51:08,001 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 65 [2020-07-17 22:51:08,025 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:51:08,026 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,031 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 22:51:08,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,095 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:51:08,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,115 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:51:08,387 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-17 22:51:08,388 INFO L350 Elim1Store]: treesize reduction 17, result has 84.0 percent of original size [2020-07-17 22:51:08,388 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 111 [2020-07-17 22:51:08,423 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:51:08,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:08,430 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:51:08,431 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,444 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:08,450 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,457 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,460 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,498 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-17 22:51:08,499 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:08,507 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:51:08,507 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,524 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:08,529 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,536 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,539 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,547 INFO L544 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-17 22:51:08,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,622 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 22:51:08,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:51:08,807 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-07-17 22:51:08,808 INFO L350 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2020-07-17 22:51:08,809 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 80 [2020-07-17 22:51:08,836 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:51:08,837 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,845 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:51:08,846 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,867 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:51:08,877 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:51:08,956 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:51:08,956 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,968 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-17 22:51:08,969 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:51:08,988 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:51:09,004 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-17 22:51:09,048 INFO L544 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-17 22:51:09,552 WARN L193 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 74 [2020-07-17 22:51:09,555 INFO L624 ElimStorePlain]: treesize reduction 96, result has 60.2 percent of original size [2020-07-17 22:51:09,578 INFO L544 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:51:09,578 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:285, output treesize:7 [2020-07-17 22:51:09,628 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:51:09,628 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_prenex_10, v_prenex_8, v_prenex_9, main_~b~0.base, main_~b~0.offset, v_prenex_7, main_~a~0.base, v_prenex_14, main_~a~0.offset, v_prenex_11, v_prenex_13, v_prenex_12]. (let ((.cse7 (select |#memory_int| main_~b~0.base))) (let ((.cse6 (select .cse7 main_~b~0.offset))) (let ((.cse0 (= .cse6 1)) (.cse5 (select .cse7 (+ main_~b~0.offset 8))) (.cse1 (= (select .cse7 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|)) (.cse4 (= 0 main_~i~0))) (or (let ((.cse2 (select |#memory_int| main_~a~0.base))) (let ((.cse3 (select .cse2 main_~a~0.offset))) (and .cse0 .cse1 (= (+ (select .cse2 (+ main_~a~0.offset (- 8))) 10) .cse3) .cse4 (not (= main_~a~0.base main_~b~0.base)) (= .cse5 (+ .cse3 .cse6)) (let ((.cse8 (* v_prenex_14 8))) (= (select .cse7 (+ main_~b~0.offset .cse8)) (+ (select .cse2 (+ .cse8 main_~a~0.offset (- 8))) (select .cse7 (+ main_~b~0.offset .cse8 (- 8)))))) (<= 2 v_prenex_14)))) (let ((.cse9 (select |#memory_int| v_prenex_10))) (and (not (= v_prenex_10 main_~b~0.base)) (let ((.cse10 (* v_prenex_7 8))) (= (select .cse9 (+ .cse10 v_prenex_9)) (+ (select .cse9 (+ .cse10 v_prenex_9 (- 8))) 10))) .cse0 .cse1 .cse4 (= 1 (select .cse9 v_prenex_9)) (= 2 .cse5) (let ((.cse11 (* v_prenex_8 8))) (= (select .cse7 (+ main_~b~0.offset .cse11)) (+ (select .cse9 (+ .cse11 v_prenex_9 (- 8))) (select .cse7 (+ main_~b~0.offset .cse11 (- 8)))))) (<= 2 v_prenex_8))) (let ((.cse12 (select |#memory_int| v_prenex_13))) (and (not (= v_prenex_13 main_~b~0.base)) .cse0 (<= 2 v_prenex_11) (= (+ (select .cse12 v_prenex_12) 1) .cse5) .cse1 (let ((.cse13 (* v_prenex_11 8))) (= (select .cse7 (+ main_~b~0.offset .cse13)) (+ (select .cse7 (+ main_~b~0.offset .cse13 (- 8))) (select .cse12 (+ .cse13 v_prenex_12 (- 8)))))) .cse4 (= (select .cse12 (+ v_prenex_12 (- 8))) (+ (select .cse12 (+ v_prenex_12 (- 16))) 10)))))))) [2020-07-17 22:51:09,629 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-17 22:51:09,908 INFO L263 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2822#true} is VALID [2020-07-17 22:51:09,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {2822#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2822#true} is VALID [2020-07-17 22:51:09,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2020-07-17 22:51:09,909 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #81#return; {2822#true} is VALID [2020-07-17 22:51:09,909 INFO L263 TraceCheckUtils]: 4: Hoare triple {2822#true} call #t~ret10 := main(); {2822#true} is VALID [2020-07-17 22:51:09,910 INFO L280 TraceCheckUtils]: 5: Hoare triple {2822#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2822#true} is VALID [2020-07-17 22:51:09,910 INFO L280 TraceCheckUtils]: 6: Hoare triple {2822#true} assume !(~N~0 <= 0); {2822#true} is VALID [2020-07-17 22:51:09,910 INFO L263 TraceCheckUtils]: 7: Hoare triple {2822#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2822#true} is VALID [2020-07-17 22:51:09,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2020-07-17 22:51:09,911 INFO L280 TraceCheckUtils]: 9: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2020-07-17 22:51:09,911 INFO L280 TraceCheckUtils]: 10: Hoare triple {2822#true} assume true; {2822#true} is VALID [2020-07-17 22:51:09,911 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2822#true} {2822#true} #77#return; {2822#true} is VALID [2020-07-17 22:51:09,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {2822#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {2863#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:51:09,927 INFO L280 TraceCheckUtils]: 13: Hoare triple {2863#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2867#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:51:09,929 INFO L280 TraceCheckUtils]: 14: Hoare triple {2867#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2867#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:51:09,955 INFO L280 TraceCheckUtils]: 15: Hoare triple {2867#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (and (or (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2874#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-17 22:51:09,956 INFO L280 TraceCheckUtils]: 16: Hoare triple {2874#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2874#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-17 22:51:09,957 INFO L280 TraceCheckUtils]: 17: Hoare triple {2874#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} assume !(~i~0 < ~N~0); {2874#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-17 22:51:09,975 INFO L280 TraceCheckUtils]: 18: Hoare triple {2874#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (exists ((main_~i~0 Int)) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_6 Int)) (and (or (= 0 (+ (* 8 v_prenex_6) 8)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_6 8) main_~a~0.offset))))) (not (= main_~a~0.base main_~b~0.base))))} ~i~0 := 1; {2884#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-17 22:51:10,002 INFO L280 TraceCheckUtils]: 19: Hoare triple {2884#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (not (= main_~a~0.base main_~b~0.base))))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2888#(or (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 1)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= 1 main_~i~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 1)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) 2) (= 1 main_~i~0) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (= 1 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (= 1 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8)))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-17 22:51:10,030 INFO L280 TraceCheckUtils]: 20: Hoare triple {2888#(or (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 1)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= 1 main_~i~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))) 1)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= 1 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (not (= main_~a~0.base main_~b~0.base))) (and (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) 2) (= 1 main_~i~0) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (= 1 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8)))) (= 1 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8)))) (not (= main_~a~0.base main_~b~0.base))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2892#(or (and (<= 2 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset)))) (and (<= 2 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset)))) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base))))} is VALID [2020-07-17 22:51:12,047 INFO L280 TraceCheckUtils]: 21: Hoare triple {2892#(or (and (<= 2 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 16))) 10)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset)))) (and (<= 2 main_~i~0) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset)))) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (exists ((v_prenex_7 Int)) (= (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset)) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_7 8) main_~a~0.offset (- 8))) 10))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (not (= main_~a~0.base main_~b~0.base))))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2896#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} is UNKNOWN [2020-07-17 22:51:12,049 INFO L280 TraceCheckUtils]: 22: Hoare triple {2896#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2896#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} is VALID [2020-07-17 22:51:12,051 INFO L280 TraceCheckUtils]: 23: Hoare triple {2896#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} assume !(~i~0 < ~N~0); {2896#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} is VALID [2020-07-17 22:51:12,065 INFO L280 TraceCheckUtils]: 24: Hoare triple {2896#(or (and (exists ((main_~i~0 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* main_~i~0 8) (- 8))) (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 8) main_~a~0.offset (- 8))))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))))} ~i~0 := 0; {2906#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_14 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_14 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_14 8) main_~a~0.offset (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_14 8) (- 8))))) (<= 2 v_prenex_14))) (= 0 main_~i~0)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 0 main_~i~0) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} is VALID [2020-07-17 22:51:12,077 INFO L280 TraceCheckUtils]: 25: Hoare triple {2906#(or (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_14 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (- 8))) 10) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) (select (select |#memory_int| main_~b~0.base) main_~b~0.offset))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_14 8))) (+ (select (select |#memory_int| main_~a~0.base) (+ (* v_prenex_14 8) main_~a~0.offset (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_14 8) (- 8))))) (<= 2 v_prenex_14))) (= 0 main_~i~0)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (and (not (= v_prenex_13 main_~b~0.base)) (<= 2 v_prenex_11) (= (+ (select (select |#memory_int| v_prenex_13) v_prenex_12) 1) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8))) (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_11 8) (- 8))) (select (select |#memory_int| v_prenex_13) (+ (* v_prenex_11 8) v_prenex_12 (- 8))))) (= (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 8))) (+ (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 (- 16))) 10))))) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (exists ((v_prenex_7 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (not (= v_prenex_10 main_~b~0.base)) (= (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9)) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_7 8) v_prenex_9 (- 8))) 10)) (= 1 (select (select |#memory_int| v_prenex_10) v_prenex_9)) (= (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8))) (+ (select (select |#memory_int| v_prenex_10) (+ (* v_prenex_8 8) v_prenex_9 (- 8))) (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset (* v_prenex_8 8) (- 8))))) (<= 2 v_prenex_8))) (= 0 main_~i~0) (= 2 (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)))))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2910#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-17 22:51:12,080 INFO L263 TraceCheckUtils]: 26: Hoare triple {2910#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {2914#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:12,081 INFO L280 TraceCheckUtils]: 27: Hoare triple {2914#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2918#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:12,082 INFO L280 TraceCheckUtils]: 28: Hoare triple {2918#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2823#false} is VALID [2020-07-17 22:51:12,082 INFO L280 TraceCheckUtils]: 29: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2020-07-17 22:51:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:12,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405745792] [2020-07-17 22:51:12,092 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:51:12,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682271824] [2020-07-17 22:51:12,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:51:12,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 22:51:12,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466099774] [2020-07-17 22:51:12,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-17 22:51:12,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:12,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:51:16,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 28 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:16,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:51:16,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:16,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:51:16,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:51:16,678 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 13 states. [2020-07-17 22:51:18,834 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2020-07-17 22:51:19,931 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2020-07-17 22:51:20,913 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2020-07-17 22:51:31,710 WARN L193 SmtUtils]: Spent 8.44 s on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-07-17 22:51:43,883 WARN L193 SmtUtils]: Spent 7.56 s on a formula simplification. DAG size of input: 130 DAG size of output: 130 [2020-07-17 22:51:56,485 WARN L193 SmtUtils]: Spent 7.23 s on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2020-07-17 22:52:03,042 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-07-17 22:52:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:03,875 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-17 22:52:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 22:52:03,876 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-17 22:52:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:52:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2020-07-17 22:52:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:52:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2020-07-17 22:52:03,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2020-07-17 22:52:15,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 65 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:15,520 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:52:15,520 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 22:52:15,521 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 46.6s TimeCoverageRelationStatistics Valid=71, Invalid=348, Unknown=1, NotChecked=0, Total=420 [2020-07-17 22:52:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 22:52:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2020-07-17 22:52:15,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:15,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 54 states. [2020-07-17 22:52:15,760 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 54 states. [2020-07-17 22:52:15,761 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 54 states. [2020-07-17 22:52:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:15,764 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-17 22:52:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-17 22:52:15,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:15,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:15,765 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 70 states. [2020-07-17 22:52:15,765 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 70 states. [2020-07-17 22:52:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:15,768 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2020-07-17 22:52:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-17 22:52:15,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:15,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:15,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:15,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-17 22:52:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-17 22:52:15,770 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2020-07-17 22:52:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:15,770 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-17 22:52:15,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:52:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-17 22:52:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:52:15,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:15,771 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:15,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-17 22:52:15,986 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:15,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 5 times [2020-07-17 22:52:15,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:15,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922366402] [2020-07-17 22:52:15,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:16,023 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:16,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001537625] [2020-07-17 22:52:16,027 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:16,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-07-17 22:52:16,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:52:16,085 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:52:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:16,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:16,418 INFO L263 TraceCheckUtils]: 0: Hoare triple {3261#true} call ULTIMATE.init(); {3261#true} is VALID [2020-07-17 22:52:16,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {3261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3261#true} is VALID [2020-07-17 22:52:16,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {3261#true} assume true; {3261#true} is VALID [2020-07-17 22:52:16,419 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3261#true} {3261#true} #81#return; {3261#true} is VALID [2020-07-17 22:52:16,419 INFO L263 TraceCheckUtils]: 4: Hoare triple {3261#true} call #t~ret10 := main(); {3261#true} is VALID [2020-07-17 22:52:16,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {3261#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {3261#true} is VALID [2020-07-17 22:52:16,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {3261#true} assume !(~N~0 <= 0); {3261#true} is VALID [2020-07-17 22:52:16,419 INFO L263 TraceCheckUtils]: 7: Hoare triple {3261#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {3261#true} is VALID [2020-07-17 22:52:16,419 INFO L280 TraceCheckUtils]: 8: Hoare triple {3261#true} ~cond := #in~cond; {3261#true} is VALID [2020-07-17 22:52:16,419 INFO L280 TraceCheckUtils]: 9: Hoare triple {3261#true} assume !(0 == ~cond); {3261#true} is VALID [2020-07-17 22:52:16,420 INFO L280 TraceCheckUtils]: 10: Hoare triple {3261#true} assume true; {3261#true} is VALID [2020-07-17 22:52:16,420 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {3261#true} {3261#true} #77#return; {3261#true} is VALID [2020-07-17 22:52:16,422 INFO L280 TraceCheckUtils]: 12: Hoare triple {3261#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~a~0.base, ~a~0.offset, 8);call write~int(1, ~b~0.base, ~b~0.offset, 8);~i~0 := 1; {3302#(<= 1 main_~i~0)} is VALID [2020-07-17 22:52:16,423 INFO L280 TraceCheckUtils]: 13: Hoare triple {3302#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3302#(<= 1 main_~i~0)} is VALID [2020-07-17 22:52:16,431 INFO L280 TraceCheckUtils]: 14: Hoare triple {3302#(<= 1 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3309#(<= 2 main_~i~0)} is VALID [2020-07-17 22:52:16,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {3309#(<= 2 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3309#(<= 2 main_~i~0)} is VALID [2020-07-17 22:52:16,442 INFO L280 TraceCheckUtils]: 16: Hoare triple {3309#(<= 2 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3316#(<= 3 main_~i~0)} is VALID [2020-07-17 22:52:16,445 INFO L280 TraceCheckUtils]: 17: Hoare triple {3316#(<= 3 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(10 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {3320#(<= 4 ~N~0)} is VALID [2020-07-17 22:52:16,447 INFO L280 TraceCheckUtils]: 18: Hoare triple {3320#(<= 4 ~N~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3320#(<= 4 ~N~0)} is VALID [2020-07-17 22:52:16,448 INFO L280 TraceCheckUtils]: 19: Hoare triple {3320#(<= 4 ~N~0)} assume !(~i~0 < ~N~0); {3320#(<= 4 ~N~0)} is VALID [2020-07-17 22:52:16,449 INFO L280 TraceCheckUtils]: 20: Hoare triple {3320#(<= 4 ~N~0)} ~i~0 := 1; {3330#(and (<= 4 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:52:16,451 INFO L280 TraceCheckUtils]: 21: Hoare triple {3330#(and (<= 4 ~N~0) (<= main_~i~0 1))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {3330#(and (<= 4 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-17 22:52:16,461 INFO L280 TraceCheckUtils]: 22: Hoare triple {3330#(and (<= 4 ~N~0) (<= main_~i~0 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3337#(and (<= main_~i~0 2) (<= 4 ~N~0))} is VALID [2020-07-17 22:52:16,463 INFO L280 TraceCheckUtils]: 23: Hoare triple {3337#(and (<= main_~i~0 2) (<= 4 ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {3337#(and (<= main_~i~0 2) (<= 4 ~N~0))} is VALID [2020-07-17 22:52:16,475 INFO L280 TraceCheckUtils]: 24: Hoare triple {3337#(and (<= main_~i~0 2) (<= 4 ~N~0))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3344#(and (<= main_~i~0 3) (<= 4 ~N~0))} is VALID [2020-07-17 22:52:16,478 INFO L280 TraceCheckUtils]: 25: Hoare triple {3344#(and (<= main_~i~0 3) (<= 4 ~N~0))} assume !(~i~0 < ~N~0); {3262#false} is VALID [2020-07-17 22:52:16,478 INFO L280 TraceCheckUtils]: 26: Hoare triple {3262#false} ~i~0 := 0; {3262#false} is VALID [2020-07-17 22:52:16,478 INFO L280 TraceCheckUtils]: 27: Hoare triple {3262#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {3262#false} is VALID [2020-07-17 22:52:16,479 INFO L263 TraceCheckUtils]: 28: Hoare triple {3262#false} call __VERIFIER_assert((if #t~mem9 == 1 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {3262#false} is VALID [2020-07-17 22:52:16,479 INFO L280 TraceCheckUtils]: 29: Hoare triple {3262#false} ~cond := #in~cond; {3262#false} is VALID [2020-07-17 22:52:16,479 INFO L280 TraceCheckUtils]: 30: Hoare triple {3262#false} assume 0 == ~cond; {3262#false} is VALID [2020-07-17 22:52:16,479 INFO L280 TraceCheckUtils]: 31: Hoare triple {3262#false} assume !false; {3262#false} is VALID [2020-07-17 22:52:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:16,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922366402] [2020-07-17 22:52:16,481 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:16,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001537625] [2020-07-17 22:52:16,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:16,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 22:52:16,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177655419] [2020-07-17 22:52:16,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-17 22:52:16,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:16,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:52:16,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:16,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:52:16,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:52:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:52:16,646 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 9 states. [2020-07-17 22:52:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:20,487 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2020-07-17 22:52:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:52:20,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-07-17 22:52:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:52:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2020-07-17 22:52:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:52:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2020-07-17 22:52:20,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 92 transitions. [2020-07-17 22:52:20,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:20,993 INFO L225 Difference]: With dead ends: 100 [2020-07-17 22:52:20,993 INFO L226 Difference]: Without dead ends: 89 [2020-07-17 22:52:20,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:52:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-17 22:52:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2020-07-17 22:52:21,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:21,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 56 states. [2020-07-17 22:52:21,244 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 56 states. [2020-07-17 22:52:21,244 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 56 states. [2020-07-17 22:52:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:21,247 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2020-07-17 22:52:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2020-07-17 22:52:21,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:21,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:21,249 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 89 states. [2020-07-17 22:52:21,249 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 89 states. [2020-07-17 22:52:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:21,252 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2020-07-17 22:52:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2020-07-17 22:52:21,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:21,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:21,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:21,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-17 22:52:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-07-17 22:52:21,255 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2020-07-17 22:52:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:21,256 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-07-17 22:52:21,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:52:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-17 22:52:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:52:21,256 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:21,257 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:21,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:21,463 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:21,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-17 22:52:21,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:21,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768751571] [2020-07-17 22:52:21,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:21,475 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:21,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605331723] [2020-07-17 22:52:21,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:52:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:52:21,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:52:21,601 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:52:21,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:21,884 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:52:21,884 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:52:21,884 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:52:21,884 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:52:21,884 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:52:21,885 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:52:21,885 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:52:21,885 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:52:21,885 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:52:21,885 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:52:21,885 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:52:21,885 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:52:21,885 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:52:21,886 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:52:21,886 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:52:21,886 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:52:21,886 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:52:21,886 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:52:21,886 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:52:21,886 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:52:21,886 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:52:21,888 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:52:21,889 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:52:21,889 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:52:21,889 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:52:21,889 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:52:21,889 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:52:21,890 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:52:21,890 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:52:21,890 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:52:21,890 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:52:21,890 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-17 22:52:21,890 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-17 22:52:21,890 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-17 22:52:21,890 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-17 22:52:21,891 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:52:21,891 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:52:21,891 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:52:21,891 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:52:21,891 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:52:21,891 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:52:21,891 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-17 22:52:21,892 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-17 22:52:21,892 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-17 22:52:21,892 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:52:21,892 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:52:21,892 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:52:21,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:52:21 BoogieIcfgContainer [2020-07-17 22:52:21,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:52:21,897 INFO L168 Benchmark]: Toolchain (without parser) took 197668.31 ms. Allocated memory was 136.8 MB in the beginning and 289.9 MB in the end (delta: 153.1 MB). Free memory was 102.0 MB in the beginning and 165.5 MB in the end (delta: -63.5 MB). Peak memory consumption was 89.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:21,898 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 22:52:21,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.47 ms. Allocated memory is still 136.8 MB. Free memory was 101.5 MB in the beginning and 90.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:21,899 INFO L168 Benchmark]: Boogie Preprocessor took 204.46 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 90.6 MB in the beginning and 180.4 MB in the end (delta: -89.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:21,899 INFO L168 Benchmark]: RCFGBuilder took 690.04 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 155.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:21,900 INFO L168 Benchmark]: TraceAbstraction took 196443.48 ms. Allocated memory was 202.4 MB in the beginning and 289.9 MB in the end (delta: 87.6 MB). Free memory was 154.6 MB in the beginning and 165.5 MB in the end (delta: -10.9 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:52:21,902 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.59 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.47 ms. Allocated memory is still 136.8 MB. Free memory was 101.5 MB in the beginning and 90.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 204.46 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 90.6 MB in the beginning and 180.4 MB in the end (delta: -89.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 690.04 ms. Allocated memory is still 202.4 MB. Free memory was 180.4 MB in the beginning and 155.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196443.48 ms. Allocated memory was 202.4 MB in the beginning and 289.9 MB in the end (delta: 87.6 MB). Free memory was 154.6 MB in the beginning and 165.5 MB in the end (delta: -10.9 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=3, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 1 [L30] b[0] = 1 [L31] i=1 VAL [\old(N)=0, a={-2:0}, b={-1:0}, i=1, malloc(sizeof(long long)*N)={-2:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L31] COND TRUE i