java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test21_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:47,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:47,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:47,177 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:47,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:47,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:47,181 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:47,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:47,186 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:47,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:47,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:47,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:47,199 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:47,200 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:47,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:47,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:47,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:47,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:47,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:47,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:47,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:47,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:47,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:47,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:47,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:47,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:47,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:47,224 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:47,225 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:47,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:47,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:47,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:47,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:47,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:47,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:47,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:47,229 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:07:47,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:47,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:47,244 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:47,245 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:47,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:47,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:47,246 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:47,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:47,246 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:47,246 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:47,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:47,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:47,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:47,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:47,247 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:47,247 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:47,248 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:47,248 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:47,248 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:47,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:47,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:47,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:47,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:47,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:47,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:47,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:47,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:47,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:47,250 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:47,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:47,250 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:47,251 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:47,251 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:47,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:47,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:47,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:47,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:47,323 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:47,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test21_true-unreach-call_true-termination.c [2018-11-23 11:07:47,391 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08e7972e/f2f4f0969d8a47a99ddec9921db0edb5/FLAGbe5b208b1 [2018-11-23 11:07:47,883 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:47,884 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test21_true-unreach-call_true-termination.c [2018-11-23 11:07:47,892 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08e7972e/f2f4f0969d8a47a99ddec9921db0edb5/FLAGbe5b208b1 [2018-11-23 11:07:48,242 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08e7972e/f2f4f0969d8a47a99ddec9921db0edb5 [2018-11-23 11:07:48,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:48,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:48,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:48,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:48,260 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:48,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9d2216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48, skipping insertion in model container [2018-11-23 11:07:48,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:48,298 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:48,563 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:48,589 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:48,610 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:48,630 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:48,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48 WrapperNode [2018-11-23 11:07:48,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:48,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:48,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:48,631 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:48,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:48,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:48,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:48,661 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:48,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... [2018-11-23 11:07:48,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:48,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:48,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:48,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:48,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-23 11:07:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-23 11:07:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-23 11:07:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 11:07:48,824 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 11:07:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:48,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-23 11:07:48,825 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-23 11:07:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:48,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:49,465 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:49,466 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:07:49,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:49 BoogieIcfgContainer [2018-11-23 11:07:49,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:49,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:49,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:49,470 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:49,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:48" (1/3) ... [2018-11-23 11:07:49,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52671a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:49, skipping insertion in model container [2018-11-23 11:07:49,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:48" (2/3) ... [2018-11-23 11:07:49,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52671a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:49, skipping insertion in model container [2018-11-23 11:07:49,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:49" (3/3) ... [2018-11-23 11:07:49,474 INFO L112 eAbstractionObserver]: Analyzing ICFG test21_true-unreach-call_true-termination.c [2018-11-23 11:07:49,484 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:49,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:49,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:49,544 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:49,545 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:49,545 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:49,545 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:49,547 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:49,547 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:49,547 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:49,547 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:49,548 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 11:07:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:07:49,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:49,574 INFO L402 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] [2018-11-23 11:07:49,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:49,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash -993867110, now seen corresponding path program 1 times [2018-11-23 11:07:49,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:49,587 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:49,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:49,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:50,109 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 11:07:51,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 11:07:51,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32); {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#(= (_ bv0 32) |~#d1~0.offset|)} {33#true} #39#return; {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret11 := main(); {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,208 INFO L256 TraceCheckUtils]: 5: Hoare triple {41#(= (_ bv0 32) |~#d1~0.offset|)} call init(); {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#(= (_ bv0 32) |~#d1~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,213 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {41#(= (_ bv0 32) |~#d1~0.offset|)} {41#(= (_ bv0 32) |~#d1~0.offset|)} #43#return; {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,214 INFO L256 TraceCheckUtils]: 9: Hoare triple {41#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret8.base, #t~ret8.offset := get_dummy(); {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {69#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:51,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {69#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {73#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:51,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {73#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {73#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:51,236 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {73#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {41#(= (_ bv0 32) |~#d1~0.offset|)} #45#return; {80#(and (= |~#d1~0.offset| |main_#t~ret8.offset|) (= |~#d1~0.base| |main_#t~ret8.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:51,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {80#(and (= |~#d1~0.offset| |main_#t~ret8.offset|) (= |~#d1~0.base| |main_#t~ret8.base|) (= (_ bv0 32) |~#d1~0.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {84#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:51,255 INFO L256 TraceCheckUtils]: 15: Hoare triple {84#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {41#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:51,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {69#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:51,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {69#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {73#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:51,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {73#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {73#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:51,306 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {73#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {84#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} #47#return; {100#(and (= main_~pd1~0.base |main_#t~ret9.base|) (= main_~pd1~0.offset |main_#t~ret9.offset|) (= (_ bv0 32) |main_#t~ret9.offset|))} is VALID [2018-11-23 11:07:51,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {100#(and (= main_~pd1~0.base |main_#t~ret9.base|) (= main_~pd1~0.offset |main_#t~ret9.offset|) (= (_ bv0 32) |main_#t~ret9.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {104#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:07:51,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {104#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} assume (~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {104#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:07:51,315 INFO L256 TraceCheckUtils]: 22: Hoare triple {104#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} call #t~ret10 := check(~pd1~0.base, ~pd1~0.offset, ~pd2~0.base, ~pd2~0.offset); {33#true} is VALID [2018-11-23 11:07:51,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {33#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset;call #t~mem6 := read~intINTTYPE4(~s1.base, ~s1.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~s2.base, ~s2.offset, 4bv32);#res := (if #t~mem6 == #t~mem7 then 1bv32 else 0bv32);havoc #t~mem7;havoc #t~mem6; {114#(or (and (= |check_#res| (_ bv0 32)) (not (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|)))) (and (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|))))} is VALID [2018-11-23 11:07:51,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {114#(or (and (= |check_#res| (_ bv0 32)) (not (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|)))) (and (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|))))} assume true; {114#(or (and (= |check_#res| (_ bv0 32)) (not (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|)))) (and (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|))))} is VALID [2018-11-23 11:07:51,321 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {114#(or (and (= |check_#res| (_ bv0 32)) (not (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|)))) (and (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|))))} {104#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} #49#return; {121#(= (bvadd |main_#t~ret10| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:51,322 INFO L273 TraceCheckUtils]: 26: Hoare triple {121#(= (bvadd |main_#t~ret10| (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == #t~ret10;havoc #t~ret10; {34#false} is VALID [2018-11-23 11:07:51,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 11:07:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:07:51,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:51,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:51,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:07:51,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 11:07:51,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:51,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:07:51,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:51,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:07:51,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:07:51,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:07:51,473 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 11 states. [2018-11-23 11:07:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:53,332 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-23 11:07:53,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:07:53,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 11:07:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:07:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2018-11-23 11:07:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:07:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2018-11-23 11:07:53,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2018-11-23 11:07:53,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:53,603 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:07:53,603 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:07:53,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:07:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:07:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:07:53,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:53,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:07:53,733 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:07:53,733 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:07:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:53,739 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:07:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:07:53,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:53,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:53,740 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:07:53,740 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:07:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:53,745 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:07:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:07:53,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:53,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:53,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:53,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:07:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 11:07:53,752 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 28 [2018-11-23 11:07:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:53,752 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 11:07:53,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:07:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:07:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:07:53,754 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:53,755 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:53,755 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:53,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1306955480, now seen corresponding path program 1 times [2018-11-23 11:07:53,756 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:53,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:53,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:53,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-23 11:07:53,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 11:07:53,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:53,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:53,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:53,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 11:07:54,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:07:54,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32); {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} {297#true} #39#return; {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret11 := main(); {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,378 INFO L256 TraceCheckUtils]: 5: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} call init(); {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,380 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} {305#(not (= |~#d1~0.base| |~#d2~0.base|))} #43#return; {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,380 INFO L256 TraceCheckUtils]: 9: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {333#(and (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} is VALID [2018-11-23 11:07:54,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {333#(and (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {337#(and (= |get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} is VALID [2018-11-23 11:07:54,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#(and (= |get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} assume true; {337#(and (= |get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} is VALID [2018-11-23 11:07:54,385 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {337#(and (= |get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} {305#(not (= |~#d1~0.base| |~#d2~0.base|))} #45#return; {344#(not (= |~#d1~0.base| |main_#t~ret8.base|))} is VALID [2018-11-23 11:07:54,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {344#(not (= |~#d1~0.base| |main_#t~ret8.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {348#(not (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-23 11:07:54,386 INFO L256 TraceCheckUtils]: 15: Hoare triple {348#(not (= |~#d1~0.base| main_~pd1~0.base))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {297#true} is VALID [2018-11-23 11:07:54,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {297#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {355#(= |~#d1~0.base| |get_dummy_#t~ite5.base|)} is VALID [2018-11-23 11:07:54,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {355#(= |~#d1~0.base| |get_dummy_#t~ite5.base|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {359#(= |get_dummy_#res.base| |~#d1~0.base|)} is VALID [2018-11-23 11:07:54,390 INFO L273 TraceCheckUtils]: 18: Hoare triple {359#(= |get_dummy_#res.base| |~#d1~0.base|)} assume true; {359#(= |get_dummy_#res.base| |~#d1~0.base|)} is VALID [2018-11-23 11:07:54,392 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {359#(= |get_dummy_#res.base| |~#d1~0.base|)} {348#(not (= |~#d1~0.base| main_~pd1~0.base))} #47#return; {366#(not (= main_~pd1~0.base |main_#t~ret9.base|))} is VALID [2018-11-23 11:07:54,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {366#(not (= main_~pd1~0.base |main_#t~ret9.base|))} ~pd2~0.base, ~pd2~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {370#(not (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2018-11-23 11:07:54,393 INFO L273 TraceCheckUtils]: 21: Hoare triple {370#(not (= main_~pd2~0.base main_~pd1~0.base))} assume (~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {298#false} is VALID [2018-11-23 11:07:54,393 INFO L256 TraceCheckUtils]: 22: Hoare triple {298#false} call #t~ret10 := check(~pd1~0.base, ~pd1~0.offset, ~pd2~0.base, ~pd2~0.offset); {298#false} is VALID [2018-11-23 11:07:54,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {298#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset;call #t~mem6 := read~intINTTYPE4(~s1.base, ~s1.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~s2.base, ~s2.offset, 4bv32);#res := (if #t~mem6 == #t~mem7 then 1bv32 else 0bv32);havoc #t~mem7;havoc #t~mem6; {298#false} is VALID [2018-11-23 11:07:54,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-23 11:07:54,394 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {298#false} {298#false} #49#return; {298#false} is VALID [2018-11-23 11:07:54,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {298#false} assume 0bv32 == #t~ret10;havoc #t~ret10; {298#false} is VALID [2018-11-23 11:07:54,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:07:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:54,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:54,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:07:54,711 INFO L273 TraceCheckUtils]: 26: Hoare triple {298#false} assume 0bv32 == #t~ret10;havoc #t~ret10; {298#false} is VALID [2018-11-23 11:07:54,711 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {297#true} {298#false} #49#return; {298#false} is VALID [2018-11-23 11:07:54,711 INFO L273 TraceCheckUtils]: 24: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:07:54,711 INFO L273 TraceCheckUtils]: 23: Hoare triple {297#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset;call #t~mem6 := read~intINTTYPE4(~s1.base, ~s1.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~s2.base, ~s2.offset, 4bv32);#res := (if #t~mem6 == #t~mem7 then 1bv32 else 0bv32);havoc #t~mem7;havoc #t~mem6; {297#true} is VALID [2018-11-23 11:07:54,712 INFO L256 TraceCheckUtils]: 22: Hoare triple {298#false} call #t~ret10 := check(~pd1~0.base, ~pd1~0.offset, ~pd2~0.base, ~pd2~0.offset); {297#true} is VALID [2018-11-23 11:07:54,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {370#(not (= main_~pd2~0.base main_~pd1~0.base))} assume (~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {298#false} is VALID [2018-11-23 11:07:54,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {366#(not (= main_~pd1~0.base |main_#t~ret9.base|))} ~pd2~0.base, ~pd2~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {370#(not (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2018-11-23 11:07:54,716 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {359#(= |get_dummy_#res.base| |~#d1~0.base|)} {348#(not (= |~#d1~0.base| main_~pd1~0.base))} #47#return; {366#(not (= main_~pd1~0.base |main_#t~ret9.base|))} is VALID [2018-11-23 11:07:54,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {359#(= |get_dummy_#res.base| |~#d1~0.base|)} assume true; {359#(= |get_dummy_#res.base| |~#d1~0.base|)} is VALID [2018-11-23 11:07:54,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {355#(= |~#d1~0.base| |get_dummy_#t~ite5.base|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {359#(= |get_dummy_#res.base| |~#d1~0.base|)} is VALID [2018-11-23 11:07:54,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {297#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {355#(= |~#d1~0.base| |get_dummy_#t~ite5.base|)} is VALID [2018-11-23 11:07:54,718 INFO L256 TraceCheckUtils]: 15: Hoare triple {348#(not (= |~#d1~0.base| main_~pd1~0.base))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {297#true} is VALID [2018-11-23 11:07:54,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {344#(not (= |~#d1~0.base| |main_#t~ret8.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {348#(not (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-23 11:07:54,722 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {437#(or (not (= |get_dummy_#res.base| |~#d1~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} {305#(not (= |~#d1~0.base| |~#d2~0.base|))} #45#return; {344#(not (= |~#d1~0.base| |main_#t~ret8.base|))} is VALID [2018-11-23 11:07:54,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {437#(or (not (= |get_dummy_#res.base| |~#d1~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} assume true; {437#(or (not (= |get_dummy_#res.base| |~#d1~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {444#(or (not (= |~#d1~0.base| |get_dummy_#t~ite5.base|)) (= |~#d1~0.base| |~#d2~0.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {437#(or (not (= |get_dummy_#res.base| |~#d1~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {297#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {444#(or (not (= |~#d1~0.base| |get_dummy_#t~ite5.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,725 INFO L256 TraceCheckUtils]: 9: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {297#true} is VALID [2018-11-23 11:07:54,729 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {297#true} {305#(not (= |~#d1~0.base| |~#d2~0.base|))} #43#return; {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:07:54,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {297#true} is VALID [2018-11-23 11:07:54,730 INFO L256 TraceCheckUtils]: 5: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} call init(); {297#true} is VALID [2018-11-23 11:07:54,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret11 := main(); {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} {297#true} #39#return; {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {305#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32); {305#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:54,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:07:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:07:54,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:54,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-23 11:07:54,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 11:07:54,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:54,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:07:54,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:54,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:07:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:07:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:07:54,856 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2018-11-23 11:07:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:56,306 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 11:07:56,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:07:56,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 11:07:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:07:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-23 11:07:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:07:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-23 11:07:56,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2018-11-23 11:07:56,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:56,380 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:07:56,380 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:07:56,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:07:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:07:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:07:56,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:56,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:07:56,445 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:07:56,445 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:07:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:56,447 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 11:07:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 11:07:56,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:56,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:56,448 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:07:56,448 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:07:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:56,451 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 11:07:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 11:07:56,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:56,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:56,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:56,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:07:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 11:07:56,455 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 28 [2018-11-23 11:07:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:56,456 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 11:07:56,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:07:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 11:07:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:07:56,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:56,458 INFO L402 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] [2018-11-23 11:07:56,458 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:56,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1565120918, now seen corresponding path program 1 times [2018-11-23 11:07:56,459 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:56,459 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:56,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:56,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:56,846 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:07:56,884 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 34 [2018-11-23 11:07:56,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-11-23 11:07:56,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:56,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-11-23 11:07:56,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:56,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:56,994 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-23 11:07:57,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-11-23 11:07:57,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:57,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-11-23 11:07:57,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,065 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-11-23 11:07:57,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 36 treesize of output 35 [2018-11-23 11:07:57,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:57,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 39 [2018-11-23 11:07:57,190 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,221 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 29 [2018-11-23 11:07:57,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:57,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2018-11-23 11:07:57,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:57,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:57,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 59 [2018-11-23 11:07:57,768 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-11-23 11:07:58,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:58,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:58,242 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:07:58,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-11-23 11:07:58,271 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:58,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:58,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:58,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:58,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 47 [2018-11-23 11:07:58,561 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:58,669 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:07:58,774 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:07:58,891 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:07:59,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:07:59,034 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:46, output treesize:42 [2018-11-23 11:07:59,072 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:59,073 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, |v_init_#t~nondet0_6|, |v_init_#t~nondet1_6|, |v_init_#t~nondet2_6|, |v_init_#t~nondet3_6|]. (and (= (let ((.cse0 (store |v_#memory_int_16| |~#d1~0.base| (store (store (select |v_#memory_int_16| |~#d1~0.base|) |~#d1~0.offset| |v_init_#t~nondet0_6|) (bvadd |~#d1~0.offset| (_ bv4 32)) |v_init_#t~nondet1_6|)))) (store .cse0 |~#d2~0.base| (store (store (select .cse0 |~#d2~0.base|) |~#d2~0.offset| |v_init_#t~nondet2_6|) (bvadd |~#d2~0.offset| (_ bv4 32)) |v_init_#t~nondet3_6|))) |#memory_int|) (= (_ bv0 32) |~#d2~0.offset|)) [2018-11-23 11:07:59,073 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (= (_ bv0 32) |~#d2~0.offset|)) (.cse2 (bvadd |~#d2~0.offset| (_ bv4 32))) (.cse3 (bvadd |~#d1~0.offset| (_ bv4 32))) (.cse1 (= |~#d1~0.base| |~#d2~0.base|))) (or (and .cse0 .cse1 (= .cse2 |~#d1~0.offset|)) (and .cse0 (= .cse3 |~#d2~0.offset|) .cse1) .cse0 (and .cse0 (= .cse2 .cse3) .cse1))) [2018-11-23 11:07:59,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {626#true} call ULTIMATE.init(); {626#true} is VALID [2018-11-23 11:07:59,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {626#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32); {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {634#(= (_ bv0 32) |~#d2~0.offset|)} assume true; {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {634#(= (_ bv0 32) |~#d2~0.offset|)} {626#true} #39#return; {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {634#(= (_ bv0 32) |~#d2~0.offset|)} call #t~ret11 := main(); {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,524 INFO L256 TraceCheckUtils]: 5: Hoare triple {634#(= (_ bv0 32) |~#d2~0.offset|)} call init(); {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {634#(= (_ bv0 32) |~#d2~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {634#(= (_ bv0 32) |~#d2~0.offset|)} assume true; {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,526 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {634#(= (_ bv0 32) |~#d2~0.offset|)} {634#(= (_ bv0 32) |~#d2~0.offset|)} #43#return; {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,527 INFO L256 TraceCheckUtils]: 9: Hoare triple {634#(= (_ bv0 32) |~#d2~0.offset|)} call #t~ret8.base, #t~ret8.offset := get_dummy(); {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {634#(= (_ bv0 32) |~#d2~0.offset|)} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {662#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} is VALID [2018-11-23 11:07:59,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {662#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {666#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:07:59,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {666#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {666#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:07:59,531 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {666#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {634#(= (_ bv0 32) |~#d2~0.offset|)} #45#return; {673#(and (= |main_#t~ret8.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |main_#t~ret8.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:07:59,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {673#(and (= |main_#t~ret8.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |main_#t~ret8.offset| |~#d2~0.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {677#(and (= (_ bv0 32) |~#d2~0.offset|) (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} is VALID [2018-11-23 11:07:59,533 INFO L256 TraceCheckUtils]: 15: Hoare triple {677#(and (= (_ bv0 32) |~#d2~0.offset|) (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {634#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:07:59,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {634#(= (_ bv0 32) |~#d2~0.offset|)} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {662#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} is VALID [2018-11-23 11:07:59,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {662#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~ite5.base, #t~ite5.offset;havoc #t~nondet4; {666#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:07:59,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {666#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {666#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:07:59,542 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {666#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {677#(and (= (_ bv0 32) |~#d2~0.offset|) (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} #47#return; {693#(and (= main_~pd1~0.base |main_#t~ret9.base|) (= main_~pd1~0.offset |main_#t~ret9.offset|) (= (_ bv0 32) |main_#t~ret9.offset|))} is VALID [2018-11-23 11:07:59,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {693#(and (= main_~pd1~0.base |main_#t~ret9.base|) (= main_~pd1~0.offset |main_#t~ret9.offset|) (= (_ bv0 32) |main_#t~ret9.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {697#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:07:59,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {697#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} assume (~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {697#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:07:59,543 INFO L256 TraceCheckUtils]: 22: Hoare triple {697#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} call #t~ret10 := check(~pd1~0.base, ~pd1~0.offset, ~pd2~0.base, ~pd2~0.offset); {626#true} is VALID [2018-11-23 11:07:59,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {626#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset;call #t~mem6 := read~intINTTYPE4(~s1.base, ~s1.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~s2.base, ~s2.offset, 4bv32);#res := (if #t~mem6 == #t~mem7 then 1bv32 else 0bv32);havoc #t~mem7;havoc #t~mem6; {707#(or (and (= |check_#res| (_ bv0 32)) (not (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|)))) (and (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|))))} is VALID [2018-11-23 11:07:59,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {707#(or (and (= |check_#res| (_ bv0 32)) (not (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|)))) (and (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|))))} assume true; {707#(or (and (= |check_#res| (_ bv0 32)) (not (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|)))) (and (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|))))} is VALID [2018-11-23 11:07:59,547 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {707#(or (and (= |check_#res| (_ bv0 32)) (not (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|)))) (and (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |check_#in~s2.base|) |check_#in~s2.offset|) (select (select |#memory_int| |check_#in~s1.base|) |check_#in~s1.offset|))))} {697#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} #49#return; {714#(= (bvadd |main_#t~ret10| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:59,547 INFO L273 TraceCheckUtils]: 26: Hoare triple {714#(= (bvadd |main_#t~ret10| (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == #t~ret10;havoc #t~ret10; {627#false} is VALID [2018-11-23 11:07:59,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {627#false} assume !false; {627#false} is VALID [2018-11-23 11:07:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:07:59,552 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:59,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:59,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:07:59,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 11:07:59,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:59,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:07:59,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:59,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:07:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:07:59,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:07:59,641 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 11 states. [2018-11-23 11:08:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,797 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 11:08:00,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:08:00,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 11:08:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:08:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 11:08:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:08:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 11:08:00,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2018-11-23 11:08:00,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:00,841 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:08:00,841 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:08:00,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:08:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:08:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:08:00,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:00,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:00,843 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:00,843 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,844 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:08:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:00,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:00,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:00,845 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:00,845 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,845 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:08:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:00,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:00,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:00,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:00,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:08:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:08:00,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-23 11:08:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:00,848 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:08:00,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:08:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:00,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:00,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:08:01,343 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 11 18) no Hoare annotation was computed. [2018-11-23 11:08:01,344 INFO L451 ceAbstractionStarter]: At program point initENTRY(lines 11 18) the Hoare annotation is: true [2018-11-23 11:08:01,344 INFO L448 ceAbstractionStarter]: For program point initFINAL(lines 11 18) no Hoare annotation was computed. [2018-11-23 11:08:01,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:08:01,344 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:08:01,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:08:01,345 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 20 23) no Hoare annotation was computed. [2018-11-23 11:08:01,345 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 20 23) the Hoare annotation is: true [2018-11-23 11:08:01,345 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-23 11:08:01,345 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 20 23) no Hoare annotation was computed. [2018-11-23 11:08:01,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:08:01,345 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv0 32) |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= (_ bv0 32) |~#d1~0.offset|)) [2018-11-23 11:08:01,345 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:08:01,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:08:01,346 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-23 11:08:01,346 INFO L451 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: true [2018-11-23 11:08:01,346 INFO L444 ceAbstractionStarter]: At program point L33-1(line 33) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|)) (not (= |~#d2~0.offset| (_ bv0 32))) (and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|)) (not (= (_ bv0 32) |~#d1~0.offset|))) [2018-11-23 11:08:01,346 INFO L448 ceAbstractionStarter]: For program point L34-2(lines 34 38) no Hoare annotation was computed. [2018-11-23 11:08:01,346 INFO L448 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-11-23 11:08:01,346 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 30 44) the Hoare annotation is: true [2018-11-23 11:08:01,346 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 30 44) no Hoare annotation was computed. [2018-11-23 11:08:01,346 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 30 44) no Hoare annotation was computed. [2018-11-23 11:08:01,346 INFO L444 ceAbstractionStarter]: At program point L36(lines 31 44) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| (_ bv0 32))) (not (= (_ bv0 32) |~#d1~0.offset|))) [2018-11-23 11:08:01,347 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= main_~pd2~0.base main_~pd1~0.base)) (.cse1 (= main_~pd1~0.offset main_~pd2~0.offset))) (or (and .cse0 (= |~#d1~0.base| main_~pd1~0.base) .cse1 (= main_~pd1~0.offset |~#d1~0.offset|)) (= |~#d1~0.base| |~#d2~0.base|) (not (= |~#d2~0.offset| (_ bv0 32))) (and .cse0 .cse1 (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|)) (not (= (_ bv0 32) |~#d1~0.offset|)))) [2018-11-23 11:08:01,347 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-11-23 11:08:01,347 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 38) no Hoare annotation was computed. [2018-11-23 11:08:01,347 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 35 37) no Hoare annotation was computed. [2018-11-23 11:08:01,347 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 25 28) the Hoare annotation is: true [2018-11-23 11:08:01,347 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 25 28) no Hoare annotation was computed. [2018-11-23 11:08:01,347 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 25 28) no Hoare annotation was computed. [2018-11-23 11:08:01,349 WARN L170 areAnnotationChecker]: initFINAL has no Hoare annotation [2018-11-23 11:08:01,349 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:08:01,349 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-23 11:08:01,349 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-23 11:08:01,349 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: initFINAL has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 11:08:01,350 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 11:08:01,351 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:08:01,352 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 11:08:01,352 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:08:01,352 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:08:01,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:08:01 BoogieIcfgContainer [2018-11-23 11:08:01,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:08:01,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:08:01,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:08:01,363 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:08:01,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:49" (3/4) ... [2018-11-23 11:08:01,368 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:08:01,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-23 11:08:01,374 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:08:01,375 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-11-23 11:08:01,375 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:08:01,375 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-23 11:08:01,380 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 11:08:01,380 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 11:08:01,380 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:08:01,381 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:08:01,436 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test21_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 11:08:01,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:08:01,438 INFO L168 Benchmark]: Toolchain (without parser) took 13183.81 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -742.4 MB). Peak memory consumption was 114.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:01,439 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:01,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:01,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:01,441 INFO L168 Benchmark]: Boogie Preprocessor took 35.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:01,441 INFO L168 Benchmark]: RCFGBuilder took 769.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:01,442 INFO L168 Benchmark]: TraceAbstraction took 11895.40 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 9.8 MB). Peak memory consumption was 135.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:01,442 INFO L168 Benchmark]: Witness Printer took 73.76 ms. Allocated memory is still 2.4 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:01,445 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 374.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 29.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 769.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11895.40 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.8 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 9.8 MB). Peak memory consumption was 135.7 MB. Max. memory is 7.1 GB. * Witness Printer took 73.76 ms. Allocated memory is still 2.4 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (d1 == d2 || !(d2 == 0bv32)) || !(0bv32 == d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. SAFE Result, 11.8s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 54 SDslu, 311 SDs, 0 SdLazy, 399 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 15 PreInvPairs, 18 NumberOfFragments, 94 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 162 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 16362 SizeOfPredicates, 24 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 9/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...