/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/ifcompf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:03,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:03,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:03,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:03,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:03,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:03,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:03,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:03,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:03,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:03,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:03,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:03,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:03,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:03,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:03,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:03,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:03,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:03,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:03,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:03,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:03,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:03,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:03,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:03,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:03,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:03,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:03,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:03,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:03,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:03,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:03,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:03,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:03,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:03,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:03,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:03,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:03,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:03,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:03,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:03,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:03,934 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:03,959 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:03,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:03,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:03,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:03,963 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:03,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:03,963 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:03,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:03,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:03,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:03,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:03,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:03,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:03,966 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:03,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:03,966 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:03,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:03,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:03,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:03,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:03,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:03,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:03,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:03,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:03,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:03,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:03,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:03,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:03,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:03,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:04,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:04,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:04,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:04,299 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:04,300 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:04,300 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ifcompf.c [2020-07-17 22:49:04,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0e0d5ae/6e6a1229b911419ca7b4f21e1aa34805/FLAGfb4d2c262 [2020-07-17 22:49:04,845 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:04,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifcompf.c [2020-07-17 22:49:04,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0e0d5ae/6e6a1229b911419ca7b4f21e1aa34805/FLAGfb4d2c262 [2020-07-17 22:49:05,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0e0d5ae/6e6a1229b911419ca7b4f21e1aa34805 [2020-07-17 22:49:05,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:05,265 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:05,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:05,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:05,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:05,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:05" (1/1) ... [2020-07-17 22:49:05,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681a2701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:05, skipping insertion in model container [2020-07-17 22:49:05,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:05" (1/1) ... [2020-07-17 22:49:05,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:05,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:05,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:05,577 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:05,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:05,621 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:05,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:05 WrapperNode [2020-07-17 22:49:05,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:05,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:05,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:05,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:05,717 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:05" (1/1) ... [2020-07-17 22:49:05,717 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:05" (1/1) ... [2020-07-17 22:49:05,726 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:05" (1/1) ... [2020-07-17 22:49:05,727 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:05" (1/1) ... [2020-07-17 22:49:05,739 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:05" (1/1) ... [2020-07-17 22:49:05,746 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:05" (1/1) ... [2020-07-17 22:49:05,748 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:05" (1/1) ... [2020-07-17 22:49:05,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:05,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:05,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:05,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:05,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:05" (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:05,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:05,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:05,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:05,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:05,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:06,228 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:06,228 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:49:06,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:06 BoogieIcfgContainer [2020-07-17 22:49:06,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:06,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:06,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:06,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:06,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:05" (1/3) ... [2020-07-17 22:49:06,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f352f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:06, skipping insertion in model container [2020-07-17 22:49:06,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:05" (2/3) ... [2020-07-17 22:49:06,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f352f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:06, skipping insertion in model container [2020-07-17 22:49:06,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:06" (3/3) ... [2020-07-17 22:49:06,242 INFO L109 eAbstractionObserver]: Analyzing ICFG ifcompf.c [2020-07-17 22:49:06,272 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:06,288 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:06,302 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:06,323 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:06,324 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:06,324 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:06,324 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:06,324 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:06,324 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:06,324 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:06,325 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-17 22:49:06,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:06,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:06,349 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:06,350 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash -794599326, now seen corresponding path program 1 times [2020-07-17 22:49:06,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:06,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249293641] [2020-07-17 22:49:06,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:06,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {52#(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; {43#true} is VALID [2020-07-17 22:49:06,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:49:06,606 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #110#return; {43#true} is VALID [2020-07-17 22:49:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:06,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-17 22:49:06,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-17 22:49:06,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:49:06,622 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #106#return; {44#false} is VALID [2020-07-17 22:49:06,624 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {52#(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:06,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#(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; {43#true} is VALID [2020-07-17 22:49:06,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:49:06,625 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #110#return; {43#true} is VALID [2020-07-17 22:49:06,626 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret14 := main(); {43#true} is VALID [2020-07-17 22:49:06,626 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {43#true} is VALID [2020-07-17 22:49:06,627 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~N~0 <= 0); {43#true} is VALID [2020-07-17 22:49:06,627 INFO L263 TraceCheckUtils]: 7: Hoare triple {43#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {43#true} is VALID [2020-07-17 22:49:06,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-17 22:49:06,629 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-17 22:49:06,629 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:49:06,630 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#false} {43#true} #106#return; {44#false} is VALID [2020-07-17 22:49:06,630 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#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 #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:06,630 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-17 22:49:06,631 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:06,631 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-17 22:49:06,631 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:06,632 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-17 22:49:06,632 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:06,633 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {44#false} is VALID [2020-07-17 22:49:06,633 INFO L263 TraceCheckUtils]: 20: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {44#false} is VALID [2020-07-17 22:49:06,633 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-17 22:49:06,634 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-17 22:49:06,634 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-17 22:49:06,638 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:06,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249293641] [2020-07-17 22:49:06,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:06,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:06,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532117740] [2020-07-17 22:49:06,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:49:06,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:06,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:06,717 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:06,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:06,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:06,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:06,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:06,730 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-17 22:49:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:06,973 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2020-07-17 22:49:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:06,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:49:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2020-07-17 22:49:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2020-07-17 22:49:06,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2020-07-17 22:49:07,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:07,159 INFO L225 Difference]: With dead ends: 70 [2020-07-17 22:49:07,159 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:49:07,162 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:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:49:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 22:49:07,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:07,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:07,217 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:07,217 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,223 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-17 22:49:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-17 22:49:07,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:07,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:07,224 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:07,224 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,229 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-17 22:49:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-17 22:49:07,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:07,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:07,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:07,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:49:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-07-17 22:49:07,236 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 24 [2020-07-17 22:49:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:07,236 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-07-17 22:49:07,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-17 22:49:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:07,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:07,238 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,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:07,239 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash -544938994, now seen corresponding path program 1 times [2020-07-17 22:49:07,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:07,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933508471] [2020-07-17 22:49:07,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:07,277 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:07,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060195674] [2020-07-17 22:49:07,278 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:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:07,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:49:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:07,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:07,439 INFO L263 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {260#true} is VALID [2020-07-17 22:49:07,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {260#true} is VALID [2020-07-17 22:49:07,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2020-07-17 22:49:07,441 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #110#return; {260#true} is VALID [2020-07-17 22:49:07,441 INFO L263 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret14 := main(); {260#true} is VALID [2020-07-17 22:49:07,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {260#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {260#true} is VALID [2020-07-17 22:49:07,442 INFO L280 TraceCheckUtils]: 6: Hoare triple {260#true} assume !(~N~0 <= 0); {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:07,444 INFO L263 TraceCheckUtils]: 7: Hoare triple {283#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:07,444 INFO L280 TraceCheckUtils]: 8: Hoare triple {283#(< 0 ~N~0)} ~cond := #in~cond; {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:07,445 INFO L280 TraceCheckUtils]: 9: Hoare triple {283#(< 0 ~N~0)} assume !(0 == ~cond); {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:07,446 INFO L280 TraceCheckUtils]: 10: Hoare triple {283#(< 0 ~N~0)} assume true; {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:07,447 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {283#(< 0 ~N~0)} {283#(< 0 ~N~0)} #106#return; {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:07,449 INFO L280 TraceCheckUtils]: 12: Hoare triple {283#(< 0 ~N~0)} 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 #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {302#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-17 22:49:07,450 INFO L280 TraceCheckUtils]: 13: Hoare triple {302#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {261#false} is VALID [2020-07-17 22:49:07,450 INFO L280 TraceCheckUtils]: 14: Hoare triple {261#false} ~i~0 := 0; {261#false} is VALID [2020-07-17 22:49:07,450 INFO L280 TraceCheckUtils]: 15: Hoare triple {261#false} assume !(~i~0 < ~N~0); {261#false} is VALID [2020-07-17 22:49:07,451 INFO L280 TraceCheckUtils]: 16: Hoare triple {261#false} ~i~0 := 0; {261#false} is VALID [2020-07-17 22:49:07,451 INFO L280 TraceCheckUtils]: 17: Hoare triple {261#false} assume !(~i~0 < ~N~0); {261#false} is VALID [2020-07-17 22:49:07,451 INFO L280 TraceCheckUtils]: 18: Hoare triple {261#false} ~i~0 := 0; {261#false} is VALID [2020-07-17 22:49:07,452 INFO L280 TraceCheckUtils]: 19: Hoare triple {261#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {261#false} is VALID [2020-07-17 22:49:07,452 INFO L263 TraceCheckUtils]: 20: Hoare triple {261#false} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {261#false} is VALID [2020-07-17 22:49:07,452 INFO L280 TraceCheckUtils]: 21: Hoare triple {261#false} ~cond := #in~cond; {261#false} is VALID [2020-07-17 22:49:07,453 INFO L280 TraceCheckUtils]: 22: Hoare triple {261#false} assume 0 == ~cond; {261#false} is VALID [2020-07-17 22:49:07,453 INFO L280 TraceCheckUtils]: 23: Hoare triple {261#false} assume !false; {261#false} is VALID [2020-07-17 22:49:07,455 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,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933508471] [2020-07-17 22:49:07,456 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:07,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060195674] [2020-07-17 22:49:07,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:07,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:49:07,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262058879] [2020-07-17 22:49:07,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:49:07,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:07,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:49:07,491 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:07,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:49:07,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:49:07,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:07,492 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 4 states. [2020-07-17 22:49:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,721 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2020-07-17 22:49:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:49:07,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:49:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2020-07-17 22:49:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2020-07-17 22:49:07,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2020-07-17 22:49:07,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:07,864 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:49:07,864 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:49:07,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:49:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-17 22:49:07,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:07,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 38 states. [2020-07-17 22:49:07,906 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 38 states. [2020-07-17 22:49:07,907 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 38 states. [2020-07-17 22:49:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,912 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:49:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:49:07,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:07,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:07,914 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 48 states. [2020-07-17 22:49:07,914 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 48 states. [2020-07-17 22:49:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,919 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:49:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:49:07,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:07,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:07,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:07,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:49:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2020-07-17 22:49:07,924 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2020-07-17 22:49:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:07,924 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2020-07-17 22:49:07,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:49:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2020-07-17 22:49:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:49:07,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:07,926 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:08,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:49:08,140 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1796917477, now seen corresponding path program 1 times [2020-07-17 22:49:08,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:08,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303145478] [2020-07-17 22:49:08,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:08,177 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:08,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718171771] [2020-07-17 22:49:08,197 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,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:49:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:08,321 INFO L263 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2020-07-17 22:49:08,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {573#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {573#true} is VALID [2020-07-17 22:49:08,321 INFO L280 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2020-07-17 22:49:08,322 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #110#return; {573#true} is VALID [2020-07-17 22:49:08,322 INFO L263 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret14 := main(); {573#true} is VALID [2020-07-17 22:49:08,322 INFO L280 TraceCheckUtils]: 5: Hoare triple {573#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {573#true} is VALID [2020-07-17 22:49:08,322 INFO L280 TraceCheckUtils]: 6: Hoare triple {573#true} assume !(~N~0 <= 0); {573#true} is VALID [2020-07-17 22:49:08,323 INFO L263 TraceCheckUtils]: 7: Hoare triple {573#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {573#true} is VALID [2020-07-17 22:49:08,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {573#true} ~cond := #in~cond; {573#true} is VALID [2020-07-17 22:49:08,323 INFO L280 TraceCheckUtils]: 9: Hoare triple {573#true} assume !(0 == ~cond); {573#true} is VALID [2020-07-17 22:49:08,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {573#true} assume true; {573#true} is VALID [2020-07-17 22:49:08,324 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {573#true} {573#true} #106#return; {573#true} is VALID [2020-07-17 22:49:08,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {573#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 #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {573#true} is VALID [2020-07-17 22:49:08,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {573#true} assume !!(~i~0 < ~N~0); {573#true} is VALID [2020-07-17 22:49:08,325 INFO L280 TraceCheckUtils]: 14: Hoare triple {573#true} assume 0 == ~i~0;call write~int(0, ~a~0.base, ~a~0.offset, 8); {573#true} is VALID [2020-07-17 22:49:08,325 INFO L280 TraceCheckUtils]: 15: Hoare triple {573#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {573#true} is VALID [2020-07-17 22:49:08,325 INFO L280 TraceCheckUtils]: 16: Hoare triple {573#true} assume !(~i~0 < ~N~0); {573#true} is VALID [2020-07-17 22:49:08,326 INFO L280 TraceCheckUtils]: 17: Hoare triple {573#true} ~i~0 := 0; {573#true} is VALID [2020-07-17 22:49:08,326 INFO L280 TraceCheckUtils]: 18: Hoare triple {573#true} assume !!(~i~0 < ~N~0); {573#true} is VALID [2020-07-17 22:49:08,326 INFO L280 TraceCheckUtils]: 19: Hoare triple {573#true} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {573#true} is VALID [2020-07-17 22:49:08,327 INFO L280 TraceCheckUtils]: 20: Hoare triple {573#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {573#true} is VALID [2020-07-17 22:49:08,327 INFO L280 TraceCheckUtils]: 21: Hoare triple {573#true} assume !(~i~0 < ~N~0); {573#true} is VALID [2020-07-17 22:49:08,328 INFO L280 TraceCheckUtils]: 22: Hoare triple {573#true} ~i~0 := 0; {644#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:08,330 INFO L280 TraceCheckUtils]: 23: Hoare triple {644#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {644#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:08,331 INFO L280 TraceCheckUtils]: 24: Hoare triple {644#(= 0 main_~i~0)} assume !(0 == ~i~0);call #t~mem10 := read~int(~c~0.base, ~c~0.offset + 8 * (~i~0 - 1), 8);call #t~mem11 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem10 + #t~mem11, ~c~0.base, ~c~0.offset + 8 * ~i~0, 8);havoc #t~mem11;havoc #t~mem10; {574#false} is VALID [2020-07-17 22:49:08,332 INFO L280 TraceCheckUtils]: 25: Hoare triple {574#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {574#false} is VALID [2020-07-17 22:49:08,332 INFO L280 TraceCheckUtils]: 26: Hoare triple {574#false} assume !(~i~0 < ~N~0); {574#false} is VALID [2020-07-17 22:49:08,333 INFO L280 TraceCheckUtils]: 27: Hoare triple {574#false} ~i~0 := 0; {574#false} is VALID [2020-07-17 22:49:08,333 INFO L280 TraceCheckUtils]: 28: Hoare triple {574#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {574#false} is VALID [2020-07-17 22:49:08,333 INFO L263 TraceCheckUtils]: 29: Hoare triple {574#false} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {574#false} is VALID [2020-07-17 22:49:08,333 INFO L280 TraceCheckUtils]: 30: Hoare triple {574#false} ~cond := #in~cond; {574#false} is VALID [2020-07-17 22:49:08,334 INFO L280 TraceCheckUtils]: 31: Hoare triple {574#false} assume 0 == ~cond; {574#false} is VALID [2020-07-17 22:49:08,334 INFO L280 TraceCheckUtils]: 32: Hoare triple {574#false} assume !false; {574#false} is VALID [2020-07-17 22:49:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:49:08,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303145478] [2020-07-17 22:49:08,336 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:08,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718171771] [2020-07-17 22:49:08,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:08,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:08,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285022301] [2020-07-17 22:49:08,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-17 22:49:08,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:08,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:08,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:08,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:08,383 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 3 states. [2020-07-17 22:49:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,535 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2020-07-17 22:49:08,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:08,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-17 22:49:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-17 22:49:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-17 22:49:08,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2020-07-17 22:49:08,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,645 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:49:08,646 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:49:08,646 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:49:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2020-07-17 22:49:08,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:08,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 41 states. [2020-07-17 22:49:08,673 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 41 states. [2020-07-17 22:49:08,673 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 41 states. [2020-07-17 22:49:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,676 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-17 22:49:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-17 22:49:08,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,678 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 48 states. [2020-07-17 22:49:08,678 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 48 states. [2020-07-17 22:49:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,681 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-17 22:49:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-17 22:49:08,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:08,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-17 22:49:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2020-07-17 22:49:08,685 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 33 [2020-07-17 22:49:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:08,685 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2020-07-17 22:49:08,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2020-07-17 22:49:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:49:08,686 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:08,687 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:08,901 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,902 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1817991449, now seen corresponding path program 1 times [2020-07-17 22:49:08,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:08,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998981704] [2020-07-17 22:49:08,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:08,949 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:08,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6116213] [2020-07-17 22:49:08,950 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,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:49:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:09,080 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 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 22:49:09,080 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:09,084 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:09,085 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:09,085 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-17 22:49:09,135 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:09,136 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:09,137 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-17 22:49:09,149 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-17 22:49:09,150 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:09,150 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-17 22:49:09,154 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:09,155 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~c~0.base, main_~c~0.offset]. (let ((.cse0 (select |#memory_int| main_~c~0.base))) (and (= |main_#t~mem13| (select .cse0 (+ (* main_~i~0 8) main_~c~0.offset))) (= 0 (select .cse0 main_~c~0.offset)) (= 0 main_~i~0))) [2020-07-17 22:49:09,155 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem13| 0) (= 0 main_~i~0)) [2020-07-17 22:49:09,217 INFO L263 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2020-07-17 22:49:09,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {923#true} is VALID [2020-07-17 22:49:09,218 INFO L280 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2020-07-17 22:49:09,218 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #110#return; {923#true} is VALID [2020-07-17 22:49:09,219 INFO L263 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret14 := main(); {923#true} is VALID [2020-07-17 22:49:09,219 INFO L280 TraceCheckUtils]: 5: Hoare triple {923#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {923#true} is VALID [2020-07-17 22:49:09,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {923#true} assume !(~N~0 <= 0); {923#true} is VALID [2020-07-17 22:49:09,219 INFO L263 TraceCheckUtils]: 7: Hoare triple {923#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {923#true} is VALID [2020-07-17 22:49:09,220 INFO L280 TraceCheckUtils]: 8: Hoare triple {923#true} ~cond := #in~cond; {923#true} is VALID [2020-07-17 22:49:09,220 INFO L280 TraceCheckUtils]: 9: Hoare triple {923#true} assume !(0 == ~cond); {923#true} is VALID [2020-07-17 22:49:09,220 INFO L280 TraceCheckUtils]: 10: Hoare triple {923#true} assume true; {923#true} is VALID [2020-07-17 22:49:09,221 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {923#true} {923#true} #106#return; {923#true} is VALID [2020-07-17 22:49:09,221 INFO L280 TraceCheckUtils]: 12: Hoare triple {923#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 #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {923#true} is VALID [2020-07-17 22:49:09,221 INFO L280 TraceCheckUtils]: 13: Hoare triple {923#true} assume !!(~i~0 < ~N~0); {923#true} is VALID [2020-07-17 22:49:09,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {923#true} assume 0 == ~i~0;call write~int(0, ~a~0.base, ~a~0.offset, 8); {923#true} is VALID [2020-07-17 22:49:09,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {923#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {923#true} is VALID [2020-07-17 22:49:09,222 INFO L280 TraceCheckUtils]: 16: Hoare triple {923#true} assume !(~i~0 < ~N~0); {923#true} is VALID [2020-07-17 22:49:09,222 INFO L280 TraceCheckUtils]: 17: Hoare triple {923#true} ~i~0 := 0; {923#true} is VALID [2020-07-17 22:49:09,223 INFO L280 TraceCheckUtils]: 18: Hoare triple {923#true} assume !!(~i~0 < ~N~0); {923#true} is VALID [2020-07-17 22:49:09,223 INFO L280 TraceCheckUtils]: 19: Hoare triple {923#true} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {923#true} is VALID [2020-07-17 22:49:09,223 INFO L280 TraceCheckUtils]: 20: Hoare triple {923#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {923#true} is VALID [2020-07-17 22:49:09,223 INFO L280 TraceCheckUtils]: 21: Hoare triple {923#true} assume !(~i~0 < ~N~0); {923#true} is VALID [2020-07-17 22:49:09,224 INFO L280 TraceCheckUtils]: 22: Hoare triple {923#true} ~i~0 := 0; {923#true} is VALID [2020-07-17 22:49:09,224 INFO L280 TraceCheckUtils]: 23: Hoare triple {923#true} assume !!(~i~0 < ~N~0); {923#true} is VALID [2020-07-17 22:49:09,226 INFO L280 TraceCheckUtils]: 24: Hoare triple {923#true} assume 0 == ~i~0;call write~int(0, ~c~0.base, ~c~0.offset, 8); {1000#(= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset))} is VALID [2020-07-17 22:49:09,226 INFO L280 TraceCheckUtils]: 25: Hoare triple {1000#(= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1000#(= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset))} is VALID [2020-07-17 22:49:09,227 INFO L280 TraceCheckUtils]: 26: Hoare triple {1000#(= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset))} assume !(~i~0 < ~N~0); {1000#(= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset))} is VALID [2020-07-17 22:49:09,228 INFO L280 TraceCheckUtils]: 27: Hoare triple {1000#(= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset))} ~i~0 := 0; {1010#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:09,229 INFO L280 TraceCheckUtils]: 28: Hoare triple {1010#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {1014#(and (= |main_#t~mem13| 0) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:09,230 INFO L263 TraceCheckUtils]: 29: Hoare triple {1014#(and (= |main_#t~mem13| 0) (= 0 main_~i~0))} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {1018#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:09,231 INFO L280 TraceCheckUtils]: 30: Hoare triple {1018#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1022#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:09,232 INFO L280 TraceCheckUtils]: 31: Hoare triple {1022#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {924#false} is VALID [2020-07-17 22:49:09,232 INFO L280 TraceCheckUtils]: 32: Hoare triple {924#false} assume !false; {924#false} is VALID [2020-07-17 22:49:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:49:09,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998981704] [2020-07-17 22:49:09,235 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:09,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6116213] [2020-07-17 22:49:09,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:09,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:49:09,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010242087] [2020-07-17 22:49:09,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 22:49:09,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:09,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:49:09,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:09,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:49:09,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:09,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:49:09,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:09,275 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 7 states. [2020-07-17 22:49:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,661 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-17 22:49:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:49:09,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 22:49:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2020-07-17 22:49:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2020-07-17 22:49:09,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2020-07-17 22:49:09,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:09,744 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:49:09,744 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:49:09,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:49:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:49:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-07-17 22:49:09,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:09,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2020-07-17 22:49:09,788 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2020-07-17 22:49:09,788 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2020-07-17 22:49:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,791 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-17 22:49:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2020-07-17 22:49:09,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:09,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:09,792 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2020-07-17 22:49:09,792 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2020-07-17 22:49:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,795 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-17 22:49:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2020-07-17 22:49:09,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:09,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:09,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:09,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:49:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2020-07-17 22:49:09,799 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2020-07-17 22:49:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:09,799 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-07-17 22:49:09,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:49:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-17 22:49:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-17 22:49:09,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:09,801 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:10,007 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:10,008 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1651297135, now seen corresponding path program 1 times [2020-07-17 22:49:10,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:10,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341153658] [2020-07-17 22:49:10,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:10,041 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:10,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481862441] [2020-07-17 22:49:10,042 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:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:10,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:49:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:10,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:10,276 INFO L263 TraceCheckUtils]: 0: Hoare triple {1267#true} call ULTIMATE.init(); {1267#true} is VALID [2020-07-17 22:49:10,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {1267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1267#true} is VALID [2020-07-17 22:49:10,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {1267#true} assume true; {1267#true} is VALID [2020-07-17 22:49:10,277 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1267#true} {1267#true} #110#return; {1267#true} is VALID [2020-07-17 22:49:10,278 INFO L263 TraceCheckUtils]: 4: Hoare triple {1267#true} call #t~ret14 := main(); {1267#true} is VALID [2020-07-17 22:49:10,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {1267#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1267#true} is VALID [2020-07-17 22:49:10,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {1267#true} assume !(~N~0 <= 0); {1267#true} is VALID [2020-07-17 22:49:10,278 INFO L263 TraceCheckUtils]: 7: Hoare triple {1267#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1267#true} is VALID [2020-07-17 22:49:10,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {1267#true} ~cond := #in~cond; {1267#true} is VALID [2020-07-17 22:49:10,279 INFO L280 TraceCheckUtils]: 9: Hoare triple {1267#true} assume !(0 == ~cond); {1267#true} is VALID [2020-07-17 22:49:10,280 INFO L280 TraceCheckUtils]: 10: Hoare triple {1267#true} assume true; {1267#true} is VALID [2020-07-17 22:49:10,280 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1267#true} {1267#true} #106#return; {1267#true} is VALID [2020-07-17 22:49:10,282 INFO L280 TraceCheckUtils]: 12: Hoare triple {1267#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 #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {1308#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:10,283 INFO L280 TraceCheckUtils]: 13: Hoare triple {1308#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0); {1308#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:10,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {1308#(<= main_~i~0 0)} assume 0 == ~i~0;call write~int(0, ~a~0.base, ~a~0.offset, 8); {1308#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:10,285 INFO L280 TraceCheckUtils]: 15: Hoare triple {1308#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1318#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:10,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {1318#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {1322#(<= ~N~0 1)} ~i~0 := 0; {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,289 INFO L280 TraceCheckUtils]: 18: Hoare triple {1322#(<= ~N~0 1)} assume !!(~i~0 < ~N~0); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {1322#(<= ~N~0 1)} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,290 INFO L280 TraceCheckUtils]: 20: Hoare triple {1322#(<= ~N~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,291 INFO L280 TraceCheckUtils]: 21: Hoare triple {1322#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,291 INFO L280 TraceCheckUtils]: 22: Hoare triple {1322#(<= ~N~0 1)} ~i~0 := 0; {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,292 INFO L280 TraceCheckUtils]: 23: Hoare triple {1322#(<= ~N~0 1)} assume !!(~i~0 < ~N~0); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,293 INFO L280 TraceCheckUtils]: 24: Hoare triple {1322#(<= ~N~0 1)} assume 0 == ~i~0;call write~int(0, ~c~0.base, ~c~0.offset, 8); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,293 INFO L280 TraceCheckUtils]: 25: Hoare triple {1322#(<= ~N~0 1)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,299 INFO L280 TraceCheckUtils]: 26: Hoare triple {1322#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,300 INFO L280 TraceCheckUtils]: 27: Hoare triple {1322#(<= ~N~0 1)} ~i~0 := 0; {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:10,301 INFO L280 TraceCheckUtils]: 28: Hoare triple {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:10,305 INFO L263 TraceCheckUtils]: 29: Hoare triple {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,306 INFO L280 TraceCheckUtils]: 30: Hoare triple {1322#(<= ~N~0 1)} ~cond := #in~cond; {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,306 INFO L280 TraceCheckUtils]: 31: Hoare triple {1322#(<= ~N~0 1)} assume !(0 == ~cond); {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,307 INFO L280 TraceCheckUtils]: 32: Hoare triple {1322#(<= ~N~0 1)} assume true; {1322#(<= ~N~0 1)} is VALID [2020-07-17 22:49:10,307 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1322#(<= ~N~0 1)} {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} #108#return; {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:10,308 INFO L280 TraceCheckUtils]: 34: Hoare triple {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} havoc #t~mem13; {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:10,310 INFO L280 TraceCheckUtils]: 35: Hoare triple {1356#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1381#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:10,311 INFO L280 TraceCheckUtils]: 36: Hoare triple {1381#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {1268#false} is VALID [2020-07-17 22:49:10,311 INFO L263 TraceCheckUtils]: 37: Hoare triple {1268#false} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {1268#false} is VALID [2020-07-17 22:49:10,311 INFO L280 TraceCheckUtils]: 38: Hoare triple {1268#false} ~cond := #in~cond; {1268#false} is VALID [2020-07-17 22:49:10,311 INFO L280 TraceCheckUtils]: 39: Hoare triple {1268#false} assume 0 == ~cond; {1268#false} is VALID [2020-07-17 22:49:10,312 INFO L280 TraceCheckUtils]: 40: Hoare triple {1268#false} assume !false; {1268#false} is VALID [2020-07-17 22:49:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:49:10,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341153658] [2020-07-17 22:49:10,314 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:10,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481862441] [2020-07-17 22:49:10,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:10,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:49:10,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385038389] [2020-07-17 22:49:10,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-07-17 22:49:10,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:10,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:49:10,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:10,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:49:10,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:49:10,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:10,426 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2020-07-17 22:49:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,019 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2020-07-17 22:49:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:49:11,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-07-17 22:49:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2020-07-17 22:49:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2020-07-17 22:49:11,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 121 transitions. [2020-07-17 22:49:11,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:11,174 INFO L225 Difference]: With dead ends: 113 [2020-07-17 22:49:11,175 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 22:49:11,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:49:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 22:49:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2020-07-17 22:49:11,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:11,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 53 states. [2020-07-17 22:49:11,228 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 53 states. [2020-07-17 22:49:11,229 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 53 states. [2020-07-17 22:49:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,234 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2020-07-17 22:49:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2020-07-17 22:49:11,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:11,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:11,237 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 65 states. [2020-07-17 22:49:11,238 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 65 states. [2020-07-17 22:49:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,245 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2020-07-17 22:49:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2020-07-17 22:49:11,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:11,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:11,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:11,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-17 22:49:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2020-07-17 22:49:11,253 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 41 [2020-07-17 22:49:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:11,254 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2020-07-17 22:49:11,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:49:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2020-07-17 22:49:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 22:49:11,255 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:11,255 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:11,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:11,478 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:11,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:11,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2142090186, now seen corresponding path program 1 times [2020-07-17 22:49:11,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:11,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426374340] [2020-07-17 22:49:11,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:11,541 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:11,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373996090] [2020-07-17 22:49:11,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:49:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-17 22:49:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:11,638 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 14 treesize of output 12 [2020-07-17 22:49:11,638 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:11,650 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:11,653 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:11,654 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:8 [2020-07-17 22:49:11,704 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 11 treesize of output 7 [2020-07-17 22:49:11,704 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:11,711 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:11,711 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:11,712 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-07-17 22:49:11,817 INFO L350 Elim1Store]: treesize reduction 34, result has 57.0 percent of original size [2020-07-17 22:49:11,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 59 [2020-07-17 22:49:11,831 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:11,870 INFO L624 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2020-07-17 22:49:11,871 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:11,872 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:12 [2020-07-17 22:49:16,076 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:16,076 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, main_~a~0.base, main_~a~0.offset]. (let ((.cse1 (select |v_#memory_int_19| main_~b~0.base))) (let ((.cse0 (select .cse1 main_~b~0.offset))) (and (= 1 .cse0) (= (store |v_#memory_int_19| main_~b~0.base (store .cse1 (+ main_~b~0.offset 8) (+ .cse0 (select (select |v_#memory_int_19| main_~a~0.base) main_~a~0.offset)))) |#memory_int|) (not (= main_~c~0.base main_~b~0.base))))) [2020-07-17 22:49:16,077 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base))) [2020-07-17 22:49:16,136 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-17 22:49:16,138 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,146 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:16,147 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,147 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2020-07-17 22:49:16,242 INFO L350 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2020-07-17 22:49:16,243 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2020-07-17 22:49:16,248 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,258 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:16,261 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:16,262 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2020-07-17 22:49:16,770 INFO L350 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2020-07-17 22:49:16,771 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 39 [2020-07-17 22:49:16,772 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,787 INFO L624 ElimStorePlain]: treesize reduction 23, result has 32.4 percent of original size [2020-07-17 22:49:16,788 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:7 [2020-07-17 22:49:16,792 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:16,792 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~c~0.base, main_~c~0.offset, main_~b~0.base, main_~b~0.offset]. (let ((.cse1 (select (select |#memory_int| main_~b~0.base) main_~b~0.offset)) (.cse0 (select |#memory_int| main_~c~0.base))) (and (= |main_#t~mem13| (select .cse0 (+ (* main_~i~0 8) main_~c~0.offset))) (= .cse1 1) (= 1 main_~i~0) (= 0 (select .cse0 main_~c~0.offset)) (not (= main_~c~0.base main_~b~0.base)) (= .cse1 (select .cse0 (+ main_~c~0.offset 8))))) [2020-07-17 22:49:16,793 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 main_~i~0) (= |main_#t~mem13| 1)) [2020-07-17 22:49:16,857 INFO L263 TraceCheckUtils]: 0: Hoare triple {1759#true} call ULTIMATE.init(); {1759#true} is VALID [2020-07-17 22:49:16,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {1759#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1759#true} is VALID [2020-07-17 22:49:16,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {1759#true} assume true; {1759#true} is VALID [2020-07-17 22:49:16,858 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1759#true} {1759#true} #110#return; {1759#true} is VALID [2020-07-17 22:49:16,859 INFO L263 TraceCheckUtils]: 4: Hoare triple {1759#true} call #t~ret14 := main(); {1759#true} is VALID [2020-07-17 22:49:16,859 INFO L280 TraceCheckUtils]: 5: Hoare triple {1759#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1759#true} is VALID [2020-07-17 22:49:16,859 INFO L280 TraceCheckUtils]: 6: Hoare triple {1759#true} assume !(~N~0 <= 0); {1759#true} is VALID [2020-07-17 22:49:16,859 INFO L263 TraceCheckUtils]: 7: Hoare triple {1759#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1759#true} is VALID [2020-07-17 22:49:16,860 INFO L280 TraceCheckUtils]: 8: Hoare triple {1759#true} ~cond := #in~cond; {1759#true} is VALID [2020-07-17 22:49:16,860 INFO L280 TraceCheckUtils]: 9: Hoare triple {1759#true} assume !(0 == ~cond); {1759#true} is VALID [2020-07-17 22:49:16,860 INFO L280 TraceCheckUtils]: 10: Hoare triple {1759#true} assume true; {1759#true} is VALID [2020-07-17 22:49:16,861 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1759#true} {1759#true} #106#return; {1759#true} is VALID [2020-07-17 22:49:16,863 INFO L280 TraceCheckUtils]: 12: Hoare triple {1759#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 #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,863 INFO L280 TraceCheckUtils]: 13: Hoare triple {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,864 INFO L280 TraceCheckUtils]: 14: Hoare triple {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} assume 0 == ~i~0;call write~int(0, ~a~0.base, ~a~0.offset, 8); {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,864 INFO L280 TraceCheckUtils]: 15: Hoare triple {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1810#(not (= main_~c~0.base main_~b~0.base))} is VALID [2020-07-17 22:49:16,865 INFO L280 TraceCheckUtils]: 16: Hoare triple {1810#(not (= main_~c~0.base main_~b~0.base))} assume !!(~i~0 < ~N~0); {1810#(not (= main_~c~0.base main_~b~0.base))} is VALID [2020-07-17 22:49:16,867 INFO L280 TraceCheckUtils]: 17: Hoare triple {1810#(not (= main_~c~0.base main_~b~0.base))} assume !(0 == ~i~0);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(6 + #t~mem5, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem5; {1810#(not (= main_~c~0.base main_~b~0.base))} is VALID [2020-07-17 22:49:16,868 INFO L280 TraceCheckUtils]: 18: Hoare triple {1810#(not (= main_~c~0.base main_~b~0.base))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1810#(not (= main_~c~0.base main_~b~0.base))} is VALID [2020-07-17 22:49:16,868 INFO L280 TraceCheckUtils]: 19: Hoare triple {1810#(not (= main_~c~0.base main_~b~0.base))} assume !(~i~0 < ~N~0); {1810#(not (= main_~c~0.base main_~b~0.base))} is VALID [2020-07-17 22:49:16,869 INFO L280 TraceCheckUtils]: 20: Hoare triple {1810#(not (= main_~c~0.base main_~b~0.base))} ~i~0 := 0; {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,870 INFO L280 TraceCheckUtils]: 21: Hoare triple {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,871 INFO L280 TraceCheckUtils]: 22: Hoare triple {1800#(and (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {1832#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,871 INFO L280 TraceCheckUtils]: 23: Hoare triple {1832#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1836#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,872 INFO L280 TraceCheckUtils]: 24: Hoare triple {1836#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1836#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,874 INFO L280 TraceCheckUtils]: 25: Hoare triple {1836#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} assume !(0 == ~i~0);call #t~mem7 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem7 + #t~mem8, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem8;havoc #t~mem7; {1843#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,875 INFO L280 TraceCheckUtils]: 26: Hoare triple {1843#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1843#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,876 INFO L280 TraceCheckUtils]: 27: Hoare triple {1843#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)))} assume !(~i~0 < ~N~0); {1843#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,876 INFO L280 TraceCheckUtils]: 28: Hoare triple {1843#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)))} ~i~0 := 0; {1832#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,877 INFO L280 TraceCheckUtils]: 29: Hoare triple {1832#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1832#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,881 INFO L280 TraceCheckUtils]: 30: Hoare triple {1832#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} assume 0 == ~i~0;call write~int(0, ~c~0.base, ~c~0.offset, 8); {1859#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,882 INFO L280 TraceCheckUtils]: 31: Hoare triple {1859#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (not (= main_~c~0.base main_~b~0.base)))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1863#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,883 INFO L280 TraceCheckUtils]: 32: Hoare triple {1863#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (not (= main_~c~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1863#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (not (= main_~c~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,887 INFO L280 TraceCheckUtils]: 33: Hoare triple {1863#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (not (= main_~c~0.base main_~b~0.base)))} assume !(0 == ~i~0);call #t~mem10 := read~int(~c~0.base, ~c~0.offset + 8 * (~i~0 - 1), 8);call #t~mem11 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem10 + #t~mem11, ~c~0.base, ~c~0.offset + 8 * ~i~0, 8);havoc #t~mem11;havoc #t~mem10; {1870#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} is VALID [2020-07-17 22:49:16,888 INFO L280 TraceCheckUtils]: 34: Hoare triple {1870#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1870#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} is VALID [2020-07-17 22:49:16,888 INFO L280 TraceCheckUtils]: 35: Hoare triple {1870#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} assume !(~i~0 < ~N~0); {1870#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} is VALID [2020-07-17 22:49:16,889 INFO L280 TraceCheckUtils]: 36: Hoare triple {1870#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} ~i~0 := 0; {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} is VALID [2020-07-17 22:49:16,890 INFO L280 TraceCheckUtils]: 37: Hoare triple {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} is VALID [2020-07-17 22:49:16,892 INFO L263 TraceCheckUtils]: 38: Hoare triple {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {1887#(exists ((main_~b~0.offset Int) (v_main_~c~0.offset_BEFORE_CALL_1 Int) (main_~b~0.base Int) (v_main_~c~0.base_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) (+ v_main_~c~0.offset_BEFORE_CALL_1 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= v_main_~c~0.base_BEFORE_CALL_1 main_~b~0.base)) (= 0 (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) v_main_~c~0.offset_BEFORE_CALL_1))))} is VALID [2020-07-17 22:49:16,893 INFO L280 TraceCheckUtils]: 39: Hoare triple {1887#(exists ((main_~b~0.offset Int) (v_main_~c~0.offset_BEFORE_CALL_1 Int) (main_~b~0.base Int) (v_main_~c~0.base_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) (+ v_main_~c~0.offset_BEFORE_CALL_1 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= v_main_~c~0.base_BEFORE_CALL_1 main_~b~0.base)) (= 0 (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) v_main_~c~0.offset_BEFORE_CALL_1))))} ~cond := #in~cond; {1887#(exists ((main_~b~0.offset Int) (v_main_~c~0.offset_BEFORE_CALL_1 Int) (main_~b~0.base Int) (v_main_~c~0.base_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) (+ v_main_~c~0.offset_BEFORE_CALL_1 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= v_main_~c~0.base_BEFORE_CALL_1 main_~b~0.base)) (= 0 (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) v_main_~c~0.offset_BEFORE_CALL_1))))} is VALID [2020-07-17 22:49:16,897 INFO L280 TraceCheckUtils]: 40: Hoare triple {1887#(exists ((main_~b~0.offset Int) (v_main_~c~0.offset_BEFORE_CALL_1 Int) (main_~b~0.base Int) (v_main_~c~0.base_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) (+ v_main_~c~0.offset_BEFORE_CALL_1 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= v_main_~c~0.base_BEFORE_CALL_1 main_~b~0.base)) (= 0 (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) v_main_~c~0.offset_BEFORE_CALL_1))))} assume !(0 == ~cond); {1887#(exists ((main_~b~0.offset Int) (v_main_~c~0.offset_BEFORE_CALL_1 Int) (main_~b~0.base Int) (v_main_~c~0.base_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) (+ v_main_~c~0.offset_BEFORE_CALL_1 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= v_main_~c~0.base_BEFORE_CALL_1 main_~b~0.base)) (= 0 (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) v_main_~c~0.offset_BEFORE_CALL_1))))} is VALID [2020-07-17 22:49:16,898 INFO L280 TraceCheckUtils]: 41: Hoare triple {1887#(exists ((main_~b~0.offset Int) (v_main_~c~0.offset_BEFORE_CALL_1 Int) (main_~b~0.base Int) (v_main_~c~0.base_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) (+ v_main_~c~0.offset_BEFORE_CALL_1 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= v_main_~c~0.base_BEFORE_CALL_1 main_~b~0.base)) (= 0 (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) v_main_~c~0.offset_BEFORE_CALL_1))))} assume true; {1887#(exists ((main_~b~0.offset Int) (v_main_~c~0.offset_BEFORE_CALL_1 Int) (main_~b~0.base Int) (v_main_~c~0.base_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) (+ v_main_~c~0.offset_BEFORE_CALL_1 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= v_main_~c~0.base_BEFORE_CALL_1 main_~b~0.base)) (= 0 (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) v_main_~c~0.offset_BEFORE_CALL_1))))} is VALID [2020-07-17 22:49:16,899 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1887#(exists ((main_~b~0.offset Int) (v_main_~c~0.offset_BEFORE_CALL_1 Int) (main_~b~0.base Int) (v_main_~c~0.base_BEFORE_CALL_1 Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) (+ v_main_~c~0.offset_BEFORE_CALL_1 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= v_main_~c~0.base_BEFORE_CALL_1 main_~b~0.base)) (= 0 (select (select |#memory_int| v_main_~c~0.base_BEFORE_CALL_1) v_main_~c~0.offset_BEFORE_CALL_1))))} {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} #108#return; {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} is VALID [2020-07-17 22:49:16,900 INFO L280 TraceCheckUtils]: 43: Hoare triple {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} havoc #t~mem13; {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} is VALID [2020-07-17 22:49:16,901 INFO L280 TraceCheckUtils]: 44: Hoare triple {1880#(and (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (= 0 main_~i~0) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {1906#(and (= 1 main_~i~0) (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} is VALID [2020-07-17 22:49:16,902 INFO L280 TraceCheckUtils]: 45: Hoare triple {1906#(and (= 1 main_~i~0) (= 0 (select (select |#memory_int| main_~c~0.base) main_~c~0.offset)) (exists ((main_~b~0.offset Int) (main_~b~0.base Int)) (and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (not (= main_~c~0.base main_~b~0.base)) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) (select (select |#memory_int| main_~c~0.base) (+ main_~c~0.offset 8))))))} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {1910#(and (= 1 main_~i~0) (= |main_#t~mem13| 1))} is VALID [2020-07-17 22:49:16,903 INFO L263 TraceCheckUtils]: 46: Hoare triple {1910#(and (= 1 main_~i~0) (= |main_#t~mem13| 1))} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {1914#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:16,903 INFO L280 TraceCheckUtils]: 47: Hoare triple {1914#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1918#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:16,904 INFO L280 TraceCheckUtils]: 48: Hoare triple {1918#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1760#false} is VALID [2020-07-17 22:49:16,904 INFO L280 TraceCheckUtils]: 49: Hoare triple {1760#false} assume !false; {1760#false} is VALID [2020-07-17 22:49:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:49:16,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426374340] [2020-07-17 22:49:16,914 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:16,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373996090] [2020-07-17 22:49:16,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:16,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 22:49:16,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576632239] [2020-07-17 22:49:16,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2020-07-17 22:49:16,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:16,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:49:17,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:17,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:49:17,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:49:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:49:17,024 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 16 states. [2020-07-17 22:49:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:35,889 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2020-07-17 22:49:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 22:49:35,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2020-07-17 22:49:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:49:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 98 transitions. [2020-07-17 22:49:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:49:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 98 transitions. [2020-07-17 22:49:35,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 98 transitions. [2020-07-17 22:49:36,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:36,146 INFO L225 Difference]: With dead ends: 100 [2020-07-17 22:49:36,147 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 22:49:36,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2020-07-17 22:49:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 22:49:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2020-07-17 22:49:36,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:36,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 63 states. [2020-07-17 22:49:36,237 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 63 states. [2020-07-17 22:49:36,237 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 63 states. [2020-07-17 22:49:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:36,239 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2020-07-17 22:49:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2020-07-17 22:49:36,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:36,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:36,240 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 70 states. [2020-07-17 22:49:36,240 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 70 states. [2020-07-17 22:49:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:36,242 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2020-07-17 22:49:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2020-07-17 22:49:36,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:36,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:36,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:36,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-17 22:49:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2020-07-17 22:49:36,246 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 50 [2020-07-17 22:49:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:36,246 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2020-07-17 22:49:36,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:49:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2020-07-17 22:49:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-17 22:49:36,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:36,248 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:36,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:49:36,462 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:36,463 INFO L82 PathProgramCache]: Analyzing trace with hash 655680800, now seen corresponding path program 2 times [2020-07-17 22:49:36,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:36,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413926177] [2020-07-17 22:49:36,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:36,512 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:36,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929446008] [2020-07-17 22:49:36,512 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 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:49:36,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:49:36,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:49:36,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:49:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:36,599 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:36,788 INFO L263 TraceCheckUtils]: 0: Hoare triple {2299#true} call ULTIMATE.init(); {2299#true} is VALID [2020-07-17 22:49:36,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {2299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2299#true} is VALID [2020-07-17 22:49:36,789 INFO L280 TraceCheckUtils]: 2: Hoare triple {2299#true} assume true; {2299#true} is VALID [2020-07-17 22:49:36,789 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2299#true} {2299#true} #110#return; {2299#true} is VALID [2020-07-17 22:49:36,790 INFO L263 TraceCheckUtils]: 4: Hoare triple {2299#true} call #t~ret14 := main(); {2299#true} is VALID [2020-07-17 22:49:36,790 INFO L280 TraceCheckUtils]: 5: Hoare triple {2299#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {2299#true} is VALID [2020-07-17 22:49:36,790 INFO L280 TraceCheckUtils]: 6: Hoare triple {2299#true} assume !(~N~0 <= 0); {2299#true} is VALID [2020-07-17 22:49:36,791 INFO L263 TraceCheckUtils]: 7: Hoare triple {2299#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {2299#true} is VALID [2020-07-17 22:49:36,791 INFO L280 TraceCheckUtils]: 8: Hoare triple {2299#true} ~cond := #in~cond; {2299#true} is VALID [2020-07-17 22:49:36,791 INFO L280 TraceCheckUtils]: 9: Hoare triple {2299#true} assume !(0 == ~cond); {2299#true} is VALID [2020-07-17 22:49:36,791 INFO L280 TraceCheckUtils]: 10: Hoare triple {2299#true} assume true; {2299#true} is VALID [2020-07-17 22:49:36,791 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2299#true} {2299#true} #106#return; {2299#true} is VALID [2020-07-17 22:49:36,793 INFO L280 TraceCheckUtils]: 12: Hoare triple {2299#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 #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {2340#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:36,796 INFO L280 TraceCheckUtils]: 13: Hoare triple {2340#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0); {2340#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:36,799 INFO L280 TraceCheckUtils]: 14: Hoare triple {2340#(<= main_~i~0 0)} assume 0 == ~i~0;call write~int(0, ~a~0.base, ~a~0.offset, 8); {2340#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:36,803 INFO L280 TraceCheckUtils]: 15: Hoare triple {2340#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2350#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:36,804 INFO L280 TraceCheckUtils]: 16: Hoare triple {2350#(<= main_~i~0 1)} assume !!(~i~0 < ~N~0); {2350#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:36,805 INFO L280 TraceCheckUtils]: 17: Hoare triple {2350#(<= main_~i~0 1)} assume !(0 == ~i~0);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(6 + #t~mem5, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem5; {2350#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:36,811 INFO L280 TraceCheckUtils]: 18: Hoare triple {2350#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2360#(<= main_~i~0 2)} is VALID [2020-07-17 22:49:36,814 INFO L280 TraceCheckUtils]: 19: Hoare triple {2360#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,814 INFO L280 TraceCheckUtils]: 20: Hoare triple {2364#(<= ~N~0 2)} ~i~0 := 0; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,815 INFO L280 TraceCheckUtils]: 21: Hoare triple {2364#(<= ~N~0 2)} assume !!(~i~0 < ~N~0); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,815 INFO L280 TraceCheckUtils]: 22: Hoare triple {2364#(<= ~N~0 2)} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,815 INFO L280 TraceCheckUtils]: 23: Hoare triple {2364#(<= ~N~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,816 INFO L280 TraceCheckUtils]: 24: Hoare triple {2364#(<= ~N~0 2)} assume !!(~i~0 < ~N~0); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,816 INFO L280 TraceCheckUtils]: 25: Hoare triple {2364#(<= ~N~0 2)} assume !(0 == ~i~0);call #t~mem7 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem7 + #t~mem8, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem8;havoc #t~mem7; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,817 INFO L280 TraceCheckUtils]: 26: Hoare triple {2364#(<= ~N~0 2)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,818 INFO L280 TraceCheckUtils]: 27: Hoare triple {2364#(<= ~N~0 2)} assume !(~i~0 < ~N~0); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,818 INFO L280 TraceCheckUtils]: 28: Hoare triple {2364#(<= ~N~0 2)} ~i~0 := 0; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,819 INFO L280 TraceCheckUtils]: 29: Hoare triple {2364#(<= ~N~0 2)} assume !!(~i~0 < ~N~0); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,819 INFO L280 TraceCheckUtils]: 30: Hoare triple {2364#(<= ~N~0 2)} assume 0 == ~i~0;call write~int(0, ~c~0.base, ~c~0.offset, 8); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,819 INFO L280 TraceCheckUtils]: 31: Hoare triple {2364#(<= ~N~0 2)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,820 INFO L280 TraceCheckUtils]: 32: Hoare triple {2364#(<= ~N~0 2)} assume !!(~i~0 < ~N~0); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,820 INFO L280 TraceCheckUtils]: 33: Hoare triple {2364#(<= ~N~0 2)} assume !(0 == ~i~0);call #t~mem10 := read~int(~c~0.base, ~c~0.offset + 8 * (~i~0 - 1), 8);call #t~mem11 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem10 + #t~mem11, ~c~0.base, ~c~0.offset + 8 * ~i~0, 8);havoc #t~mem11;havoc #t~mem10; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,821 INFO L280 TraceCheckUtils]: 34: Hoare triple {2364#(<= ~N~0 2)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,821 INFO L280 TraceCheckUtils]: 35: Hoare triple {2364#(<= ~N~0 2)} assume !(~i~0 < ~N~0); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,822 INFO L280 TraceCheckUtils]: 36: Hoare triple {2364#(<= ~N~0 2)} ~i~0 := 0; {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-17 22:49:36,823 INFO L280 TraceCheckUtils]: 37: Hoare triple {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-17 22:49:36,824 INFO L263 TraceCheckUtils]: 38: Hoare triple {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,825 INFO L280 TraceCheckUtils]: 39: Hoare triple {2364#(<= ~N~0 2)} ~cond := #in~cond; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,825 INFO L280 TraceCheckUtils]: 40: Hoare triple {2364#(<= ~N~0 2)} assume !(0 == ~cond); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,827 INFO L280 TraceCheckUtils]: 41: Hoare triple {2364#(<= ~N~0 2)} assume true; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,829 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2364#(<= ~N~0 2)} {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} #108#return; {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-17 22:49:36,833 INFO L280 TraceCheckUtils]: 43: Hoare triple {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} havoc #t~mem13; {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-17 22:49:36,845 INFO L280 TraceCheckUtils]: 44: Hoare triple {2416#(and (<= ~N~0 2) (<= 0 main_~i~0))} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:36,846 INFO L280 TraceCheckUtils]: 45: Hoare triple {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:36,848 INFO L263 TraceCheckUtils]: 46: Hoare triple {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,848 INFO L280 TraceCheckUtils]: 47: Hoare triple {2364#(<= ~N~0 2)} ~cond := #in~cond; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,849 INFO L280 TraceCheckUtils]: 48: Hoare triple {2364#(<= ~N~0 2)} assume !(0 == ~cond); {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,849 INFO L280 TraceCheckUtils]: 49: Hoare triple {2364#(<= ~N~0 2)} assume true; {2364#(<= ~N~0 2)} is VALID [2020-07-17 22:49:36,850 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2364#(<= ~N~0 2)} {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} #108#return; {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:36,850 INFO L280 TraceCheckUtils]: 51: Hoare triple {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} havoc #t~mem13; {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:36,854 INFO L280 TraceCheckUtils]: 52: Hoare triple {2441#(and (<= ~N~0 2) (<= 1 main_~i~0))} #t~post12 := ~i~0;~i~0 := 1 + #t~post12;havoc #t~post12; {2466#(and (<= ~N~0 2) (<= 2 main_~i~0))} is VALID [2020-07-17 22:49:36,855 INFO L280 TraceCheckUtils]: 53: Hoare triple {2466#(and (<= ~N~0 2) (<= 2 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {2300#false} is VALID [2020-07-17 22:49:36,855 INFO L263 TraceCheckUtils]: 54: Hoare triple {2300#false} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {2300#false} is VALID [2020-07-17 22:49:36,855 INFO L280 TraceCheckUtils]: 55: Hoare triple {2300#false} ~cond := #in~cond; {2300#false} is VALID [2020-07-17 22:49:36,855 INFO L280 TraceCheckUtils]: 56: Hoare triple {2300#false} assume 0 == ~cond; {2300#false} is VALID [2020-07-17 22:49:36,855 INFO L280 TraceCheckUtils]: 57: Hoare triple {2300#false} assume !false; {2300#false} is VALID [2020-07-17 22:49:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-17 22:49:36,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413926177] [2020-07-17 22:49:36,859 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:36,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929446008] [2020-07-17 22:49:36,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:36,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 22:49:36,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136409916] [2020-07-17 22:49:36,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-07-17 22:49:36,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:36,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:49:36,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:36,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:49:36,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:36,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:49:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:49:36,941 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2020-07-17 22:49:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:38,208 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2020-07-17 22:49:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:49:38,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2020-07-17 22:49:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:49:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2020-07-17 22:49:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:49:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2020-07-17 22:49:38,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 147 transitions. [2020-07-17 22:49:38,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:38,528 INFO L225 Difference]: With dead ends: 158 [2020-07-17 22:49:38,528 INFO L226 Difference]: Without dead ends: 82 [2020-07-17 22:49:38,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:49:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-17 22:49:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2020-07-17 22:49:38,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:38,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 70 states. [2020-07-17 22:49:38,618 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 70 states. [2020-07-17 22:49:38,619 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 70 states. [2020-07-17 22:49:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:38,622 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2020-07-17 22:49:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2020-07-17 22:49:38,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:38,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:38,623 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 82 states. [2020-07-17 22:49:38,623 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 82 states. [2020-07-17 22:49:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:38,626 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2020-07-17 22:49:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2020-07-17 22:49:38,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:38,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:38,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:38,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 22:49:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2020-07-17 22:49:38,636 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 58 [2020-07-17 22:49:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:38,637 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2020-07-17 22:49:38,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:49:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-07-17 22:49:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-17 22:49:38,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:38,639 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:38,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:38,854 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash 404343461, now seen corresponding path program 3 times [2020-07-17 22:49:38,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:38,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162702551] [2020-07-17 22:49:38,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:38,878 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:38,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566279101] [2020-07-17 22:49:38,878 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 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:49:38,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:49:38,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-17 22:49:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:39,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:39,056 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:39,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:39,365 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:39,366 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:39,367 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:39,367 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:39,367 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:39,367 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:39,367 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:39,367 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:39,367 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:39,367 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:49:39,368 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-17 22:49:39,369 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-17 22:49:39,370 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-17 22:49:39,370 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-17 22:49:39,370 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2020-07-17 22:49:39,370 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:49:39,370 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:49:39,370 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-17 22:49:39,370 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:49:39,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:39 BoogieIcfgContainer [2020-07-17 22:49:39,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:39,374 INFO L168 Benchmark]: Toolchain (without parser) took 34114.18 ms. Allocated memory was 141.0 MB in the beginning and 309.3 MB in the end (delta: 168.3 MB). Free memory was 104.7 MB in the beginning and 191.2 MB in the end (delta: -86.5 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,375 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.17 ms. Allocated memory is still 141.0 MB. Free memory was 104.3 MB in the beginning and 93.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,376 INFO L168 Benchmark]: Boogie Preprocessor took 128.06 ms. Allocated memory was 141.0 MB in the beginning and 202.9 MB in the end (delta: 61.9 MB). Free memory was 92.9 MB in the beginning and 179.5 MB in the end (delta: -86.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,377 INFO L168 Benchmark]: RCFGBuilder took 482.19 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 151.1 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,377 INFO L168 Benchmark]: TraceAbstraction took 33137.74 ms. Allocated memory was 202.9 MB in the beginning and 309.3 MB in the end (delta: 106.4 MB). Free memory was 150.4 MB in the beginning and 191.2 MB in the end (delta: -40.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,380 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 356.17 ms. Allocated memory is still 141.0 MB. Free memory was 104.3 MB in the beginning and 93.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.06 ms. Allocated memory was 141.0 MB in the beginning and 202.9 MB in the end (delta: 61.9 MB). Free memory was 92.9 MB in the beginning and 179.5 MB in the end (delta: -86.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 482.19 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 151.1 MB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33137.74 ms. Allocated memory was 202.9 MB in the beginning and 309.3 MB in the end (delta: 106.4 MB). Free memory was 150.4 MB in the beginning and 191.2 MB in the end (delta: -40.7 MB). Peak memory consumption was 65.7 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)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=3] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=3] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=3] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=3] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L28] long long *c = malloc(sizeof(long long)*N); [L30] i=0 VAL [\old(N)=0, a={-3:0}, b={1:0}, c={-2:0}, i=0, malloc(sizeof(long long)*N)={-2:0}, malloc(sizeof(long long)*N)={1:0}, malloc(sizeof(long long)*N)={-3:0}, N=3] [L30] COND TRUE i