java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:18:03,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:18:03,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:18:03,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:18:03,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:18:03,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:18:03,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:18:03,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:18:03,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:18:03,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:18:03,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:18:03,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:18:03,799 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:18:03,800 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:18:03,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:18:03,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:18:03,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:18:03,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:18:03,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:18:03,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:18:03,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:18:03,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:18:03,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:18:03,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:18:03,821 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:18:03,822 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:18:03,823 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:18:03,824 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:18:03,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:18:03,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:18:03,826 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:18:03,827 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:18:03,827 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:18:03,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:18:03,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:18:03,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:18:03,833 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:18:03,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:18:03,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:18:03,849 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:18:03,849 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:18:03,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:18:03,850 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:18:03,850 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:18:03,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:18:03,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:18:03,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:18:03,851 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:18:03,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:18:03,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:18:03,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:18:03,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:18:03,852 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:18:03,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:18:03,852 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:18:03,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:18:03,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:18:03,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:18:03,853 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:18:03,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:18:03,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:18:03,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:18:03,854 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:18:03,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:18:03,854 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:18:03,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:18:03,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:18:03,855 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:18:03,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:18:03,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:18:03,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:18:03,918 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:18:03,919 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:18:03,919 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-11-14 19:18:03,977 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b800e47b/6e55921b00aa4635a2d40f7b7adc5464/FLAG3f34e039e [2018-11-14 19:18:04,454 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:18:04,455 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-11-14 19:18:04,461 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b800e47b/6e55921b00aa4635a2d40f7b7adc5464/FLAG3f34e039e [2018-11-14 19:18:04,476 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b800e47b/6e55921b00aa4635a2d40f7b7adc5464 [2018-11-14 19:18:04,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:18:04,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:18:04,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:18:04,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:18:04,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:18:04,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b8652e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04, skipping insertion in model container [2018-11-14 19:18:04,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:18:04,538 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:18:04,764 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:18:04,770 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:18:04,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:18:04,821 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:18:04,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04 WrapperNode [2018-11-14 19:18:04,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:18:04,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:18:04,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:18:04,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:18:04,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (1/1) ... [2018-11-14 19:18:04,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:18:04,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:18:04,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:18:04,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:18:04,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:18:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:18:04,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:18:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:18:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:18:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:18:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:18:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-14 19:18:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:18:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:18:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:18:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:18:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:18:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:18:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:18:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:18:05,640 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:18:05,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:18:05 BoogieIcfgContainer [2018-11-14 19:18:05,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:18:05,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:18:05,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:18:05,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:18:05,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:18:04" (1/3) ... [2018-11-14 19:18:05,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782286ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:18:05, skipping insertion in model container [2018-11-14 19:18:05,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:04" (2/3) ... [2018-11-14 19:18:05,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782286ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:18:05, skipping insertion in model container [2018-11-14 19:18:05,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:18:05" (3/3) ... [2018-11-14 19:18:05,651 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-11-14 19:18:05,662 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:18:05,673 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:18:05,690 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:18:05,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:18:05,728 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:18:05,728 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:18:05,728 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:18:05,728 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:18:05,729 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:18:05,729 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:18:05,729 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:18:05,729 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:18:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-14 19:18:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:18:05,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:05,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:05,758 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:05,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:05,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-11-14 19:18:05,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:05,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:05,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:05,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:05,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:05,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-14 19:18:05,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-14 19:18:05,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-14 19:18:05,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #66#return; {33#true} is VALID [2018-11-14 19:18:05,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret9 := main(); {33#true} is VALID [2018-11-14 19:18:05,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {33#true} is VALID [2018-11-14 19:18:05,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-14 19:18:05,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {34#false} is VALID [2018-11-14 19:18:05,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !true; {34#false} is VALID [2018-11-14 19:18:05,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {34#false} is VALID [2018-11-14 19:18:05,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-14 19:18:05,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {34#false} is VALID [2018-11-14 19:18:05,960 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {34#false} is VALID [2018-11-14 19:18:05,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-14 19:18:05,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume ~cond == 0; {34#false} is VALID [2018-11-14 19:18:05,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-14 19:18:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:05,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:05,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:18:05,973 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 19:18:05,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:05,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:18:06,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:06,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:18:06,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:18:06,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:18:06,157 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-14 19:18:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:06,446 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-14 19:18:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:18:06,446 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 19:18:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:18:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-14 19:18:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:18:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-14 19:18:06,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-14 19:18:06,703 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-14 19:18:06,715 INFO L225 Difference]: With dead ends: 51 [2018-11-14 19:18:06,716 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 19:18:06,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:18:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 19:18:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 19:18:06,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:06,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 19:18:06,762 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 19:18:06,762 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 19:18:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:06,767 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 19:18:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 19:18:06,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:06,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:06,768 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 19:18:06,768 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 19:18:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:06,773 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 19:18:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 19:18:06,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:06,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:06,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:06,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:18:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-14 19:18:06,780 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-14 19:18:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:06,780 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-14 19:18:06,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:18:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 19:18:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:18:06,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:06,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:06,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:06,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-11-14 19:18:06,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:06,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:06,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:06,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:07,390 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2018-11-14 19:18:07,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {185#true} is VALID [2018-11-14 19:18:07,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {185#true} is VALID [2018-11-14 19:18:07,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2018-11-14 19:18:07,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #66#return; {185#true} is VALID [2018-11-14 19:18:07,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret9 := main(); {185#true} is VALID [2018-11-14 19:18:07,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {185#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {187#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} is VALID [2018-11-14 19:18:07,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {187#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} assume true; {187#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} is VALID [2018-11-14 19:18:07,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {187#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {187#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} is VALID [2018-11-14 19:18:07,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {187#(and (< 0 (div (+ main_~max~0 4294967295) 4294967296)) (<= main_~max~0 5))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {188#(= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))} is VALID [2018-11-14 19:18:07,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {188#(= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))} assume true; {188#(= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))} is VALID [2018-11-14 19:18:07,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {188#(= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))} assume !(~i~0 >= 0); {186#false} is VALID [2018-11-14 19:18:07,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {186#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {186#false} is VALID [2018-11-14 19:18:07,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {186#false} assume true; {186#false} is VALID [2018-11-14 19:18:07,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {186#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {186#false} is VALID [2018-11-14 19:18:07,436 INFO L256 TraceCheckUtils]: 14: Hoare triple {186#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {186#false} is VALID [2018-11-14 19:18:07,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {186#false} ~cond := #in~cond; {186#false} is VALID [2018-11-14 19:18:07,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {186#false} assume ~cond == 0; {186#false} is VALID [2018-11-14 19:18:07,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {186#false} assume !false; {186#false} is VALID [2018-11-14 19:18:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:07,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:07,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:18:07,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 19:18:07,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:07,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:18:07,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:07,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:18:07,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:18:07,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:18:07,522 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2018-11-14 19:18:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:08,060 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-14 19:18:08,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:18:08,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 19:18:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:18:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-14 19:18:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:18:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2018-11-14 19:18:08,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2018-11-14 19:18:08,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:08,180 INFO L225 Difference]: With dead ends: 40 [2018-11-14 19:18:08,180 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 19:18:08,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:18:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 19:18:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-14 19:18:08,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:08,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-14 19:18:08,204 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-14 19:18:08,204 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-14 19:18:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:08,207 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 19:18:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 19:18:08,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:08,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:08,208 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-14 19:18:08,208 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-14 19:18:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:08,211 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 19:18:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 19:18:08,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:08,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:08,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:08,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 19:18:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 19:18:08,215 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-14 19:18:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:08,215 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 19:18:08,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:18:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 19:18:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:18:08,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:08,217 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:08,217 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:08,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:08,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-11-14 19:18:08,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:08,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:08,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:08,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {339#true} is VALID [2018-11-14 19:18:08,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {339#true} is VALID [2018-11-14 19:18:08,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2018-11-14 19:18:08,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #66#return; {339#true} is VALID [2018-11-14 19:18:08,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret9 := main(); {339#true} is VALID [2018-11-14 19:18:08,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {341#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:08,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {341#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume true; {341#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:08,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {341#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {341#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:08,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {341#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {342#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:08,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {342#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume true; {342#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:08,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {342#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {343#(and (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:08,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {343#(and (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {344#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:08,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {344#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume true; {344#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:08,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {344#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume !(~i~0 >= 0); {340#false} is VALID [2018-11-14 19:18:08,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {340#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {340#false} is VALID [2018-11-14 19:18:08,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {340#false} assume true; {340#false} is VALID [2018-11-14 19:18:08,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {340#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {340#false} is VALID [2018-11-14 19:18:08,968 INFO L256 TraceCheckUtils]: 17: Hoare triple {340#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {340#false} is VALID [2018-11-14 19:18:08,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {340#false} ~cond := #in~cond; {340#false} is VALID [2018-11-14 19:18:08,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {340#false} assume ~cond == 0; {340#false} is VALID [2018-11-14 19:18:08,969 INFO L273 TraceCheckUtils]: 20: Hoare triple {340#false} assume !false; {340#false} is VALID [2018-11-14 19:18:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:08,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:08,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:08,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:09,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:09,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {339#true} is VALID [2018-11-14 19:18:09,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {339#true} is VALID [2018-11-14 19:18:09,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2018-11-14 19:18:09,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #66#return; {339#true} is VALID [2018-11-14 19:18:09,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret9 := main(); {339#true} is VALID [2018-11-14 19:18:09,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {363#(= main_~i~0 0)} is VALID [2018-11-14 19:18:09,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {363#(= main_~i~0 0)} assume true; {363#(= main_~i~0 0)} is VALID [2018-11-14 19:18:09,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {363#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {370#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-14 19:18:09,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(<= (mod main_~max~0 4294967296) 0)} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {370#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-14 19:18:09,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {370#(<= (mod main_~max~0 4294967296) 0)} assume true; {370#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-14 19:18:09,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {370#(<= (mod main_~max~0 4294967296) 0)} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {370#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-14 19:18:09,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {370#(<= (mod main_~max~0 4294967296) 0)} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {370#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-14 19:18:09,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {370#(<= (mod main_~max~0 4294967296) 0)} assume true; {370#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-14 19:18:09,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {370#(<= (mod main_~max~0 4294967296) 0)} assume !(~i~0 >= 0); {370#(<= (mod main_~max~0 4294967296) 0)} is VALID [2018-11-14 19:18:09,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {370#(<= (mod main_~max~0 4294967296) 0)} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {392#(and (<= (mod main_~max~0 4294967296) 0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:09,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#(and (<= (mod main_~max~0 4294967296) 0) (= main_~i~0 0))} assume true; {392#(and (<= (mod main_~max~0 4294967296) 0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:09,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#(and (<= (mod main_~max~0 4294967296) 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {340#false} is VALID [2018-11-14 19:18:09,241 INFO L256 TraceCheckUtils]: 17: Hoare triple {340#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {340#false} is VALID [2018-11-14 19:18:09,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {340#false} ~cond := #in~cond; {340#false} is VALID [2018-11-14 19:18:09,242 INFO L273 TraceCheckUtils]: 19: Hoare triple {340#false} assume ~cond == 0; {340#false} is VALID [2018-11-14 19:18:09,242 INFO L273 TraceCheckUtils]: 20: Hoare triple {340#false} assume !false; {340#false} is VALID [2018-11-14 19:18:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:09,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:18:09,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-14 19:18:09,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 19:18:09,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:09,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:18:09,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:09,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:18:09,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:18:09,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:18:09,404 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2018-11-14 19:18:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:10,547 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-14 19:18:10,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 19:18:10,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 19:18:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:18:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2018-11-14 19:18:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:18:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2018-11-14 19:18:10,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 71 transitions. [2018-11-14 19:18:10,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:10,688 INFO L225 Difference]: With dead ends: 64 [2018-11-14 19:18:10,688 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 19:18:10,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:18:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 19:18:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-14 19:18:10,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:10,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2018-11-14 19:18:10,949 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2018-11-14 19:18:10,949 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2018-11-14 19:18:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:10,953 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-14 19:18:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-14 19:18:10,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:10,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:10,954 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2018-11-14 19:18:10,955 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2018-11-14 19:18:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:10,958 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-14 19:18:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-14 19:18:10,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:10,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:10,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:10,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 19:18:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-14 19:18:10,962 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2018-11-14 19:18:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:10,962 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-14 19:18:10,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:18:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-14 19:18:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 19:18:10,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:10,964 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:10,964 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:10,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1179396881, now seen corresponding path program 1 times [2018-11-14 19:18:10,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:10,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:10,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:10,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:10,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:11,437 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 5 [2018-11-14 19:18:11,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {633#true} call ULTIMATE.init(); {633#true} is VALID [2018-11-14 19:18:11,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {633#true} is VALID [2018-11-14 19:18:11,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {633#true} assume true; {633#true} is VALID [2018-11-14 19:18:11,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {633#true} {633#true} #66#return; {633#true} is VALID [2018-11-14 19:18:11,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {633#true} call #t~ret9 := main(); {633#true} is VALID [2018-11-14 19:18:11,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {633#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} assume true; {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} assume true; {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {635#(and (<= main_~max~0 5) (<= 5 main_~max~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {636#(and (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {636#(and (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume true; {636#(and (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {636#(and (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {636#(and (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:11,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {636#(and (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {637#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:11,615 INFO L273 TraceCheckUtils]: 15: Hoare triple {637#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume true; {637#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:11,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {637#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {637#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:11,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {637#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {638#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:11,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {638#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume true; {638#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:11,620 INFO L273 TraceCheckUtils]: 19: Hoare triple {638#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume !(~i~0 >= 0); {634#false} is VALID [2018-11-14 19:18:11,621 INFO L273 TraceCheckUtils]: 20: Hoare triple {634#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {634#false} is VALID [2018-11-14 19:18:11,621 INFO L273 TraceCheckUtils]: 21: Hoare triple {634#false} assume true; {634#false} is VALID [2018-11-14 19:18:11,621 INFO L273 TraceCheckUtils]: 22: Hoare triple {634#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {634#false} is VALID [2018-11-14 19:18:11,622 INFO L256 TraceCheckUtils]: 23: Hoare triple {634#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {634#false} is VALID [2018-11-14 19:18:11,622 INFO L273 TraceCheckUtils]: 24: Hoare triple {634#false} ~cond := #in~cond; {634#false} is VALID [2018-11-14 19:18:11,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {634#false} assume ~cond == 0; {634#false} is VALID [2018-11-14 19:18:11,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {634#false} assume !false; {634#false} is VALID [2018-11-14 19:18:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:11,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:11,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:11,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:11,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:11,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-14 19:18:11,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:11,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:11,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-14 19:18:12,089 INFO L477 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 46 treesize of output 43 [2018-11-14 19:18:12,095 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-14 19:18:12,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:12,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:12,118 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-14 19:18:12,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:12,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:12,136 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-14 19:18:12,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 40 treesize of output 36 [2018-11-14 19:18:12,811 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 19:18:12,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-14 19:18:12,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:12,828 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 19:18:12,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 19:18:12,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:12,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:12,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:12,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-14 19:18:12,856 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:18:12,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {633#true} call ULTIMATE.init(); {633#true} is VALID [2018-11-14 19:18:12,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {633#true} is VALID [2018-11-14 19:18:12,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {633#true} assume true; {633#true} is VALID [2018-11-14 19:18:12,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {633#true} {633#true} #66#return; {633#true} is VALID [2018-11-14 19:18:12,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {633#true} call #t~ret9 := main(); {633#true} is VALID [2018-11-14 19:18:12,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {633#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:12,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:12,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:12,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:12,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:12,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:12,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {657#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {676#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:12,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {676#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume true; {676#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:12,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {676#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {683#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} is VALID [2018-11-14 19:18:12,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {687#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-14 19:18:12,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {687#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume true; {687#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-14 19:18:12,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {687#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {694#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:12,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {694#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {698#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:12,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {698#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} assume true; {698#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:12,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {698#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {705#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 1) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:12,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {705#(and (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 1) (<= 1 (mod (+ main_~max~0 4294967295) 4294967296)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {709#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0) (exists ((v_prenex_1 Int)) (and (<= (mod (+ v_prenex_1 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= 1 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= (mod (+ v_prenex_1 4294967295) 4294967296) 1) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_1 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))))} is VALID [2018-11-14 19:18:12,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {709#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0) (exists ((v_prenex_1 Int)) (and (<= (mod (+ v_prenex_1 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= 1 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= (mod (+ v_prenex_1 4294967295) 4294967296) 1) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_1 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))))} assume true; {709#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0) (exists ((v_prenex_1 Int)) (and (<= (mod (+ v_prenex_1 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= 1 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= (mod (+ v_prenex_1 4294967295) 4294967296) 1) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_1 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))))} is VALID [2018-11-14 19:18:12,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {709#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0) (exists ((v_prenex_1 Int)) (and (<= (mod (+ v_prenex_1 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= 1 (mod (+ v_prenex_1 4294967295) 4294967296)) (<= (mod (+ v_prenex_1 4294967295) 4294967296) 1) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_1 4294967295) 4294967296) (- 1))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 1))))))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {716#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-14 19:18:12,974 INFO L256 TraceCheckUtils]: 23: Hoare triple {716#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {720#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:18:12,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {720#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {724#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:18:12,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {724#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {634#false} is VALID [2018-11-14 19:18:12,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {634#false} assume !false; {634#false} is VALID [2018-11-14 19:18:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:13,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:13,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2018-11-14 19:18:13,005 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-11-14 19:18:13,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:13,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 19:18:13,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:13,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 19:18:13,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 19:18:13,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:18:13,081 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 17 states. [2018-11-14 19:18:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:15,124 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-11-14 19:18:15,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:18:15,124 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-11-14 19:18:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:18:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2018-11-14 19:18:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:18:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2018-11-14 19:18:15,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2018-11-14 19:18:15,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:15,232 INFO L225 Difference]: With dead ends: 48 [2018-11-14 19:18:15,232 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 19:18:15,233 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-11-14 19:18:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 19:18:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 19:18:15,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:15,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 19:18:15,282 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 19:18:15,282 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 19:18:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:15,285 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 19:18:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 19:18:15,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:15,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:15,287 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 19:18:15,287 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 19:18:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:15,289 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 19:18:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 19:18:15,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:15,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:15,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:15,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 19:18:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-14 19:18:15,292 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 27 [2018-11-14 19:18:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:15,292 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-14 19:18:15,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 19:18:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-14 19:18:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 19:18:15,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:15,293 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:15,293 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:15,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:15,294 INFO L82 PathProgramCache]: Analyzing trace with hash 134681063, now seen corresponding path program 2 times [2018-11-14 19:18:15,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:15,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:15,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:15,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {928#true} call ULTIMATE.init(); {928#true} is VALID [2018-11-14 19:18:15,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {928#true} is VALID [2018-11-14 19:18:15,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {928#true} assume true; {928#true} is VALID [2018-11-14 19:18:15,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {928#true} {928#true} #66#return; {928#true} is VALID [2018-11-14 19:18:15,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {928#true} call #t~ret9 := main(); {928#true} is VALID [2018-11-14 19:18:15,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {928#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:15,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume true; {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:15,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:15,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:15,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume true; {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:15,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:15,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {930#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {931#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:15,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {931#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume true; {931#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:15,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {931#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {931#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:15,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {931#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {932#(and (or (<= main_~i~0 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:15,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {932#(and (or (<= main_~i~0 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume true; {932#(and (or (<= main_~i~0 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:15,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {932#(and (or (<= main_~i~0 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {932#(and (or (<= main_~i~0 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:15,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {932#(and (or (<= main_~i~0 0) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {933#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:15,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {933#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume true; {933#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:15,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {933#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {934#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:15,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {934#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {935#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:15,812 INFO L273 TraceCheckUtils]: 21: Hoare triple {935#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume true; {935#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:15,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {935#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !(~i~0 >= 0); {929#false} is VALID [2018-11-14 19:18:15,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {929#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {929#false} is VALID [2018-11-14 19:18:15,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {929#false} assume true; {929#false} is VALID [2018-11-14 19:18:15,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {929#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {929#false} is VALID [2018-11-14 19:18:15,813 INFO L256 TraceCheckUtils]: 26: Hoare triple {929#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {929#false} is VALID [2018-11-14 19:18:15,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {929#false} ~cond := #in~cond; {929#false} is VALID [2018-11-14 19:18:15,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {929#false} assume ~cond == 0; {929#false} is VALID [2018-11-14 19:18:15,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {929#false} assume !false; {929#false} is VALID [2018-11-14 19:18:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:15,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:15,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:15,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:15,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:18:15,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:15,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:15,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-14 19:18:15,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:15,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:15,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-14 19:18:16,437 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-14 19:18:16,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:16,449 INFO L477 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 46 treesize of output 43 [2018-11-14 19:18:16,453 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-14 19:18:16,455 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:16,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:16,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:16,487 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-14 19:18:16,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 40 treesize of output 36 [2018-11-14 19:18:16,856 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 19:18:16,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-14 19:18:16,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:16,870 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 19:18:16,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 19:18:16,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:16,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:16,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:16,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-14 19:18:16,901 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:18:16,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {928#true} call ULTIMATE.init(); {928#true} is VALID [2018-11-14 19:18:16,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {928#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {928#true} is VALID [2018-11-14 19:18:16,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {928#true} assume true; {928#true} is VALID [2018-11-14 19:18:16,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {928#true} {928#true} #66#return; {928#true} is VALID [2018-11-14 19:18:16,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {928#true} call #t~ret9 := main(); {928#true} is VALID [2018-11-14 19:18:16,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {928#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:16,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:16,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:16,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:16,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:16,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:16,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {954#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {973#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:16,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {973#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume true; {973#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:16,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {973#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {980#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} is VALID [2018-11-14 19:18:16,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {980#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {984#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-14 19:18:16,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {984#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume true; {984#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-14 19:18:16,969 INFO L273 TraceCheckUtils]: 16: Hoare triple {984#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {991#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-14 19:18:16,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {991#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {995#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:16,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {995#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {995#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:16,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {995#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1002#(and (<= 0 main_~i~0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))))} is VALID [2018-11-14 19:18:16,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {1002#(and (<= 0 main_~i~0) (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1006#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:16,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {1006#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} assume true; {1006#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:16,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {1006#(and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {1013#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:16,977 INFO L273 TraceCheckUtils]: 23: Hoare triple {1013#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 2 (mod (+ main_~max~0 4294967295) 4294967296)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1017#(and (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_2 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2) (= main_~j~0 (mod (+ v_prenex_2 4294967295) 4294967296)) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2147483647) (<= 2 (mod (+ v_prenex_2 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-14 19:18:16,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {1017#(and (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_2 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2) (= main_~j~0 (mod (+ v_prenex_2 4294967295) 4294967296)) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2147483647) (<= 2 (mod (+ v_prenex_2 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume true; {1017#(and (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_2 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2) (= main_~j~0 (mod (+ v_prenex_2 4294967295) 4294967296)) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2147483647) (<= 2 (mod (+ v_prenex_2 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-14 19:18:16,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {1017#(and (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_2 4294967295) 4294967296) (- 2))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 2))) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2) (= main_~j~0 (mod (+ v_prenex_2 4294967295) 4294967296)) (<= (mod (+ v_prenex_2 4294967295) 4294967296) 2147483647) (<= 2 (mod (+ v_prenex_2 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {1024#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-14 19:18:16,983 INFO L256 TraceCheckUtils]: 26: Hoare triple {1024#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1028#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:18:16,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {1028#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1032#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:18:16,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {1032#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {929#false} is VALID [2018-11-14 19:18:16,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {929#false} assume !false; {929#false} is VALID [2018-11-14 19:18:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:17,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:17,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2018-11-14 19:18:17,010 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-14 19:18:17,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:17,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 19:18:17,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:17,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 19:18:17,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 19:18:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-11-14 19:18:17,082 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 21 states. [2018-11-14 19:18:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:19,821 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 19:18:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 19:18:19,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-14 19:18:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:18:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2018-11-14 19:18:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:18:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2018-11-14 19:18:19,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 61 transitions. [2018-11-14 19:18:19,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:19,943 INFO L225 Difference]: With dead ends: 57 [2018-11-14 19:18:19,943 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 19:18:19,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-11-14 19:18:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 19:18:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-11-14 19:18:20,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:20,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 38 states. [2018-11-14 19:18:20,021 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 38 states. [2018-11-14 19:18:20,021 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 38 states. [2018-11-14 19:18:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:20,024 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-14 19:18:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 19:18:20,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:20,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:20,025 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 45 states. [2018-11-14 19:18:20,026 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 45 states. [2018-11-14 19:18:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:20,028 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-14 19:18:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 19:18:20,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:20,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:20,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:20,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 19:18:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-14 19:18:20,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2018-11-14 19:18:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:20,032 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-14 19:18:20,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 19:18:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 19:18:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 19:18:20,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:20,033 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:20,033 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:20,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash -796192273, now seen corresponding path program 3 times [2018-11-14 19:18:20,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:20,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:20,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:20,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:20,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {1278#true} call ULTIMATE.init(); {1278#true} is VALID [2018-11-14 19:18:20,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {1278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1278#true} is VALID [2018-11-14 19:18:20,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {1278#true} assume true; {1278#true} is VALID [2018-11-14 19:18:20,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1278#true} #66#return; {1278#true} is VALID [2018-11-14 19:18:20,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {1278#true} call #t~ret9 := main(); {1278#true} is VALID [2018-11-14 19:18:20,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {1278#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:20,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume true; {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:20,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:20,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:20,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume true; {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:20,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} is VALID [2018-11-14 19:18:20,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 5 main_~max~0))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1281#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:20,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume true; {1281#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:20,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1281#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:20,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {1281#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (not (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))) (<= 5 main_~max~0)) (or (= main_~max~0 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)) 1)) (= (+ main_~max~0 4294967295) (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1282#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= main_~i~0 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:20,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {1282#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= main_~i~0 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume true; {1282#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= main_~i~0 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:20,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {1282#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= main_~i~0 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1282#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= main_~i~0 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} is VALID [2018-11-14 19:18:20,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {1282#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= main_~i~0 1) (<= 4294967299 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296))))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1283#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= main_~i~0 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:20,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {1283#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= main_~i~0 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume true; {1283#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= main_~i~0 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:20,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {1283#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= main_~i~0 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1283#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= main_~i~0 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:20,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {1283#(and (or (<= 4294967298 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= main_~i~0 0)) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1284#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} is VALID [2018-11-14 19:18:20,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {1284#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} assume true; {1284#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} is VALID [2018-11-14 19:18:20,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {1284#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (or (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (+ main_~i~0 1) 0)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1285#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} is VALID [2018-11-14 19:18:20,646 INFO L273 TraceCheckUtils]: 23: Hoare triple {1285#(and (<= 4294967297 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))) (<= (div (+ main_~max~0 4294967295) 4294967296) 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1286#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:20,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {1286#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume true; {1286#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:20,649 INFO L273 TraceCheckUtils]: 25: Hoare triple {1286#(and (<= (div (+ main_~max~0 4294967295) 4294967296) 1) (<= 4294967296 (+ main_~i~0 (* 4294967296 (div (+ main_~max~0 4294967295) 4294967296)))))} assume !(~i~0 >= 0); {1279#false} is VALID [2018-11-14 19:18:20,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {1279#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1279#false} is VALID [2018-11-14 19:18:20,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {1279#false} assume true; {1279#false} is VALID [2018-11-14 19:18:20,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {1279#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {1279#false} is VALID [2018-11-14 19:18:20,650 INFO L256 TraceCheckUtils]: 29: Hoare triple {1279#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1279#false} is VALID [2018-11-14 19:18:20,650 INFO L273 TraceCheckUtils]: 30: Hoare triple {1279#false} ~cond := #in~cond; {1279#false} is VALID [2018-11-14 19:18:20,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {1279#false} assume ~cond == 0; {1279#false} is VALID [2018-11-14 19:18:20,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {1279#false} assume !false; {1279#false} is VALID [2018-11-14 19:18:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:20,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:20,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:20,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:18:20,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 19:18:20,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:20,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:20,862 INFO L256 TraceCheckUtils]: 0: Hoare triple {1278#true} call ULTIMATE.init(); {1278#true} is VALID [2018-11-14 19:18:20,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {1278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1278#true} is VALID [2018-11-14 19:18:20,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {1278#true} assume true; {1278#true} is VALID [2018-11-14 19:18:20,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1278#true} {1278#true} #66#return; {1278#true} is VALID [2018-11-14 19:18:20,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {1278#true} call #t~ret9 := main(); {1278#true} is VALID [2018-11-14 19:18:20,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {1278#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1305#(and (= main_~max~0 5) (= main_~i~0 0))} is VALID [2018-11-14 19:18:20,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {1305#(and (= main_~max~0 5) (= main_~i~0 0))} assume true; {1305#(and (= main_~max~0 5) (= main_~i~0 0))} is VALID [2018-11-14 19:18:20,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {1305#(and (= main_~max~0 5) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {1305#(and (= main_~max~0 5) (= main_~i~0 0))} is VALID [2018-11-14 19:18:20,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {1305#(and (= main_~max~0 5) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1315#(and (= main_~max~0 5) (= main_~i~0 1))} is VALID [2018-11-14 19:18:20,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {1315#(and (= main_~max~0 5) (= main_~i~0 1))} assume true; {1315#(and (= main_~max~0 5) (= main_~i~0 1))} is VALID [2018-11-14 19:18:20,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {1315#(and (= main_~max~0 5) (= main_~i~0 1))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1279#false} is VALID [2018-11-14 19:18:20,872 INFO L273 TraceCheckUtils]: 11: Hoare triple {1279#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1279#false} is VALID [2018-11-14 19:18:20,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {1279#false} assume true; {1279#false} is VALID [2018-11-14 19:18:20,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {1279#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1279#false} is VALID [2018-11-14 19:18:20,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {1279#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1279#false} is VALID [2018-11-14 19:18:20,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {1279#false} assume true; {1279#false} is VALID [2018-11-14 19:18:20,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {1279#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1279#false} is VALID [2018-11-14 19:18:20,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {1279#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1279#false} is VALID [2018-11-14 19:18:20,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {1279#false} assume true; {1279#false} is VALID [2018-11-14 19:18:20,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {1279#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1279#false} is VALID [2018-11-14 19:18:20,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {1279#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1279#false} is VALID [2018-11-14 19:18:20,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {1279#false} assume true; {1279#false} is VALID [2018-11-14 19:18:20,875 INFO L273 TraceCheckUtils]: 22: Hoare triple {1279#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1279#false} is VALID [2018-11-14 19:18:20,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {1279#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1279#false} is VALID [2018-11-14 19:18:20,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {1279#false} assume true; {1279#false} is VALID [2018-11-14 19:18:20,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {1279#false} assume !(~i~0 >= 0); {1279#false} is VALID [2018-11-14 19:18:20,876 INFO L273 TraceCheckUtils]: 26: Hoare triple {1279#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1279#false} is VALID [2018-11-14 19:18:20,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {1279#false} assume true; {1279#false} is VALID [2018-11-14 19:18:20,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {1279#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {1279#false} is VALID [2018-11-14 19:18:20,876 INFO L256 TraceCheckUtils]: 29: Hoare triple {1279#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1279#false} is VALID [2018-11-14 19:18:20,877 INFO L273 TraceCheckUtils]: 30: Hoare triple {1279#false} ~cond := #in~cond; {1279#false} is VALID [2018-11-14 19:18:20,877 INFO L273 TraceCheckUtils]: 31: Hoare triple {1279#false} assume ~cond == 0; {1279#false} is VALID [2018-11-14 19:18:20,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {1279#false} assume !false; {1279#false} is VALID [2018-11-14 19:18:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 19:18:20,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:20,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-14 19:18:20,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-11-14 19:18:20,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:20,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 19:18:20,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:20,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 19:18:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 19:18:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-14 19:18:20,971 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 11 states. [2018-11-14 19:18:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:22,765 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-11-14 19:18:22,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 19:18:22,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-11-14 19:18:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:18:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 89 transitions. [2018-11-14 19:18:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 19:18:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 89 transitions. [2018-11-14 19:18:22,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 89 transitions. [2018-11-14 19:18:22,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:22,935 INFO L225 Difference]: With dead ends: 91 [2018-11-14 19:18:22,935 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 19:18:22,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2018-11-14 19:18:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 19:18:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-11-14 19:18:23,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:23,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 44 states. [2018-11-14 19:18:23,077 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 44 states. [2018-11-14 19:18:23,078 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 44 states. [2018-11-14 19:18:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:23,082 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-14 19:18:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-14 19:18:23,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:23,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:23,083 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 64 states. [2018-11-14 19:18:23,084 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 64 states. [2018-11-14 19:18:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:23,087 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-14 19:18:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-14 19:18:23,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:23,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:23,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:23,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 19:18:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-14 19:18:23,090 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 33 [2018-11-14 19:18:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:23,090 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-14 19:18:23,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 19:18:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-14 19:18:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 19:18:23,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:23,091 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:23,092 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:23,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1817864972, now seen corresponding path program 4 times [2018-11-14 19:18:23,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:23,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:23,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:23,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {1715#true} call ULTIMATE.init(); {1715#true} is VALID [2018-11-14 19:18:23,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {1715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1715#true} is VALID [2018-11-14 19:18:23,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {1715#true} assume true; {1715#true} is VALID [2018-11-14 19:18:23,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1715#true} {1715#true} #66#return; {1715#true} is VALID [2018-11-14 19:18:23,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {1715#true} call #t~ret9 := main(); {1715#true} is VALID [2018-11-14 19:18:23,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {1715#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1717#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:23,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {1717#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} assume true; {1717#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:23,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {1717#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {1717#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:23,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {1717#(and (<= (div main_~max~0 4294967296) 0) (<= 5 main_~max~0) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1718#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-14 19:18:23,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {1718#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} assume true; {1718#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-14 19:18:23,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {1718#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {1718#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} is VALID [2018-11-14 19:18:23,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {1718#(and (<= 1 main_~i~0) (<= (div main_~max~0 4294967296) 0) (<= (+ main_~i~0 4) main_~max~0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1719#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2018-11-14 19:18:23,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {1719#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} assume true; {1719#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} is VALID [2018-11-14 19:18:23,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {1719#(and (<= (+ main_~i~0 3) main_~max~0) (<= (div main_~max~0 4294967296) (div main_~i~0 4294967296)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1716#false} is VALID [2018-11-14 19:18:23,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {1716#false} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1716#false} is VALID [2018-11-14 19:18:23,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {1716#false} assume true; {1716#false} is VALID [2018-11-14 19:18:23,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {1716#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1716#false} is VALID [2018-11-14 19:18:23,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {1716#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1716#false} is VALID [2018-11-14 19:18:23,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {1716#false} assume true; {1716#false} is VALID [2018-11-14 19:18:23,299 INFO L273 TraceCheckUtils]: 19: Hoare triple {1716#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1716#false} is VALID [2018-11-14 19:18:23,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {1716#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1716#false} is VALID [2018-11-14 19:18:23,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {1716#false} assume true; {1716#false} is VALID [2018-11-14 19:18:23,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {1716#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1716#false} is VALID [2018-11-14 19:18:23,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {1716#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1716#false} is VALID [2018-11-14 19:18:23,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {1716#false} assume true; {1716#false} is VALID [2018-11-14 19:18:23,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {1716#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1716#false} is VALID [2018-11-14 19:18:23,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {1716#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1716#false} is VALID [2018-11-14 19:18:23,300 INFO L273 TraceCheckUtils]: 27: Hoare triple {1716#false} assume true; {1716#false} is VALID [2018-11-14 19:18:23,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {1716#false} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1716#false} is VALID [2018-11-14 19:18:23,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {1716#false} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1716#false} is VALID [2018-11-14 19:18:23,301 INFO L273 TraceCheckUtils]: 30: Hoare triple {1716#false} assume true; {1716#false} is VALID [2018-11-14 19:18:23,301 INFO L273 TraceCheckUtils]: 31: Hoare triple {1716#false} assume !(~i~0 >= 0); {1716#false} is VALID [2018-11-14 19:18:23,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {1716#false} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1716#false} is VALID [2018-11-14 19:18:23,301 INFO L273 TraceCheckUtils]: 33: Hoare triple {1716#false} assume true; {1716#false} is VALID [2018-11-14 19:18:23,302 INFO L273 TraceCheckUtils]: 34: Hoare triple {1716#false} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {1716#false} is VALID [2018-11-14 19:18:23,302 INFO L256 TraceCheckUtils]: 35: Hoare triple {1716#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1716#false} is VALID [2018-11-14 19:18:23,302 INFO L273 TraceCheckUtils]: 36: Hoare triple {1716#false} ~cond := #in~cond; {1716#false} is VALID [2018-11-14 19:18:23,302 INFO L273 TraceCheckUtils]: 37: Hoare triple {1716#false} assume ~cond == 0; {1716#false} is VALID [2018-11-14 19:18:23,302 INFO L273 TraceCheckUtils]: 38: Hoare triple {1716#false} assume !false; {1716#false} is VALID [2018-11-14 19:18:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 19:18:23,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:23,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:23,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:18:23,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:18:23,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:23,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:23,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-14 19:18:23,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:23,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:23,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 19:18:24,268 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-14 19:18:24,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:24,279 INFO L477 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 46 treesize of output 43 [2018-11-14 19:18:24,285 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-14 19:18:24,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:24,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:24,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:24,318 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-14 19:18:24,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 40 treesize of output 36 [2018-11-14 19:18:24,749 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 19:18:24,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-14 19:18:24,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:24,763 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 19:18:24,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 19:18:24,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:24,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:24,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:24,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-14 19:18:24,787 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:18:24,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {1715#true} call ULTIMATE.init(); {1715#true} is VALID [2018-11-14 19:18:24,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {1715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1715#true} is VALID [2018-11-14 19:18:24,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {1715#true} assume true; {1715#true} is VALID [2018-11-14 19:18:24,842 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1715#true} {1715#true} #66#return; {1715#true} is VALID [2018-11-14 19:18:24,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {1715#true} call #t~ret9 := main(); {1715#true} is VALID [2018-11-14 19:18:24,843 INFO L273 TraceCheckUtils]: 5: Hoare triple {1715#true} ~max~0 := 5;call ~#str1~0.base, ~#str1~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);call ~#str2~0.base, ~#str2~0.offset := #Ultimate.alloc((if ~max~0 % 4294967296 % 4294967296 <= 2147483647 then ~max~0 % 4294967296 % 4294967296 else ~max~0 % 4294967296 % 4294967296 - 4294967296) * 1);havoc ~i~0;havoc ~j~0;~i~0 := 0; {1738#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-14 19:18:24,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {1738#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume true; {1738#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-14 19:18:24,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {1738#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {1738#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} is VALID [2018-11-14 19:18:24,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {1738#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);havoc #t~nondet1; {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,849 INFO L273 TraceCheckUtils]: 12: Hoare triple {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !(~i~0 % 4294967296 < ~max~0 % 4294967296); {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {1748#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} call write~int(0, ~#str1~0.base, ~#str1~0.offset + (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296) * 1, 1);~j~0 := 0;~i~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); {1767#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:24,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {1767#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume true; {1767#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} is VALID [2018-11-14 19:18:24,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {1767#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 0) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1774#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} is VALID [2018-11-14 19:18:24,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {1774#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967296) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= main_~i~0 (mod (+ main_~max~0 4294967295) 4294967296)))) (= main_~j~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1778#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-14 19:18:24,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {1778#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume true; {1778#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-14 19:18:24,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {1778#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 1) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1785#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} is VALID [2018-11-14 19:18:24,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {1785#(and (= main_~j~0 2) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (or (and (= (+ main_~i~0 4294967297) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (= (+ main_~i~0 1) (mod (+ main_~max~0 4294967295) 4294967296)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647))))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1789#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {1789#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {1789#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {1789#(and (= main_~j~0 2) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1796#(and (= main_~j~0 3) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {1796#(and (= main_~j~0 3) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 2)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 4294967298)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1800#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,864 INFO L273 TraceCheckUtils]: 24: Hoare triple {1800#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume true; {1800#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} is VALID [2018-11-14 19:18:24,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {1800#(and (= main_~j~0 3) (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1807#(and (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} is VALID [2018-11-14 19:18:24,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {1807#(and (= 0 |main_~#str1~0.offset|) (or (and (= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 3)) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647)) (and (= (+ main_~i~0 4294967299) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296)))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1811#(and (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} is VALID [2018-11-14 19:18:24,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {1811#(and (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} assume true; {1811#(and (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} is VALID [2018-11-14 19:18:24,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {1811#(and (or (and (= (+ main_~i~0 4294967300) (mod (+ main_~max~0 4294967295) 4294967296)) (< 2147483647 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))) (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= main_~j~0 4))} assume !!(~i~0 >= 0);call #t~mem3 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call write~int(#t~mem3, ~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1);havoc #t~mem3;#t~post4 := ~j~0;~j~0 := #t~post4 + 1;havoc #t~post4; {1818#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:24,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {1818#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| main_~i~0)) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= (+ main_~i~0 4) (mod (+ main_~max~0 4294967295) 4294967296)))} #t~post2 := ~i~0;~i~0 := #t~post2 - 1;havoc #t~post2; {1822#(and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 5)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:24,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {1822#(and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 5)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} assume true; {1822#(and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 5)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:24,874 INFO L273 TraceCheckUtils]: 31: Hoare triple {1822#(and (= 0 |main_~#str1~0.offset|) (<= (mod (+ main_~max~0 4294967295) 4294967296) 2147483647) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= (mod (+ main_~max~0 4294967295) 4294967296) (+ main_~i~0 5)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} assume !(~i~0 >= 0); {1829#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 4) (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} is VALID [2018-11-14 19:18:24,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {1829#(and (<= (mod (+ main_~max~0 4294967295) 4294967296) 4) (= 0 |main_~#str1~0.offset|) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ main_~max~0 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= 4 (mod (+ main_~max~0 4294967295) 4294967296)))} ~j~0 := (if (~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (~max~0 - 1) % 4294967296 % 4294967296 else (~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);~i~0 := 0; {1833#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_prenex_3 Int)) (and (<= (mod (+ v_prenex_3 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_3 4294967295) 4294967296)) (<= 4 (mod (+ v_prenex_3 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_3 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ v_prenex_3 4294967295) 4294967296) 4))) (= main_~i~0 0))} is VALID [2018-11-14 19:18:24,877 INFO L273 TraceCheckUtils]: 33: Hoare triple {1833#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_prenex_3 Int)) (and (<= (mod (+ v_prenex_3 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_3 4294967295) 4294967296)) (<= 4 (mod (+ v_prenex_3 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_3 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ v_prenex_3 4294967295) 4294967296) 4))) (= main_~i~0 0))} assume true; {1833#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_prenex_3 Int)) (and (<= (mod (+ v_prenex_3 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_3 4294967295) 4294967296)) (<= 4 (mod (+ v_prenex_3 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_3 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ v_prenex_3 4294967295) 4294967296) 4))) (= main_~i~0 0))} is VALID [2018-11-14 19:18:24,879 INFO L273 TraceCheckUtils]: 34: Hoare triple {1833#(and (= 0 |main_~#str1~0.offset|) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (exists ((v_prenex_3 Int)) (and (<= (mod (+ v_prenex_3 4294967295) 4294967296) 2147483647) (= main_~j~0 (mod (+ v_prenex_3 4294967295) 4294967296)) (<= 4 (mod (+ v_prenex_3 4294967295) 4294967296)) (= (select (select |#memory_int| |main_~#str1~0.base|) (+ |main_~#str1~0.offset| (mod (+ v_prenex_3 4294967295) 4294967296) (- 4))) (select (select |#memory_int| |main_~#str2~0.base|) (+ |main_~#str2~0.offset| 4))) (<= (mod (+ v_prenex_3 4294967295) 4294967296) 4))) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~max~0 % 4294967296);call #t~mem6 := read~int(~#str1~0.base, ~#str1~0.offset + ~i~0 * 1, 1);call #t~mem7 := read~int(~#str2~0.base, ~#str2~0.offset + ~j~0 * 1, 1); {1840#(= |main_#t~mem7| |main_#t~mem6|)} is VALID [2018-11-14 19:18:24,880 INFO L256 TraceCheckUtils]: 35: Hoare triple {1840#(= |main_#t~mem7| |main_#t~mem6|)} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1844#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:18:24,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {1844#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1848#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:18:24,882 INFO L273 TraceCheckUtils]: 37: Hoare triple {1848#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1716#false} is VALID [2018-11-14 19:18:24,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {1716#false} assume !false; {1716#false} is VALID [2018-11-14 19:18:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:18:24,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:24,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 20] total 23 [2018-11-14 19:18:24,912 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-11-14 19:18:24,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:24,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 19:18:25,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:25,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 19:18:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 19:18:25,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-11-14 19:18:25,118 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 23 states. [2018-11-14 19:18:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:18:25,449 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Result: VALID Review result: INVALID at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.createAssertionError(EfficientHoareTripleChecker.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.reviewInductiveInternal(EfficientHoareTripleChecker.java:117) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:672) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:18:25,454 INFO L168 Benchmark]: Toolchain (without parser) took 20966.13 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -697.1 MB). Peak memory consumption was 378.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:25,454 INFO L168 Benchmark]: CDTParser took 0.22 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-14 19:18:25,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.84 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-14 19:18:25,455 INFO L168 Benchmark]: Boogie Preprocessor took 53.04 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-14 19:18:25,456 INFO L168 Benchmark]: RCFGBuilder took 764.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:25,456 INFO L168 Benchmark]: TraceAbstraction took 19809.41 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 360.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 397.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:25,459 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.22 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. * CACSL2BoogieTranslator took 332.84 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 Preprocessor took 53.04 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 764.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19809.41 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 360.2 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 397.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Result: VALID Review result: INVALID de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Result: VALID Review result: INVALID: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.createAssertionError(EfficientHoareTripleChecker.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...