java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/relax_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:55:33,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:33,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:33,861 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:33,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:33,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:33,865 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:33,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:33,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:33,870 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:33,871 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:33,871 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:33,872 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:33,873 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:33,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:33,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:33,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:33,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:33,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:33,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:33,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:33,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:33,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:33,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:33,887 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:33,888 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:33,889 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:33,890 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:33,890 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:33,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:33,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:33,897 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:33,897 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:33,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:33,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:33,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:33,899 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:55:33,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:33,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:33,931 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:33,931 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:33,935 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:55:33,935 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:55:33,935 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:55:33,935 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:33,936 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:33,936 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:33,936 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:33,936 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:33,936 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:33,937 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:33,938 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:33,938 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:33,938 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:33,938 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:33,938 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:33,939 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:33,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:33,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:33,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:33,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:33,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:33,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:33,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:33,941 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:55:33,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:33,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:33,942 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:33,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:34,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:34,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:34,019 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:34,019 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:34,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax_true-unreach-call.i [2018-11-23 11:55:34,091 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3212ddfe8/d7abf8937931496ba6a0c514bb94a83c/FLAG88046cdda [2018-11-23 11:55:34,555 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:34,556 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax_true-unreach-call.i [2018-11-23 11:55:34,575 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3212ddfe8/d7abf8937931496ba6a0c514bb94a83c/FLAG88046cdda [2018-11-23 11:55:34,866 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3212ddfe8/d7abf8937931496ba6a0c514bb94a83c [2018-11-23 11:55:34,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:34,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:34,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:34,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:34,883 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:34,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:34" (1/1) ... [2018-11-23 11:55:34,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a25c626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:34, skipping insertion in model container [2018-11-23 11:55:34,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:34" (1/1) ... [2018-11-23 11:55:34,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:34,952 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:35,366 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:35,385 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:35,489 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:35,632 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:35,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35 WrapperNode [2018-11-23 11:55:35,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:35,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:35,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:35,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:35,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:35,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:35,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:35,688 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:35,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... [2018-11-23 11:55:35,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:35,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:35,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:35,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:35,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:35,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:55:35,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:55:35,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:55:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:55:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_relaxed_prefix [2018-11-23 11:55:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure is_relaxed_prefix [2018-11-23 11:55:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:55:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:35,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:35,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:36,949 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:36,950 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:55:36,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:36 BoogieIcfgContainer [2018-11-23 11:55:36,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:36,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:36,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:36,955 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:36,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:34" (1/3) ... [2018-11-23 11:55:36,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba6c89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:36, skipping insertion in model container [2018-11-23 11:55:36,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:35" (2/3) ... [2018-11-23 11:55:36,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba6c89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:36, skipping insertion in model container [2018-11-23 11:55:36,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:36" (3/3) ... [2018-11-23 11:55:36,959 INFO L112 eAbstractionObserver]: Analyzing ICFG relax_true-unreach-call.i [2018-11-23 11:55:36,968 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:36,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:36,995 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:37,027 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:37,027 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:37,028 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:37,028 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:37,028 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:37,028 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:37,028 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:37,029 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:37,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 11:55:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:55:37,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:37,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:37,056 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:37,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1802974904, now seen corresponding path program 1 times [2018-11-23 11:55:37,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:37,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:37,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:37,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 11:55:37,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53#true} is VALID [2018-11-23 11:55:37,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:55:37,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #156#return; {53#true} is VALID [2018-11-23 11:55:37,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret28 := main(); {53#true} is VALID [2018-11-23 11:55:37,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {53#true} is VALID [2018-11-23 11:55:37,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#true} assume !true; {54#false} is VALID [2018-11-23 11:55:37,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#false} ~j~1 := 0; {54#false} is VALID [2018-11-23 11:55:37,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {54#false} assume !true; {54#false} is VALID [2018-11-23 11:55:37,263 INFO L256 TraceCheckUtils]: 9: Hoare triple {54#false} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {53#true} is VALID [2018-11-23 11:55:37,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {53#true} is VALID [2018-11-23 11:55:37,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {53#true} assume ~pat_length % 4294967296 > (1 + ~a_length) % 4294967296;#res := 0; {53#true} is VALID [2018-11-23 11:55:37,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:55:37,265 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {53#true} {54#false} #160#return; {54#false} is VALID [2018-11-23 11:55:37,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {54#false} assume 0 != #t~ret14 % 256;havoc #t~ret14; {54#false} is VALID [2018-11-23 11:55:37,265 INFO L256 TraceCheckUtils]: 15: Hoare triple {54#false} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {54#false} is VALID [2018-11-23 11:55:37,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {54#false} ~cond := #in~cond; {54#false} is VALID [2018-11-23 11:55:37,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {54#false} assume 0 == ~cond; {54#false} is VALID [2018-11-23 11:55:37,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 11:55:37,270 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-23 11:55:37,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:37,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:55:37,279 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 11:55:37,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:37,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:55:37,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:37,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:55:37,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:55:37,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:37,401 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 11:55:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:37,740 INFO L93 Difference]: Finished difference Result 92 states and 142 transitions. [2018-11-23 11:55:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:55:37,740 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 11:55:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2018-11-23 11:55:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2018-11-23 11:55:37,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 142 transitions. [2018-11-23 11:55:38,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:38,425 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:55:38,425 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:55:38,429 INFO L631 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-23 11:55:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:55:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 11:55:38,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:38,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:38,644 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:38,644 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,651 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2018-11-23 11:55:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2018-11-23 11:55:38,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:38,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:38,653 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:38,653 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 11:55:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,661 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2018-11-23 11:55:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2018-11-23 11:55:38,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:38,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:38,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:38,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:55:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2018-11-23 11:55:38,673 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 19 [2018-11-23 11:55:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:38,674 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2018-11-23 11:55:38,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:55:38,674 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2018-11-23 11:55:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:55:38,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:38,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:38,676 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:38,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2145750596, now seen corresponding path program 1 times [2018-11-23 11:55:38,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:38,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:38,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:38,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2018-11-23 11:55:38,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {324#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {324#true} is VALID [2018-11-23 11:55:38,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {324#true} assume true; {324#true} is VALID [2018-11-23 11:55:38,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {324#true} {324#true} #156#return; {324#true} is VALID [2018-11-23 11:55:38,850 INFO L256 TraceCheckUtils]: 4: Hoare triple {324#true} call #t~ret28 := main(); {324#true} is VALID [2018-11-23 11:55:38,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {324#true} is VALID [2018-11-23 11:55:38,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {324#true} is VALID [2018-11-23 11:55:38,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {324#true} ~j~1 := 0; {324#true} is VALID [2018-11-23 11:55:38,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {324#true} is VALID [2018-11-23 11:55:38,852 INFO L256 TraceCheckUtils]: 9: Hoare triple {324#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {324#true} is VALID [2018-11-23 11:55:38,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {324#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {324#true} is VALID [2018-11-23 11:55:38,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {324#true} assume ~pat_length % 4294967296 > (1 + ~a_length) % 4294967296;#res := 0; {326#(= 0 |is_relaxed_prefix_#res|)} is VALID [2018-11-23 11:55:38,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#(= 0 |is_relaxed_prefix_#res|)} assume true; {326#(= 0 |is_relaxed_prefix_#res|)} is VALID [2018-11-23 11:55:38,859 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {326#(= 0 |is_relaxed_prefix_#res|)} {324#true} #160#return; {327#(= |main_#t~ret14| 0)} is VALID [2018-11-23 11:55:38,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {327#(= |main_#t~ret14| 0)} assume 0 != #t~ret14 % 256;havoc #t~ret14; {325#false} is VALID [2018-11-23 11:55:38,860 INFO L256 TraceCheckUtils]: 15: Hoare triple {325#false} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {325#false} is VALID [2018-11-23 11:55:38,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {325#false} ~cond := #in~cond; {325#false} is VALID [2018-11-23 11:55:38,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {325#false} assume 0 == ~cond; {325#false} is VALID [2018-11-23 11:55:38,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {325#false} assume !false; {325#false} is VALID [2018-11-23 11:55:38,865 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-23 11:55:38,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:38,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:55:38,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 11:55:38,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:38,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:55:38,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:38,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:38,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:38,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:38,943 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand 4 states. [2018-11-23 11:55:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,323 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2018-11-23 11:55:39,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:39,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 11:55:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 11:55:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 11:55:39,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-23 11:55:39,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:39,540 INFO L225 Difference]: With dead ends: 65 [2018-11-23 11:55:39,540 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:55:39,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:55:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 11:55:39,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:39,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:39,563 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:39,563 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,567 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2018-11-23 11:55:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2018-11-23 11:55:39,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:39,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:39,569 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:39,569 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:55:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,574 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2018-11-23 11:55:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2018-11-23 11:55:39,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:39,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:39,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:39,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:55:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2018-11-23 11:55:39,579 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 19 [2018-11-23 11:55:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:39,580 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2018-11-23 11:55:39,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2018-11-23 11:55:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:55:39,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:39,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:39,582 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:39,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash 371150438, now seen corresponding path program 1 times [2018-11-23 11:55:39,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:39,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:39,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:39,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:39,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-23 11:55:39,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {573#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {573#true} is VALID [2018-11-23 11:55:39,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-23 11:55:39,907 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #156#return; {573#true} is VALID [2018-11-23 11:55:39,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret28 := main(); {573#true} is VALID [2018-11-23 11:55:39,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {573#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {575#(= main_~j~0 0)} is VALID [2018-11-23 11:55:39,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {575#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-23 11:55:39,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} ~j~1 := 0; {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-23 11:55:39,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-23 11:55:39,910 INFO L256 TraceCheckUtils]: 9: Hoare triple {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {573#true} is VALID [2018-11-23 11:55:39,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {573#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {573#true} is VALID [2018-11-23 11:55:39,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {573#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {573#true} is VALID [2018-11-23 11:55:39,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {573#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {573#true} is VALID [2018-11-23 11:55:39,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {573#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {573#true} is VALID [2018-11-23 11:55:39,913 INFO L273 TraceCheckUtils]: 14: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-23 11:55:39,917 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {573#true} {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} #160#return; {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-23 11:55:39,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} assume 0 != #t~ret14 % 256;havoc #t~ret14; {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} is VALID [2018-11-23 11:55:39,921 INFO L256 TraceCheckUtils]: 17: Hoare triple {576#(<= main_~pat_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {577#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:55:39,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {577#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {578#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:55:39,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {578#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {574#false} is VALID [2018-11-23 11:55:39,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-23 11:55:39,924 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-23 11:55:39,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:39,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:55:39,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:55:39,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:39,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:39,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:39,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:39,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:39,958 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand 6 states. [2018-11-23 11:55:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,580 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2018-11-23 11:55:40,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:40,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:55:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-23 11:55:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-23 11:55:40,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2018-11-23 11:55:40,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:40,809 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:55:40,809 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:55:40,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:55:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-23 11:55:40,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:40,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 57 states. [2018-11-23 11:55:40,849 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 57 states. [2018-11-23 11:55:40,850 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 57 states. [2018-11-23 11:55:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,854 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2018-11-23 11:55:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-23 11:55:40,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:40,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:40,856 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 60 states. [2018-11-23 11:55:40,856 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 60 states. [2018-11-23 11:55:40,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,860 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2018-11-23 11:55:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-23 11:55:40,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:40,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:40,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:40,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:55:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2018-11-23 11:55:40,867 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 21 [2018-11-23 11:55:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:40,868 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2018-11-23 11:55:40,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2018-11-23 11:55:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:55:40,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:40,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:40,870 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:40,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash 302236443, now seen corresponding path program 1 times [2018-11-23 11:55:40,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:40,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:40,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:40,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:40,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:41,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {897#true} call ULTIMATE.init(); {897#true} is VALID [2018-11-23 11:55:41,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {897#true} is VALID [2018-11-23 11:55:41,411 INFO L273 TraceCheckUtils]: 2: Hoare triple {897#true} assume true; {897#true} is VALID [2018-11-23 11:55:41,411 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {897#true} {897#true} #156#return; {897#true} is VALID [2018-11-23 11:55:41,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {897#true} call #t~ret28 := main(); {897#true} is VALID [2018-11-23 11:55:41,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {897#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {899#(= main_~j~0 0)} is VALID [2018-11-23 11:55:41,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {899#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {900#(<= (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ main_~pat_len~0 4294967295)) 4294967296) 0)} is VALID [2018-11-23 11:55:41,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {900#(<= (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ main_~pat_len~0 4294967295)) 4294967296) 0)} ~j~1 := 0; {900#(<= (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ main_~pat_len~0 4294967295)) 4294967296) 0)} is VALID [2018-11-23 11:55:41,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {900#(<= (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ main_~pat_len~0 4294967295)) 4294967296) 0)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {900#(<= (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ main_~pat_len~0 4294967295)) 4294967296) 0)} is VALID [2018-11-23 11:55:41,422 INFO L256 TraceCheckUtils]: 9: Hoare triple {900#(<= (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ main_~pat_len~0 4294967295)) 4294967296) 0)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {897#true} is VALID [2018-11-23 11:55:41,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {897#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {901#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} is VALID [2018-11-23 11:55:41,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {901#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} assume ~pat_length % 4294967296 > (1 + ~a_length) % 4294967296;#res := 0; {902#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} is VALID [2018-11-23 11:55:41,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {902#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} assume true; {902#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} is VALID [2018-11-23 11:55:41,429 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {902#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~pat_length|) 4294967295)} {900#(<= (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ main_~pat_len~0 4294967295)) 4294967296) 0)} #160#return; {898#false} is VALID [2018-11-23 11:55:41,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {898#false} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {898#false} is VALID [2018-11-23 11:55:41,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {898#false} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {898#false} is VALID [2018-11-23 11:55:41,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {898#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {898#false} is VALID [2018-11-23 11:55:41,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {898#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {898#false} is VALID [2018-11-23 11:55:41,431 INFO L256 TraceCheckUtils]: 18: Hoare triple {898#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {898#false} is VALID [2018-11-23 11:55:41,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {898#false} ~cond := #in~cond; {898#false} is VALID [2018-11-23 11:55:41,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {898#false} assume 0 == ~cond; {898#false} is VALID [2018-11-23 11:55:41,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {898#false} assume !false; {898#false} is VALID [2018-11-23 11:55:41,434 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-23 11:55:41,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:41,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:55:41,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:55:41,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:41,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:41,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:41,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:41,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:41,477 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand 6 states. [2018-11-23 11:55:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,305 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2018-11-23 11:55:42,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:42,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:55:42,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2018-11-23 11:55:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2018-11-23 11:55:42,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2018-11-23 11:55:42,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:42,444 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:55:42,444 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:55:42,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:55:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-23 11:55:42,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:42,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2018-11-23 11:55:42,528 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2018-11-23 11:55:42,528 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2018-11-23 11:55:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,534 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2018-11-23 11:55:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2018-11-23 11:55:42,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:42,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:42,535 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2018-11-23 11:55:42,535 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2018-11-23 11:55:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:42,539 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2018-11-23 11:55:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2018-11-23 11:55:42,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:42,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:42,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:42,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 11:55:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2018-11-23 11:55:42,544 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 22 [2018-11-23 11:55:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:42,545 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-23 11:55:42,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2018-11-23 11:55:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:55:42,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:42,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:42,546 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:42,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash 822089444, now seen corresponding path program 1 times [2018-11-23 11:55:42,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:42,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:42,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:43,328 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-23 11:55:43,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {1214#true} call ULTIMATE.init(); {1214#true} is VALID [2018-11-23 11:55:43,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {1214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1214#true} is VALID [2018-11-23 11:55:43,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 11:55:43,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1214#true} {1214#true} #156#return; {1214#true} is VALID [2018-11-23 11:55:43,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {1214#true} call #t~ret28 := main(); {1214#true} is VALID [2018-11-23 11:55:43,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {1214#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {1216#(= main_~j~0 0)} is VALID [2018-11-23 11:55:43,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {1216#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {1216#(= main_~j~0 0)} is VALID [2018-11-23 11:55:43,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {1216#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {1217#(and (or (<= main_~j~0 1) (<= (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296))) (or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1))))} is VALID [2018-11-23 11:55:43,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {1217#(and (or (<= main_~j~0 1) (<= (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296))) (or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1))))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {1218#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)))} is VALID [2018-11-23 11:55:43,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {1218#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)))} ~j~1 := 0; {1219#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (and (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~1 0)))} is VALID [2018-11-23 11:55:43,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {1219#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (and (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~1 0)))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {1220#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} is VALID [2018-11-23 11:55:43,509 INFO L256 TraceCheckUtils]: 11: Hoare triple {1220#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {1214#true} is VALID [2018-11-23 11:55:43,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {1214#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {1214#true} is VALID [2018-11-23 11:55:43,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {1214#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {1214#true} is VALID [2018-11-23 11:55:43,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {1214#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {1214#true} is VALID [2018-11-23 11:55:43,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {1214#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {1214#true} is VALID [2018-11-23 11:55:43,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 11:55:43,515 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1214#true} {1220#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} #160#return; {1220#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} is VALID [2018-11-23 11:55:43,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {1220#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} assume 0 != #t~ret14 % 256;havoc #t~ret14; {1220#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} is VALID [2018-11-23 11:55:43,517 INFO L256 TraceCheckUtils]: 19: Hoare triple {1220#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {1221#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:55:43,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {1221#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1222#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:55:43,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {1222#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1215#false} is VALID [2018-11-23 11:55:43,519 INFO L273 TraceCheckUtils]: 22: Hoare triple {1215#false} assume !false; {1215#false} is VALID [2018-11-23 11:55:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:43,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:43,522 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-23 11:55:43,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:43,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:44,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {1214#true} call ULTIMATE.init(); {1214#true} is VALID [2018-11-23 11:55:44,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {1214#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1214#true} is VALID [2018-11-23 11:55:44,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 11:55:44,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1214#true} {1214#true} #156#return; {1214#true} is VALID [2018-11-23 11:55:44,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {1214#true} call #t~ret28 := main(); {1214#true} is VALID [2018-11-23 11:55:44,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {1214#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {1216#(= main_~j~0 0)} is VALID [2018-11-23 11:55:44,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {1216#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {1244#(and (< (mod main_~j~0 4294967296) (mod main_~pat_len~0 4294967296)) (= main_~j~0 0))} is VALID [2018-11-23 11:55:44,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {1244#(and (< (mod main_~j~0 4294967296) (mod main_~pat_len~0 4294967296)) (= main_~j~0 0))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {1248#(and (< 0 (mod main_~pat_len~0 4294967296)) (= main_~j~0 1))} is VALID [2018-11-23 11:55:44,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {1248#(and (< 0 (mod main_~pat_len~0 4294967296)) (= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {1252#(and (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} is VALID [2018-11-23 11:55:44,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {1252#(and (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} ~j~1 := 0; {1256#(and (= main_~j~1 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} is VALID [2018-11-23 11:55:44,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {1256#(and (= main_~j~1 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {1260#(and (<= (mod main_~a_len~0 4294967296) 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} is VALID [2018-11-23 11:55:44,017 INFO L256 TraceCheckUtils]: 11: Hoare triple {1260#(and (<= (mod main_~a_len~0 4294967296) 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {1214#true} is VALID [2018-11-23 11:55:44,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {1214#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {1214#true} is VALID [2018-11-23 11:55:44,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {1214#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {1214#true} is VALID [2018-11-23 11:55:44,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {1214#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {1214#true} is VALID [2018-11-23 11:55:44,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {1214#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {1214#true} is VALID [2018-11-23 11:55:44,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {1214#true} assume true; {1214#true} is VALID [2018-11-23 11:55:44,032 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1214#true} {1260#(and (<= (mod main_~a_len~0 4294967296) 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} #160#return; {1260#(and (<= (mod main_~a_len~0 4294967296) 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} is VALID [2018-11-23 11:55:44,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {1260#(and (<= (mod main_~a_len~0 4294967296) 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} assume 0 != #t~ret14 % 256;havoc #t~ret14; {1260#(and (<= (mod main_~a_len~0 4294967296) 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} is VALID [2018-11-23 11:55:44,036 INFO L256 TraceCheckUtils]: 19: Hoare triple {1260#(and (<= (mod main_~a_len~0 4294967296) 0) (< 0 (mod main_~pat_len~0 4294967296)) (<= (mod main_~pat_len~0 4294967296) 1))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {1221#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:55:44,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {1221#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1222#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:55:44,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {1222#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1215#false} is VALID [2018-11-23 11:55:44,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {1215#false} assume !false; {1215#false} is VALID [2018-11-23 11:55:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:44,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:44,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-11-23 11:55:44,065 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 11:55:44,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:44,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:44,142 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-23 11:55:44,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:44,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:44,143 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 14 states. [2018-11-23 11:55:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,287 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2018-11-23 11:55:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:55:47,287 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 11:55:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 174 transitions. [2018-11-23 11:55:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 174 transitions. [2018-11-23 11:55:47,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 174 transitions. [2018-11-23 11:55:47,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:47,547 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:55:47,547 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:55:47,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:55:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:55:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 77. [2018-11-23 11:55:47,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:47,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 77 states. [2018-11-23 11:55:47,665 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 77 states. [2018-11-23 11:55:47,665 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 77 states. [2018-11-23 11:55:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,671 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2018-11-23 11:55:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2018-11-23 11:55:47,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:47,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:47,672 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 106 states. [2018-11-23 11:55:47,672 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 106 states. [2018-11-23 11:55:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:47,677 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2018-11-23 11:55:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2018-11-23 11:55:47,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:47,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:47,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:47,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 11:55:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2018-11-23 11:55:47,683 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2018-11-23 11:55:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:47,683 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2018-11-23 11:55:47,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2018-11-23 11:55:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:55:47,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:47,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:47,685 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:47,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash -238113231, now seen corresponding path program 1 times [2018-11-23 11:55:47,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:47,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:47,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:47,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:47,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {1811#true} call ULTIMATE.init(); {1811#true} is VALID [2018-11-23 11:55:47,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {1811#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1811#true} is VALID [2018-11-23 11:55:47,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {1811#true} assume true; {1811#true} is VALID [2018-11-23 11:55:47,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1811#true} {1811#true} #156#return; {1811#true} is VALID [2018-11-23 11:55:47,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {1811#true} call #t~ret28 := main(); {1811#true} is VALID [2018-11-23 11:55:47,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {1811#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {1811#true} is VALID [2018-11-23 11:55:47,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {1811#true} is VALID [2018-11-23 11:55:47,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {1811#true} ~j~1 := 0; {1811#true} is VALID [2018-11-23 11:55:47,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {1811#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {1811#true} is VALID [2018-11-23 11:55:47,905 INFO L256 TraceCheckUtils]: 9: Hoare triple {1811#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {1811#true} is VALID [2018-11-23 11:55:47,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {1811#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {1811#true} is VALID [2018-11-23 11:55:47,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {1811#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {1811#true} is VALID [2018-11-23 11:55:47,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {1811#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {1811#true} is VALID [2018-11-23 11:55:47,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {1811#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {1813#(= 1 |is_relaxed_prefix_#res|)} is VALID [2018-11-23 11:55:47,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {1813#(= 1 |is_relaxed_prefix_#res|)} assume true; {1813#(= 1 |is_relaxed_prefix_#res|)} is VALID [2018-11-23 11:55:47,913 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1813#(= 1 |is_relaxed_prefix_#res|)} {1811#true} #160#return; {1814#(= |main_#t~ret14| 1)} is VALID [2018-11-23 11:55:47,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {1814#(= |main_#t~ret14| 1)} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {1812#false} is VALID [2018-11-23 11:55:47,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {1812#false} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {1812#false} is VALID [2018-11-23 11:55:47,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {1812#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {1812#false} is VALID [2018-11-23 11:55:47,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {1812#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {1812#false} is VALID [2018-11-23 11:55:47,914 INFO L256 TraceCheckUtils]: 20: Hoare triple {1812#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {1812#false} is VALID [2018-11-23 11:55:47,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {1812#false} ~cond := #in~cond; {1812#false} is VALID [2018-11-23 11:55:47,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {1812#false} assume 0 == ~cond; {1812#false} is VALID [2018-11-23 11:55:47,915 INFO L273 TraceCheckUtils]: 23: Hoare triple {1812#false} assume !false; {1812#false} is VALID [2018-11-23 11:55:47,916 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-23 11:55:47,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:47,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:55:47,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 11:55:47,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:47,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:55:47,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:47,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:55:47,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:55:47,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:47,941 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 4 states. [2018-11-23 11:55:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,152 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2018-11-23 11:55:48,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:48,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 11:55:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 11:55:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:55:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 11:55:48,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-23 11:55:48,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:48,276 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:55:48,276 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:55:48,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:55:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:55:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-23 11:55:48,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:48,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 65 states. [2018-11-23 11:55:48,380 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 65 states. [2018-11-23 11:55:48,380 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 65 states. [2018-11-23 11:55:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,383 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2018-11-23 11:55:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2018-11-23 11:55:48,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:48,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:48,384 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 69 states. [2018-11-23 11:55:48,385 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 69 states. [2018-11-23 11:55:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:48,388 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2018-11-23 11:55:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2018-11-23 11:55:48,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:48,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:48,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:48,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:55:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2018-11-23 11:55:48,392 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 24 [2018-11-23 11:55:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:48,393 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2018-11-23 11:55:48,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:55:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2018-11-23 11:55:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:55:48,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:48,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:48,394 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:48,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1394596699, now seen corresponding path program 1 times [2018-11-23 11:55:48,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:48,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:48,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:48,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {2167#true} call ULTIMATE.init(); {2167#true} is VALID [2018-11-23 11:55:48,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {2167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2167#true} is VALID [2018-11-23 11:55:48,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {2167#true} assume true; {2167#true} is VALID [2018-11-23 11:55:48,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2167#true} {2167#true} #156#return; {2167#true} is VALID [2018-11-23 11:55:48,565 INFO L256 TraceCheckUtils]: 4: Hoare triple {2167#true} call #t~ret28 := main(); {2167#true} is VALID [2018-11-23 11:55:48,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {2167#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {2167#true} is VALID [2018-11-23 11:55:48,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {2167#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {2167#true} is VALID [2018-11-23 11:55:48,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {2167#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {2167#true} is VALID [2018-11-23 11:55:48,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {2167#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {2167#true} is VALID [2018-11-23 11:55:48,566 INFO L273 TraceCheckUtils]: 9: Hoare triple {2167#true} ~j~1 := 0; {2167#true} is VALID [2018-11-23 11:55:48,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {2167#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {2167#true} is VALID [2018-11-23 11:55:48,567 INFO L256 TraceCheckUtils]: 11: Hoare triple {2167#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {2167#true} is VALID [2018-11-23 11:55:48,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {2167#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {2169#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} is VALID [2018-11-23 11:55:48,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {2169#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} assume ~pat_length % 4294967296 > (1 + ~a_length) % 4294967296;#res := 0; {2170#(<= (+ |is_relaxed_prefix_#in~a_length| 2) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) (+ (- (- |is_relaxed_prefix_#in~a_length|)) 1)) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:55:48,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {2170#(<= (+ |is_relaxed_prefix_#in~a_length| 2) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) (+ (- (- |is_relaxed_prefix_#in~a_length|)) 1)) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} assume true; {2170#(<= (+ |is_relaxed_prefix_#in~a_length| 2) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) (+ (- (- |is_relaxed_prefix_#in~a_length|)) 1)) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:55:48,609 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2170#(<= (+ |is_relaxed_prefix_#in~a_length| 2) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) (+ (- (- |is_relaxed_prefix_#in~a_length|)) 1)) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} {2167#true} #160#return; {2171#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 2) (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))))} is VALID [2018-11-23 11:55:48,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {2171#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 2) (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {2171#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 2) (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))))} is VALID [2018-11-23 11:55:48,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {2171#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 2) (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {2168#false} is VALID [2018-11-23 11:55:48,612 INFO L273 TraceCheckUtils]: 18: Hoare triple {2168#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {2168#false} is VALID [2018-11-23 11:55:48,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {2168#false} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {2168#false} is VALID [2018-11-23 11:55:48,613 INFO L256 TraceCheckUtils]: 20: Hoare triple {2168#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {2168#false} is VALID [2018-11-23 11:55:48,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {2168#false} ~cond := #in~cond; {2168#false} is VALID [2018-11-23 11:55:48,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {2168#false} assume 0 == ~cond; {2168#false} is VALID [2018-11-23 11:55:48,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {2168#false} assume !false; {2168#false} is VALID [2018-11-23 11:55:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:55:48,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:48,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:55:48,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:55:48,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:48,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:48,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:48,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:48,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:48,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:48,665 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand 5 states. [2018-11-23 11:55:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,136 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2018-11-23 11:55:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:49,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:55:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2018-11-23 11:55:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2018-11-23 11:55:49,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2018-11-23 11:55:49,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:49,237 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:55:49,237 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:55:49,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:55:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 11:55:49,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:49,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:49,274 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:49,275 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,279 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-23 11:55:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2018-11-23 11:55:49,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:49,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:49,280 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:49,280 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-23 11:55:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:49,283 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-23 11:55:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2018-11-23 11:55:49,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:49,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:49,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:49,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:55:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2018-11-23 11:55:49,287 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 24 [2018-11-23 11:55:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:49,287 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2018-11-23 11:55:49,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2018-11-23 11:55:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:55:49,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:49,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:49,289 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:49,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1814362018, now seen corresponding path program 1 times [2018-11-23 11:55:49,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:49,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:49,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:49,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {2505#true} call ULTIMATE.init(); {2505#true} is VALID [2018-11-23 11:55:50,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {2505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2505#true} is VALID [2018-11-23 11:55:50,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {2505#true} assume true; {2505#true} is VALID [2018-11-23 11:55:50,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2505#true} {2505#true} #156#return; {2505#true} is VALID [2018-11-23 11:55:50,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {2505#true} call #t~ret28 := main(); {2505#true} is VALID [2018-11-23 11:55:50,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {2505#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {2507#(= main_~j~0 0)} is VALID [2018-11-23 11:55:50,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {2507#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {2507#(= main_~j~0 0)} is VALID [2018-11-23 11:55:50,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {2507#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {2508#(and (or (<= main_~j~0 1) (<= (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296))) (or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1))))} is VALID [2018-11-23 11:55:50,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {2508#(and (or (<= main_~j~0 1) (<= (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296))) (or (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (< (div (+ main_~a_len~0 1) 4294967296) (+ (div main_~j~0 4294967296) (div main_~a_len~0 4294967296) 1))))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {2509#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)))} is VALID [2018-11-23 11:55:50,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {2509#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)))} ~j~1 := 0; {2510#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (and (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~1 0)))} is VALID [2018-11-23 11:55:50,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {2510#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (and (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~1 0)))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {2511#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (and (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~1 0)))} is VALID [2018-11-23 11:55:50,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {2511#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (and (<= (+ (div main_~a_len~0 4294967296) 1) (div (+ main_~a_len~0 1) 4294967296)) (= main_~j~1 0)))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {2512#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (and (<= (+ (div main_~a_len~0 4294967296) 1) (+ (div main_~j~1 4294967296) (div (+ main_~a_len~0 1) 4294967296))) (<= main_~j~1 1)))} is VALID [2018-11-23 11:55:50,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {2512#(or (<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (and (<= (+ (div main_~a_len~0 4294967296) 1) (+ (div main_~j~1 4294967296) (div (+ main_~a_len~0 1) 4294967296))) (<= main_~j~1 1)))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {2513#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} is VALID [2018-11-23 11:55:50,189 INFO L256 TraceCheckUtils]: 13: Hoare triple {2513#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {2505#true} is VALID [2018-11-23 11:55:50,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {2505#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {2505#true} is VALID [2018-11-23 11:55:50,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {2505#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {2505#true} is VALID [2018-11-23 11:55:50,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {2505#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {2505#true} is VALID [2018-11-23 11:55:50,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {2505#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {2505#true} is VALID [2018-11-23 11:55:50,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {2505#true} assume true; {2505#true} is VALID [2018-11-23 11:55:50,192 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2505#true} {2513#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} #160#return; {2513#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} is VALID [2018-11-23 11:55:50,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {2513#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} assume 0 != #t~ret14 % 256;havoc #t~ret14; {2513#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} is VALID [2018-11-23 11:55:50,194 INFO L256 TraceCheckUtils]: 21: Hoare triple {2513#(<= (+ main_~pat_len~0 (* 4294967296 (div (+ main_~a_len~0 1) 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {2514#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:55:50,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {2514#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2515#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:55:50,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {2515#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2506#false} is VALID [2018-11-23 11:55:50,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {2506#false} assume !false; {2506#false} is VALID [2018-11-23 11:55:50,198 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-23 11:55:50,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:50,198 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-23 11:55:50,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:50,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {2505#true} call ULTIMATE.init(); {2505#true} is VALID [2018-11-23 11:55:50,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {2505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2505#true} is VALID [2018-11-23 11:55:50,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {2505#true} assume true; {2505#true} is VALID [2018-11-23 11:55:50,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2505#true} {2505#true} #156#return; {2505#true} is VALID [2018-11-23 11:55:50,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {2505#true} call #t~ret28 := main(); {2505#true} is VALID [2018-11-23 11:55:50,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {2505#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {2507#(= main_~j~0 0)} is VALID [2018-11-23 11:55:50,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {2507#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {2537#(< 0 (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:55:50,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {2537#(< 0 (mod main_~pat_len~0 4294967296))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {2537#(< 0 (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:55:50,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {2537#(< 0 (mod main_~pat_len~0 4294967296))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {2537#(< 0 (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:55:50,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {2537#(< 0 (mod main_~pat_len~0 4294967296))} ~j~1 := 0; {2547#(and (= main_~j~1 0) (< 0 (mod main_~pat_len~0 4294967296)))} is VALID [2018-11-23 11:55:50,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {2547#(and (= main_~j~1 0) (< 0 (mod main_~pat_len~0 4294967296)))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {2551#(and (< 0 (mod main_~pat_len~0 4294967296)) (< 0 (mod main_~a_len~0 4294967296)))} is VALID [2018-11-23 11:55:50,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {2551#(and (< 0 (mod main_~pat_len~0 4294967296)) (< 0 (mod main_~a_len~0 4294967296)))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {2551#(and (< 0 (mod main_~pat_len~0 4294967296)) (< 0 (mod main_~a_len~0 4294967296)))} is VALID [2018-11-23 11:55:50,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {2551#(and (< 0 (mod main_~pat_len~0 4294967296)) (< 0 (mod main_~a_len~0 4294967296)))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {2551#(and (< 0 (mod main_~pat_len~0 4294967296)) (< 0 (mod main_~a_len~0 4294967296)))} is VALID [2018-11-23 11:55:50,474 INFO L256 TraceCheckUtils]: 13: Hoare triple {2551#(and (< 0 (mod main_~pat_len~0 4294967296)) (< 0 (mod main_~a_len~0 4294967296)))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {2505#true} is VALID [2018-11-23 11:55:50,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {2505#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {2564#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:55:50,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {2564#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {2568#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:55:50,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {2568#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {2572#(or (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) 0))} is VALID [2018-11-23 11:55:50,478 INFO L273 TraceCheckUtils]: 17: Hoare triple {2572#(or (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) 0))} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {2572#(or (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) 0))} is VALID [2018-11-23 11:55:50,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {2572#(or (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) 0))} assume true; {2572#(or (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) 0))} is VALID [2018-11-23 11:55:50,481 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2572#(or (<= (mod |is_relaxed_prefix_#in~a_length| 4294967296) 0) (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) 0))} {2551#(and (< 0 (mod main_~pat_len~0 4294967296)) (< 0 (mod main_~a_len~0 4294967296)))} #160#return; {2506#false} is VALID [2018-11-23 11:55:50,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {2506#false} assume 0 != #t~ret14 % 256;havoc #t~ret14; {2506#false} is VALID [2018-11-23 11:55:50,482 INFO L256 TraceCheckUtils]: 21: Hoare triple {2506#false} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {2506#false} is VALID [2018-11-23 11:55:50,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {2506#false} ~cond := #in~cond; {2506#false} is VALID [2018-11-23 11:55:50,482 INFO L273 TraceCheckUtils]: 23: Hoare triple {2506#false} assume 0 == ~cond; {2506#false} is VALID [2018-11-23 11:55:50,482 INFO L273 TraceCheckUtils]: 24: Hoare triple {2506#false} assume !false; {2506#false} is VALID [2018-11-23 11:55:50,484 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-23 11:55:50,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:50,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-23 11:55:50,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-11-23 11:55:50,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:50,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:55:50,558 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-23 11:55:50,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:55:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:55:50,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:50,560 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand 17 states. [2018-11-23 11:55:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,277 INFO L93 Difference]: Finished difference Result 178 states and 256 transitions. [2018-11-23 11:55:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:55:55,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-11-23 11:55:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 241 transitions. [2018-11-23 11:55:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 241 transitions. [2018-11-23 11:55:55,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 241 transitions. [2018-11-23 11:55:55,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:55,711 INFO L225 Difference]: With dead ends: 178 [2018-11-23 11:55:55,711 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:55:55,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:55:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:55:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 88. [2018-11-23 11:55:55,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:55,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 88 states. [2018-11-23 11:55:55,856 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 88 states. [2018-11-23 11:55:55,856 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 88 states. [2018-11-23 11:55:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,863 INFO L93 Difference]: Finished difference Result 149 states and 210 transitions. [2018-11-23 11:55:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2018-11-23 11:55:55,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,864 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 149 states. [2018-11-23 11:55:55,864 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 149 states. [2018-11-23 11:55:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,871 INFO L93 Difference]: Finished difference Result 149 states and 210 transitions. [2018-11-23 11:55:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2018-11-23 11:55:55,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:55,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:55:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2018-11-23 11:55:55,876 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 25 [2018-11-23 11:55:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:55,877 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2018-11-23 11:55:55,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:55:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2018-11-23 11:55:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:55:55,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:55,878 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:55,878 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:55,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 382777314, now seen corresponding path program 2 times [2018-11-23 11:55:55,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:55,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:56,353 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 7 [2018-11-23 11:55:56,757 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 15 [2018-11-23 11:55:57,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {3278#true} call ULTIMATE.init(); {3278#true} is VALID [2018-11-23 11:55:57,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {3278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3278#true} is VALID [2018-11-23 11:55:57,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {3278#true} assume true; {3278#true} is VALID [2018-11-23 11:55:57,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3278#true} {3278#true} #156#return; {3278#true} is VALID [2018-11-23 11:55:57,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {3278#true} call #t~ret28 := main(); {3278#true} is VALID [2018-11-23 11:55:57,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {3278#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {3278#true} is VALID [2018-11-23 11:55:57,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {3278#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {3280#(<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 4294967294))} is VALID [2018-11-23 11:55:57,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {3280#(<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 4294967294))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3281#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ main_~j~0 (- 1)) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} is VALID [2018-11-23 11:55:57,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {3281#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ main_~j~0 (- 1)) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} is VALID [2018-11-23 11:55:57,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} is VALID [2018-11-23 11:55:57,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} is VALID [2018-11-23 11:55:57,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} ~j~1 := 0; {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} is VALID [2018-11-23 11:55:57,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} is VALID [2018-11-23 11:55:57,562 INFO L256 TraceCheckUtils]: 13: Hoare triple {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {3278#true} is VALID [2018-11-23 11:55:57,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {3278#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {3283#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} is VALID [2018-11-23 11:55:57,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {3283#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {3284#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0) (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) is_relaxed_prefix_~pat_length) (+ is_relaxed_prefix_~a_length (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)) 1)))} is VALID [2018-11-23 11:55:57,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {3284#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0) (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) is_relaxed_prefix_~pat_length) (+ is_relaxed_prefix_~a_length (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)) 1)))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {3285#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (or (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1)) (<= is_relaxed_prefix_~pat_length (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))))} is VALID [2018-11-23 11:55:57,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {3285#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (or (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1)) (<= is_relaxed_prefix_~pat_length (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))))} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {3286#(<= 0 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 1) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:55:57,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {3286#(<= 0 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 1) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} assume true; {3286#(<= 0 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 1) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:55:57,573 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3286#(<= 0 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 1) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} {3282#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* 4294967296 (div (+ (* (- 4294967296) (div main_~pat_len~0 4294967296)) (+ (* 4294967296 (div main_~j~0 4294967296)) (+ main_~pat_len~0 (- 2)))) 4294967296)) (* 4294967296 (div main_~pat_len~0 4294967296)) 4294967295))} #160#return; {3279#false} is VALID [2018-11-23 11:55:57,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {3279#false} assume 0 != #t~ret14 % 256;havoc #t~ret14; {3279#false} is VALID [2018-11-23 11:55:57,573 INFO L256 TraceCheckUtils]: 21: Hoare triple {3279#false} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {3279#false} is VALID [2018-11-23 11:55:57,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {3279#false} ~cond := #in~cond; {3279#false} is VALID [2018-11-23 11:55:57,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {3279#false} assume 0 == ~cond; {3279#false} is VALID [2018-11-23 11:55:57,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {3279#false} assume !false; {3279#false} is VALID [2018-11-23 11:55:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:57,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:57,577 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-23 11:55:57,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:57,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:55:57,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:57,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:58,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {3278#true} call ULTIMATE.init(); {3278#true} is VALID [2018-11-23 11:55:58,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {3278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3278#true} is VALID [2018-11-23 11:55:58,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {3278#true} assume true; {3278#true} is VALID [2018-11-23 11:55:58,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3278#true} {3278#true} #156#return; {3278#true} is VALID [2018-11-23 11:55:58,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {3278#true} call #t~ret28 := main(); {3278#true} is VALID [2018-11-23 11:55:58,018 INFO L273 TraceCheckUtils]: 5: Hoare triple {3278#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {3278#true} is VALID [2018-11-23 11:55:58,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {3278#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {3278#true} is VALID [2018-11-23 11:55:58,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {3278#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3278#true} is VALID [2018-11-23 11:55:58,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {3278#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {3278#true} is VALID [2018-11-23 11:55:58,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {3278#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3278#true} is VALID [2018-11-23 11:55:58,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {3278#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {3278#true} is VALID [2018-11-23 11:55:58,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {3278#true} ~j~1 := 0; {3278#true} is VALID [2018-11-23 11:55:58,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {3278#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {3278#true} is VALID [2018-11-23 11:55:58,020 INFO L256 TraceCheckUtils]: 13: Hoare triple {3278#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {3278#true} is VALID [2018-11-23 11:55:58,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {3278#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {3332#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:55:58,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {3332#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {3336#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-23 11:55:58,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {3336#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {3336#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-23 11:55:58,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {3336#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {3336#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-23 11:55:58,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {3336#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} assume true; {3336#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} is VALID [2018-11-23 11:55:58,024 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3336#(<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))} {3278#true} #160#return; {3349#(<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))} is VALID [2018-11-23 11:55:58,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {3349#(<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))} assume 0 != #t~ret14 % 256;havoc #t~ret14; {3349#(<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))} is VALID [2018-11-23 11:55:58,025 INFO L256 TraceCheckUtils]: 21: Hoare triple {3349#(<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {3356#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:55:58,026 INFO L273 TraceCheckUtils]: 22: Hoare triple {3356#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3360#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:55:58,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {3360#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3279#false} is VALID [2018-11-23 11:55:58,026 INFO L273 TraceCheckUtils]: 24: Hoare triple {3279#false} assume !false; {3279#false} is VALID [2018-11-23 11:55:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:55:58,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:55:58,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2018-11-23 11:55:58,057 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-11-23 11:55:58,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:58,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:58,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:58,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:58,164 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand 14 states. [2018-11-23 11:56:05,040 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 11:56:48,215 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:57:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:27,417 INFO L93 Difference]: Finished difference Result 131 states and 181 transitions. [2018-11-23 11:57:27,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:57:27,417 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-11-23 11:57:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:57:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 149 transitions. [2018-11-23 11:57:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:57:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 149 transitions. [2018-11-23 11:57:27,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 149 transitions. [2018-11-23 11:57:27,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:27,795 INFO L225 Difference]: With dead ends: 131 [2018-11-23 11:57:27,795 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:57:27,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=76, Invalid=384, Unknown=2, NotChecked=0, Total=462 [2018-11-23 11:57:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:57:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2018-11-23 11:57:28,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:28,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 88 states. [2018-11-23 11:57:28,355 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 88 states. [2018-11-23 11:57:28,355 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 88 states. [2018-11-23 11:57:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:28,361 INFO L93 Difference]: Finished difference Result 104 states and 143 transitions. [2018-11-23 11:57:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2018-11-23 11:57:28,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:28,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:28,362 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 104 states. [2018-11-23 11:57:28,362 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 104 states. [2018-11-23 11:57:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:28,367 INFO L93 Difference]: Finished difference Result 104 states and 143 transitions. [2018-11-23 11:57:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2018-11-23 11:57:28,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:28,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:28,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:28,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:57:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2018-11-23 11:57:28,371 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 25 [2018-11-23 11:57:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:28,372 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2018-11-23 11:57:28,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:57:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2018-11-23 11:57:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:57:28,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:28,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:28,373 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:28,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 823216944, now seen corresponding path program 1 times [2018-11-23 11:57:28,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:28,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:28,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:28,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:28,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:28,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {3881#true} call ULTIMATE.init(); {3881#true} is VALID [2018-11-23 11:57:28,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {3881#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3881#true} is VALID [2018-11-23 11:57:28,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {3881#true} assume true; {3881#true} is VALID [2018-11-23 11:57:28,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3881#true} {3881#true} #156#return; {3881#true} is VALID [2018-11-23 11:57:28,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {3881#true} call #t~ret28 := main(); {3881#true} is VALID [2018-11-23 11:57:28,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {3881#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {3881#true} is VALID [2018-11-23 11:57:28,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {3881#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {3881#true} is VALID [2018-11-23 11:57:28,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {3881#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3881#true} is VALID [2018-11-23 11:57:28,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {3881#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {3881#true} is VALID [2018-11-23 11:57:28,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {3881#true} ~j~1 := 0; {3881#true} is VALID [2018-11-23 11:57:28,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {3881#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {3881#true} is VALID [2018-11-23 11:57:28,608 INFO L256 TraceCheckUtils]: 11: Hoare triple {3881#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {3881#true} is VALID [2018-11-23 11:57:28,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {3881#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {3881#true} is VALID [2018-11-23 11:57:28,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {3881#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {3883#(= 0 is_relaxed_prefix_~shift~0)} is VALID [2018-11-23 11:57:28,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {3883#(= 0 is_relaxed_prefix_~shift~0)} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {3883#(= 0 is_relaxed_prefix_~shift~0)} is VALID [2018-11-23 11:57:28,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {3883#(= 0 is_relaxed_prefix_~shift~0)} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {3882#false} is VALID [2018-11-23 11:57:28,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {3882#false} assume true; {3882#false} is VALID [2018-11-23 11:57:28,648 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3882#false} {3881#true} #160#return; {3882#false} is VALID [2018-11-23 11:57:28,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {3882#false} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {3882#false} is VALID [2018-11-23 11:57:28,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {3882#false} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {3882#false} is VALID [2018-11-23 11:57:28,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {3882#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {3882#false} is VALID [2018-11-23 11:57:28,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {3882#false} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {3882#false} is VALID [2018-11-23 11:57:28,653 INFO L256 TraceCheckUtils]: 22: Hoare triple {3882#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {3882#false} is VALID [2018-11-23 11:57:28,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {3882#false} ~cond := #in~cond; {3882#false} is VALID [2018-11-23 11:57:28,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {3882#false} assume 0 == ~cond; {3882#false} is VALID [2018-11-23 11:57:28,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {3882#false} assume !false; {3882#false} is VALID [2018-11-23 11:57:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:57:28,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:57:28,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:57:28,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 11:57:28,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:28,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:57:28,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:28,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:57:28,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:57:28,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:57:28,993 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand 3 states. [2018-11-23 11:57:29,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:29,380 INFO L93 Difference]: Finished difference Result 120 states and 159 transitions. [2018-11-23 11:57:29,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:57:29,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 11:57:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:57:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:57:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:57:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 11:57:29,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 11:57:29,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:29,515 INFO L225 Difference]: With dead ends: 120 [2018-11-23 11:57:29,515 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:57:29,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:57:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:57:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-23 11:57:29,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:29,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-23 11:57:29,726 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-23 11:57:29,726 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-23 11:57:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:29,730 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2018-11-23 11:57:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2018-11-23 11:57:29,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:29,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:29,731 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-23 11:57:29,731 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-23 11:57:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:29,734 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2018-11-23 11:57:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2018-11-23 11:57:29,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:29,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:29,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:29,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:57:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2018-11-23 11:57:29,737 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 26 [2018-11-23 11:57:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:29,738 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2018-11-23 11:57:29,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:57:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2018-11-23 11:57:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:57:29,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:29,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:29,739 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:29,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1400385991, now seen corresponding path program 1 times [2018-11-23 11:57:29,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:29,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:29,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:29,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:29,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:30,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {4347#true} call ULTIMATE.init(); {4347#true} is VALID [2018-11-23 11:57:30,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {4347#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4347#true} is VALID [2018-11-23 11:57:30,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {4347#true} assume true; {4347#true} is VALID [2018-11-23 11:57:30,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4347#true} {4347#true} #156#return; {4347#true} is VALID [2018-11-23 11:57:30,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {4347#true} call #t~ret28 := main(); {4347#true} is VALID [2018-11-23 11:57:30,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {4347#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {4347#true} is VALID [2018-11-23 11:57:30,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {4347#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} is VALID [2018-11-23 11:57:30,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} is VALID [2018-11-23 11:57:30,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} is VALID [2018-11-23 11:57:30,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} ~j~1 := 0; {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} is VALID [2018-11-23 11:57:30,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} is VALID [2018-11-23 11:57:30,057 INFO L256 TraceCheckUtils]: 11: Hoare triple {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {4347#true} is VALID [2018-11-23 11:57:30,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {4347#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {4350#(= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|)} is VALID [2018-11-23 11:57:30,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {4350#(= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|)} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {4351#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) is_relaxed_prefix_~pat_length) (+ is_relaxed_prefix_~a_length (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)) 1)) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} is VALID [2018-11-23 11:57:30,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {4351#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) is_relaxed_prefix_~pat_length) (+ is_relaxed_prefix_~a_length (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)) 1)) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} is VALID [2018-11-23 11:57:30,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} is VALID [2018-11-23 11:57:30,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} assume 0 == ~shift~0;~shift~0 := 1; {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} is VALID [2018-11-23 11:57:30,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} is VALID [2018-11-23 11:57:30,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} is VALID [2018-11-23 11:57:30,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {4352#(and (<= (+ (* 4294967296 (div (+ is_relaxed_prefix_~a_length 1) 4294967296)) (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) is_relaxed_prefix_~pat_length) (+ (* 2 is_relaxed_prefix_~a_length) (* 4294967296 (div is_relaxed_prefix_~pat_length 4294967296)))) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {4353#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~a_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~a_length|) 4294967294)} is VALID [2018-11-23 11:57:30,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {4353#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~a_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~a_length|) 4294967294)} assume true; {4353#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~a_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~a_length|) 4294967294)} is VALID [2018-11-23 11:57:30,072 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4353#(<= (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~a_length|) 4294967296) 4294967296)) |is_relaxed_prefix_#in~a_length|) 4294967294)} {4349#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0)} #160#return; {4354#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} is VALID [2018-11-23 11:57:30,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {4354#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {4354#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} is VALID [2018-11-23 11:57:30,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {4354#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {4355#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0) (= main_~i~2 0))} is VALID [2018-11-23 11:57:30,098 INFO L273 TraceCheckUtils]: 24: Hoare triple {4355#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0) (= main_~i~2 0))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {4348#false} is VALID [2018-11-23 11:57:30,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {4348#false} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {4348#false} is VALID [2018-11-23 11:57:30,098 INFO L256 TraceCheckUtils]: 26: Hoare triple {4348#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {4348#false} is VALID [2018-11-23 11:57:30,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {4348#false} ~cond := #in~cond; {4348#false} is VALID [2018-11-23 11:57:30,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {4348#false} assume 0 == ~cond; {4348#false} is VALID [2018-11-23 11:57:30,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {4348#false} assume !false; {4348#false} is VALID [2018-11-23 11:57:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:57:30,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:30,102 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-23 11:57:30,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:30,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:30,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {4347#true} call ULTIMATE.init(); {4347#true} is VALID [2018-11-23 11:57:30,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {4347#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4347#true} is VALID [2018-11-23 11:57:30,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {4347#true} assume true; {4347#true} is VALID [2018-11-23 11:57:30,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4347#true} {4347#true} #156#return; {4347#true} is VALID [2018-11-23 11:57:30,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {4347#true} call #t~ret28 := main(); {4347#true} is VALID [2018-11-23 11:57:30,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {4347#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {4347#true} is VALID [2018-11-23 11:57:30,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {4347#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {4347#true} is VALID [2018-11-23 11:57:30,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {4347#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {4347#true} is VALID [2018-11-23 11:57:30,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {4347#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {4347#true} is VALID [2018-11-23 11:57:30,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {4347#true} ~j~1 := 0; {4386#(= main_~j~1 0)} is VALID [2018-11-23 11:57:30,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {4386#(= main_~j~1 0)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {4390#(<= (mod main_~a_len~0 4294967296) 0)} is VALID [2018-11-23 11:57:30,535 INFO L256 TraceCheckUtils]: 11: Hoare triple {4390#(<= (mod main_~a_len~0 4294967296) 0)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {4347#true} is VALID [2018-11-23 11:57:30,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {4347#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {4350#(= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|)} is VALID [2018-11-23 11:57:30,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {4350#(= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|)} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {4400#(and (= 0 is_relaxed_prefix_~i~0) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} is VALID [2018-11-23 11:57:30,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {4400#(and (= 0 is_relaxed_prefix_~i~0) (= is_relaxed_prefix_~a_length |is_relaxed_prefix_#in~a_length|))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:30,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:30,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} assume 0 == ~shift~0;~shift~0 := 1; {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:30,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:30,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:30,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:30,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} assume true; {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:30,553 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4404#(< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} {4390#(<= (mod main_~a_len~0 4294967296) 0)} #160#return; {4348#false} is VALID [2018-11-23 11:57:30,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {4348#false} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {4348#false} is VALID [2018-11-23 11:57:30,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {4348#false} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {4348#false} is VALID [2018-11-23 11:57:30,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {4348#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {4348#false} is VALID [2018-11-23 11:57:30,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {4348#false} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {4348#false} is VALID [2018-11-23 11:57:30,554 INFO L256 TraceCheckUtils]: 26: Hoare triple {4348#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {4348#false} is VALID [2018-11-23 11:57:30,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {4348#false} ~cond := #in~cond; {4348#false} is VALID [2018-11-23 11:57:30,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {4348#false} assume 0 == ~cond; {4348#false} is VALID [2018-11-23 11:57:30,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {4348#false} assume !false; {4348#false} is VALID [2018-11-23 11:57:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:57:30,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:30,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-23 11:57:30,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 11:57:30,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:30,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:57:30,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:30,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:57:30,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:57:30,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:57:30,658 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand 13 states. [2018-11-23 11:57:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:33,725 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2018-11-23 11:57:33,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:57:33,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 11:57:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:57:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 112 transitions. [2018-11-23 11:57:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:57:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 112 transitions. [2018-11-23 11:57:33,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 112 transitions. [2018-11-23 11:57:33,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:33,905 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:57:33,905 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 11:57:33,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:57:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 11:57:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2018-11-23 11:57:34,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:34,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 88 states. [2018-11-23 11:57:34,484 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 88 states. [2018-11-23 11:57:34,484 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 88 states. [2018-11-23 11:57:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:34,488 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2018-11-23 11:57:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 11:57:34,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:34,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:34,489 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 97 states. [2018-11-23 11:57:34,490 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 97 states. [2018-11-23 11:57:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:34,493 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2018-11-23 11:57:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 11:57:34,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:34,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:34,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:34,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:57:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2018-11-23 11:57:34,498 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 30 [2018-11-23 11:57:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:34,498 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2018-11-23 11:57:34,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:57:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2018-11-23 11:57:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:57:34,499 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:34,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:34,500 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:34,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash 358399516, now seen corresponding path program 1 times [2018-11-23 11:57:34,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:34,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:34,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:34,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {4959#true} call ULTIMATE.init(); {4959#true} is VALID [2018-11-23 11:57:34,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {4959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4959#true} is VALID [2018-11-23 11:57:34,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {4959#true} assume true; {4959#true} is VALID [2018-11-23 11:57:34,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4959#true} {4959#true} #156#return; {4959#true} is VALID [2018-11-23 11:57:34,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {4959#true} call #t~ret28 := main(); {4959#true} is VALID [2018-11-23 11:57:34,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {4959#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {4961#(= main_~j~0 0)} is VALID [2018-11-23 11:57:34,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {4961#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {4962#(and (= main_~j~0 0) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:34,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {4962#(and (= main_~j~0 0) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {4963#(and (<= main_~j~0 1) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (< 0 (+ (div main_~j~0 4294967296) 1)))} is VALID [2018-11-23 11:57:34,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {4963#(and (<= main_~j~0 1) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0) (< 0 (+ (div main_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:34,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} ~j~1 := 0; {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:34,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:34,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:34,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:34,966 INFO L256 TraceCheckUtils]: 13: Hoare triple {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {4959#true} is VALID [2018-11-23 11:57:34,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {4959#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {4965#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} is VALID [2018-11-23 11:57:34,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {4965#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {4965#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} is VALID [2018-11-23 11:57:34,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {4965#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:34,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:34,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} assume 0 == ~shift~0;~shift~0 := 1; {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:34,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:34,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:34,974 INFO L273 TraceCheckUtils]: 21: Hoare triple {4966#(and (<= (+ (* 4294967296 (div is_relaxed_prefix_~a_length 4294967296)) 1) is_relaxed_prefix_~a_length) (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|))} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {4967#(<= (+ |is_relaxed_prefix_#in~pat_length| (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967297) 4294967296))) 4294967295)} is VALID [2018-11-23 11:57:34,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {4967#(<= (+ |is_relaxed_prefix_#in~pat_length| (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967297) 4294967296))) 4294967295)} assume true; {4967#(<= (+ |is_relaxed_prefix_#in~pat_length| (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967297) 4294967296))) 4294967295)} is VALID [2018-11-23 11:57:34,984 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {4967#(<= (+ |is_relaxed_prefix_#in~pat_length| (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967297) 4294967296))) 4294967295)} {4964#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} #160#return; {4960#false} is VALID [2018-11-23 11:57:34,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {4960#false} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {4960#false} is VALID [2018-11-23 11:57:34,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {4960#false} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {4960#false} is VALID [2018-11-23 11:57:34,984 INFO L273 TraceCheckUtils]: 26: Hoare triple {4960#false} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {4960#false} is VALID [2018-11-23 11:57:34,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {4960#false} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {4960#false} is VALID [2018-11-23 11:57:34,985 INFO L273 TraceCheckUtils]: 28: Hoare triple {4960#false} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {4960#false} is VALID [2018-11-23 11:57:34,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {4960#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {4960#false} is VALID [2018-11-23 11:57:34,985 INFO L273 TraceCheckUtils]: 30: Hoare triple {4960#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {4960#false} is VALID [2018-11-23 11:57:34,986 INFO L256 TraceCheckUtils]: 31: Hoare triple {4960#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {4960#false} is VALID [2018-11-23 11:57:34,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {4960#false} ~cond := #in~cond; {4960#false} is VALID [2018-11-23 11:57:34,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {4960#false} assume 0 == ~cond; {4960#false} is VALID [2018-11-23 11:57:34,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {4960#false} assume !false; {4960#false} is VALID [2018-11-23 11:57:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:57:34,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:34,989 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-23 11:57:34,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:35,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:35,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {4959#true} call ULTIMATE.init(); {4959#true} is VALID [2018-11-23 11:57:35,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {4959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4959#true} is VALID [2018-11-23 11:57:35,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {4959#true} assume true; {4959#true} is VALID [2018-11-23 11:57:35,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4959#true} {4959#true} #156#return; {4959#true} is VALID [2018-11-23 11:57:35,182 INFO L256 TraceCheckUtils]: 4: Hoare triple {4959#true} call #t~ret28 := main(); {4959#true} is VALID [2018-11-23 11:57:35,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {4959#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {4959#true} is VALID [2018-11-23 11:57:35,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {4959#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {4959#true} is VALID [2018-11-23 11:57:35,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {4959#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {4959#true} is VALID [2018-11-23 11:57:35,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {4959#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {4959#true} is VALID [2018-11-23 11:57:35,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {4959#true} ~j~1 := 0; {4959#true} is VALID [2018-11-23 11:57:35,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {4959#true} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {4959#true} is VALID [2018-11-23 11:57:35,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {4959#true} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {4959#true} is VALID [2018-11-23 11:57:35,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {4959#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {4959#true} is VALID [2018-11-23 11:57:35,184 INFO L256 TraceCheckUtils]: 13: Hoare triple {4959#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {4959#true} is VALID [2018-11-23 11:57:35,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {4959#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:57:35,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:57:35,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:57:35,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:57:35,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume 0 == ~shift~0;~shift~0 := 1; {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:57:35,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:57:35,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} is VALID [2018-11-23 11:57:35,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {5013#(and (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length))} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {5035#(< (mod |is_relaxed_prefix_#in~a_length| 4294967296) (mod |is_relaxed_prefix_#in~pat_length| 4294967296))} is VALID [2018-11-23 11:57:35,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {5035#(< (mod |is_relaxed_prefix_#in~a_length| 4294967296) (mod |is_relaxed_prefix_#in~pat_length| 4294967296))} assume true; {5035#(< (mod |is_relaxed_prefix_#in~a_length| 4294967296) (mod |is_relaxed_prefix_#in~pat_length| 4294967296))} is VALID [2018-11-23 11:57:35,191 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {5035#(< (mod |is_relaxed_prefix_#in~a_length| 4294967296) (mod |is_relaxed_prefix_#in~pat_length| 4294967296))} {4959#true} #160#return; {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:57:35,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:57:35,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:57:35,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:57:35,197 INFO L273 TraceCheckUtils]: 27: Hoare triple {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:57:35,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:57:35,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:57:35,199 INFO L273 TraceCheckUtils]: 30: Hoare triple {5042#(< (mod main_~a_len~0 4294967296) (mod main_~pat_len~0 4294967296))} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {4960#false} is VALID [2018-11-23 11:57:35,200 INFO L256 TraceCheckUtils]: 31: Hoare triple {4960#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {4960#false} is VALID [2018-11-23 11:57:35,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {4960#false} ~cond := #in~cond; {4960#false} is VALID [2018-11-23 11:57:35,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {4960#false} assume 0 == ~cond; {4960#false} is VALID [2018-11-23 11:57:35,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {4960#false} assume !false; {4960#false} is VALID [2018-11-23 11:57:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:57:35,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:57:35,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2018-11-23 11:57:35,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 11:57:35,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:35,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:57:35,299 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-23 11:57:35,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:57:35,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:57:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:57:35,300 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand 12 states. [2018-11-23 11:57:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:37,582 INFO L93 Difference]: Finished difference Result 130 states and 169 transitions. [2018-11-23 11:57:37,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:57:37,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 11:57:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:57:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2018-11-23 11:57:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:57:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2018-11-23 11:57:37,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 137 transitions. [2018-11-23 11:57:37,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:37,761 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:57:37,761 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 11:57:37,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:57:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 11:57:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-11-23 11:57:38,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:38,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 97 states. [2018-11-23 11:57:38,086 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 97 states. [2018-11-23 11:57:38,086 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 97 states. [2018-11-23 11:57:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:38,089 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2018-11-23 11:57:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2018-11-23 11:57:38,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:38,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:38,090 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 116 states. [2018-11-23 11:57:38,090 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 116 states. [2018-11-23 11:57:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:38,094 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2018-11-23 11:57:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2018-11-23 11:57:38,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:38,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:38,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:38,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 11:57:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2018-11-23 11:57:38,097 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 35 [2018-11-23 11:57:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:38,098 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2018-11-23 11:57:38,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:57:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2018-11-23 11:57:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:57:38,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:38,099 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:38,099 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:38,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1098381265, now seen corresponding path program 1 times [2018-11-23 11:57:38,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:38,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:39,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 11:57:39,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 11:57:39,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 11:57:39,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #156#return; {5619#true} is VALID [2018-11-23 11:57:39,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret28 := main(); {5619#true} is VALID [2018-11-23 11:57:39,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {5621#(= main_~j~0 0)} is VALID [2018-11-23 11:57:39,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {5621#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {5622#(and (= main_~j~0 0) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:39,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {5622#(and (= main_~j~0 0) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {5623#(and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:39,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {5623#(and (<= main_~j~0 1) (<= 1 main_~j~0) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:39,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} ~j~1 := 0; {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:39,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:39,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:39,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} is VALID [2018-11-23 11:57:39,066 INFO L256 TraceCheckUtils]: 13: Hoare triple {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {5619#true} is VALID [2018-11-23 11:57:39,067 INFO L273 TraceCheckUtils]: 14: Hoare triple {5619#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {5625#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} is VALID [2018-11-23 11:57:39,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {5625#(= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|)} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {5626#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0))} is VALID [2018-11-23 11:57:39,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {5626#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {5626#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0))} is VALID [2018-11-23 11:57:39,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {5626#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {5626#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0))} is VALID [2018-11-23 11:57:39,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {5626#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0))} assume 0 == ~shift~0;~shift~0 := 1; {5626#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0))} is VALID [2018-11-23 11:57:39,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {5626#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (= is_relaxed_prefix_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5627#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (<= (+ (* 4294967296 (div is_relaxed_prefix_~i~0 4294967296)) 1) is_relaxed_prefix_~i~0))} is VALID [2018-11-23 11:57:39,073 INFO L273 TraceCheckUtils]: 20: Hoare triple {5627#(and (= is_relaxed_prefix_~pat_length |is_relaxed_prefix_#in~pat_length|) (<= (+ (* 4294967296 (div is_relaxed_prefix_~i~0 4294967296)) 1) is_relaxed_prefix_~i~0))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {5628#(<= 2 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:39,073 INFO L273 TraceCheckUtils]: 21: Hoare triple {5628#(<= 2 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {5628#(<= 2 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:39,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {5628#(<= 2 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} assume !(0 == ~shift~0);#res := 0; {5628#(<= 2 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:39,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {5628#(<= 2 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} assume true; {5628#(<= 2 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} is VALID [2018-11-23 11:57:39,076 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {5628#(<= 2 (+ (* 4294967296 (div (+ (- |is_relaxed_prefix_#in~pat_length|) 4294967295) 4294967296)) |is_relaxed_prefix_#in~pat_length|))} {5624#(and (<= main_~pat_len~0 (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1)) (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 1) main_~pat_len~0))} #160#return; {5620#false} is VALID [2018-11-23 11:57:39,077 INFO L273 TraceCheckUtils]: 25: Hoare triple {5620#false} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {5620#false} is VALID [2018-11-23 11:57:39,077 INFO L273 TraceCheckUtils]: 26: Hoare triple {5620#false} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {5620#false} is VALID [2018-11-23 11:57:39,077 INFO L273 TraceCheckUtils]: 27: Hoare triple {5620#false} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {5620#false} is VALID [2018-11-23 11:57:39,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {5620#false} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {5620#false} is VALID [2018-11-23 11:57:39,078 INFO L273 TraceCheckUtils]: 29: Hoare triple {5620#false} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {5620#false} is VALID [2018-11-23 11:57:39,078 INFO L273 TraceCheckUtils]: 30: Hoare triple {5620#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {5620#false} is VALID [2018-11-23 11:57:39,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {5620#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {5620#false} is VALID [2018-11-23 11:57:39,079 INFO L256 TraceCheckUtils]: 32: Hoare triple {5620#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {5620#false} is VALID [2018-11-23 11:57:39,079 INFO L273 TraceCheckUtils]: 33: Hoare triple {5620#false} ~cond := #in~cond; {5620#false} is VALID [2018-11-23 11:57:39,079 INFO L273 TraceCheckUtils]: 34: Hoare triple {5620#false} assume 0 == ~cond; {5620#false} is VALID [2018-11-23 11:57:39,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 11:57:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:57:39,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:39,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:39,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:39,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:39,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 11:57:39,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 11:57:39,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 11:57:39,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #156#return; {5619#true} is VALID [2018-11-23 11:57:39,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret28 := main(); {5619#true} is VALID [2018-11-23 11:57:39,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {5621#(= main_~j~0 0)} is VALID [2018-11-23 11:57:39,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {5621#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {5621#(= main_~j~0 0)} is VALID [2018-11-23 11:57:39,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {5621#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {5619#true} is VALID [2018-11-23 11:57:39,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {5619#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {5619#true} is VALID [2018-11-23 11:57:39,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {5619#true} ~j~1 := 0; {5659#(= main_~j~1 0)} is VALID [2018-11-23 11:57:39,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {5659#(= main_~j~1 0)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {5659#(= main_~j~1 0)} is VALID [2018-11-23 11:57:39,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {5659#(= main_~j~1 0)} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {5666#(= main_~j~1 1)} is VALID [2018-11-23 11:57:39,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {5666#(= main_~j~1 1)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {5670#(<= (mod main_~a_len~0 4294967296) 1)} is VALID [2018-11-23 11:57:39,292 INFO L256 TraceCheckUtils]: 13: Hoare triple {5670#(<= (mod main_~a_len~0 4294967296) 1)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {5619#true} is VALID [2018-11-23 11:57:39,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {5619#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {5677#(= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length)} is VALID [2018-11-23 11:57:39,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {5677#(= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length)} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {5681#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} is VALID [2018-11-23 11:57:39,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {5681#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {5681#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} is VALID [2018-11-23 11:57:39,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {5681#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {5681#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} is VALID [2018-11-23 11:57:39,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {5681#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} assume 0 == ~shift~0;~shift~0 := 1; {5681#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} is VALID [2018-11-23 11:57:39,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {5681#(and (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5694#(and (= 1 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} is VALID [2018-11-23 11:57:39,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {5694#(and (= 1 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {5698#(< 1 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:39,298 INFO L273 TraceCheckUtils]: 21: Hoare triple {5698#(< 1 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {5698#(< 1 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:39,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {5698#(< 1 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} assume !(0 == ~shift~0);#res := 0; {5698#(< 1 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:39,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {5698#(< 1 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} assume true; {5698#(< 1 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} is VALID [2018-11-23 11:57:39,301 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {5698#(< 1 (mod |is_relaxed_prefix_#in~a_length| 4294967296))} {5670#(<= (mod main_~a_len~0 4294967296) 1)} #160#return; {5620#false} is VALID [2018-11-23 11:57:39,302 INFO L273 TraceCheckUtils]: 25: Hoare triple {5620#false} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {5620#false} is VALID [2018-11-23 11:57:39,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {5620#false} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {5620#false} is VALID [2018-11-23 11:57:39,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {5620#false} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {5620#false} is VALID [2018-11-23 11:57:39,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {5620#false} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {5620#false} is VALID [2018-11-23 11:57:39,303 INFO L273 TraceCheckUtils]: 29: Hoare triple {5620#false} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {5620#false} is VALID [2018-11-23 11:57:39,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {5620#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {5620#false} is VALID [2018-11-23 11:57:39,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {5620#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {5620#false} is VALID [2018-11-23 11:57:39,303 INFO L256 TraceCheckUtils]: 32: Hoare triple {5620#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {5620#false} is VALID [2018-11-23 11:57:39,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {5620#false} ~cond := #in~cond; {5620#false} is VALID [2018-11-23 11:57:39,304 INFO L273 TraceCheckUtils]: 34: Hoare triple {5620#false} assume 0 == ~cond; {5620#false} is VALID [2018-11-23 11:57:39,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 11:57:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:57:39,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:39,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 11:57:39,330 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 11:57:39,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:39,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:57:39,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:39,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:57:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:57:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:39,392 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand 17 states. [2018-11-23 11:57:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:42,727 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2018-11-23 11:57:42,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:57:42,728 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 11:57:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 215 transitions. [2018-11-23 11:57:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 215 transitions. [2018-11-23 11:57:42,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 215 transitions. [2018-11-23 11:57:43,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:43,604 INFO L225 Difference]: With dead ends: 218 [2018-11-23 11:57:43,604 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 11:57:43,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:57:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 11:57:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 105. [2018-11-23 11:57:43,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:43,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 105 states. [2018-11-23 11:57:43,840 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 105 states. [2018-11-23 11:57:43,841 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 105 states. [2018-11-23 11:57:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:43,846 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2018-11-23 11:57:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2018-11-23 11:57:43,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:43,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:43,847 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 164 states. [2018-11-23 11:57:43,847 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 164 states. [2018-11-23 11:57:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:43,852 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2018-11-23 11:57:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2018-11-23 11:57:43,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:43,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:43,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:43,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:57:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 11:57:43,857 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 36 [2018-11-23 11:57:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:43,857 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 11:57:43,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:57:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 11:57:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:57:43,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:43,858 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:43,858 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:43,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:43,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1294050072, now seen corresponding path program 1 times [2018-11-23 11:57:43,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:43,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:43,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:43,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:43,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:44,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {6516#true} call ULTIMATE.init(); {6516#true} is VALID [2018-11-23 11:57:44,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {6516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6516#true} is VALID [2018-11-23 11:57:44,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {6516#true} assume true; {6516#true} is VALID [2018-11-23 11:57:44,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6516#true} {6516#true} #156#return; {6516#true} is VALID [2018-11-23 11:57:44,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {6516#true} call #t~ret28 := main(); {6516#true} is VALID [2018-11-23 11:57:44,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {6516#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {6516#true} is VALID [2018-11-23 11:57:44,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {6516#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {6516#true} is VALID [2018-11-23 11:57:44,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {6516#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {6516#true} is VALID [2018-11-23 11:57:44,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {6516#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {6516#true} is VALID [2018-11-23 11:57:44,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {6516#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {6516#true} is VALID [2018-11-23 11:57:44,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {6516#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {6516#true} is VALID [2018-11-23 11:57:44,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {6516#true} ~j~1 := 0; {6516#true} is VALID [2018-11-23 11:57:44,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {6516#true} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {6516#true} is VALID [2018-11-23 11:57:44,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {6516#true} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {6516#true} is VALID [2018-11-23 11:57:44,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {6516#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {6516#true} is VALID [2018-11-23 11:57:44,401 INFO L256 TraceCheckUtils]: 15: Hoare triple {6516#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {6516#true} is VALID [2018-11-23 11:57:44,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {6516#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {6516#true} is VALID [2018-11-23 11:57:44,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {6516#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {6516#true} is VALID [2018-11-23 11:57:44,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {6516#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {6516#true} is VALID [2018-11-23 11:57:44,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {6516#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {6516#true} is VALID [2018-11-23 11:57:44,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {6516#true} assume 0 == ~shift~0;~shift~0 := 1; {6516#true} is VALID [2018-11-23 11:57:44,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {6516#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6516#true} is VALID [2018-11-23 11:57:44,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {6516#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {6516#true} is VALID [2018-11-23 11:57:44,402 INFO L273 TraceCheckUtils]: 23: Hoare triple {6516#true} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {6516#true} is VALID [2018-11-23 11:57:44,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {6516#true} assume true; {6516#true} is VALID [2018-11-23 11:57:44,403 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {6516#true} {6516#true} #160#return; {6516#true} is VALID [2018-11-23 11:57:44,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {6516#true} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {6516#true} is VALID [2018-11-23 11:57:44,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {6516#true} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {6518#(= main_~differences~0 0)} is VALID [2018-11-23 11:57:44,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {6518#(= main_~differences~0 0)} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {6518#(= main_~differences~0 0)} is VALID [2018-11-23 11:57:44,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {6518#(= main_~differences~0 0)} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {6519#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} is VALID [2018-11-23 11:57:44,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {6519#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {6519#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} is VALID [2018-11-23 11:57:44,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {6519#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {6519#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} is VALID [2018-11-23 11:57:44,417 INFO L273 TraceCheckUtils]: 32: Hoare triple {6519#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {6520#(and (<= (div main_~differences~0 4294967296) 0) (<= 2 main_~differences~0))} is VALID [2018-11-23 11:57:44,418 INFO L256 TraceCheckUtils]: 33: Hoare triple {6520#(and (<= (div main_~differences~0 4294967296) 0) (<= 2 main_~differences~0))} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {6521#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:57:44,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {6521#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6522#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:57:44,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {6522#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {6517#false} is VALID [2018-11-23 11:57:44,419 INFO L273 TraceCheckUtils]: 36: Hoare triple {6517#false} assume !false; {6517#false} is VALID [2018-11-23 11:57:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:57:44,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:44,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:44,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:44,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:44,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {6516#true} call ULTIMATE.init(); {6516#true} is VALID [2018-11-23 11:57:44,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {6516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6516#true} is VALID [2018-11-23 11:57:44,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {6516#true} assume true; {6516#true} is VALID [2018-11-23 11:57:44,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6516#true} {6516#true} #156#return; {6516#true} is VALID [2018-11-23 11:57:44,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {6516#true} call #t~ret28 := main(); {6516#true} is VALID [2018-11-23 11:57:44,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {6516#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {6541#(= main_~j~0 0)} is VALID [2018-11-23 11:57:44,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {6541#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {6541#(= main_~j~0 0)} is VALID [2018-11-23 11:57:44,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {6541#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {6548#(= main_~j~0 1)} is VALID [2018-11-23 11:57:44,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {6548#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {6548#(= main_~j~0 1)} is VALID [2018-11-23 11:57:44,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {6548#(= main_~j~0 1)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {6555#(= main_~j~0 2)} is VALID [2018-11-23 11:57:44,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {6555#(= main_~j~0 2)} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {6559#(<= (mod main_~pat_len~0 4294967296) 2)} is VALID [2018-11-23 11:57:44,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {6559#(<= (mod main_~pat_len~0 4294967296) 2)} ~j~1 := 0; {6559#(<= (mod main_~pat_len~0 4294967296) 2)} is VALID [2018-11-23 11:57:44,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {6559#(<= (mod main_~pat_len~0 4294967296) 2)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} is VALID [2018-11-23 11:57:44,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} is VALID [2018-11-23 11:57:44,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} is VALID [2018-11-23 11:57:44,782 INFO L256 TraceCheckUtils]: 15: Hoare triple {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {6516#true} is VALID [2018-11-23 11:57:44,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {6516#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {6516#true} is VALID [2018-11-23 11:57:44,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {6516#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {6516#true} is VALID [2018-11-23 11:57:44,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {6516#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {6516#true} is VALID [2018-11-23 11:57:44,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {6516#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {6516#true} is VALID [2018-11-23 11:57:44,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {6516#true} assume 0 == ~shift~0;~shift~0 := 1; {6516#true} is VALID [2018-11-23 11:57:44,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {6516#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6516#true} is VALID [2018-11-23 11:57:44,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {6516#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {6516#true} is VALID [2018-11-23 11:57:44,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {6516#true} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {6516#true} is VALID [2018-11-23 11:57:44,784 INFO L273 TraceCheckUtils]: 24: Hoare triple {6516#true} assume true; {6516#true} is VALID [2018-11-23 11:57:44,785 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {6516#true} {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} #160#return; {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} is VALID [2018-11-23 11:57:44,786 INFO L273 TraceCheckUtils]: 26: Hoare triple {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} is VALID [2018-11-23 11:57:44,787 INFO L273 TraceCheckUtils]: 27: Hoare triple {6566#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {6612#(and (= main_~differences~0 0) (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} is VALID [2018-11-23 11:57:44,787 INFO L273 TraceCheckUtils]: 28: Hoare triple {6612#(and (= main_~differences~0 0) (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {6612#(and (= main_~differences~0 0) (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} is VALID [2018-11-23 11:57:44,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {6612#(and (= main_~differences~0 0) (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2))} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {6619#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2) (= main_~differences~0 1))} is VALID [2018-11-23 11:57:44,789 INFO L273 TraceCheckUtils]: 30: Hoare triple {6619#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2) (= main_~differences~0 1))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {6619#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2) (= main_~differences~0 1))} is VALID [2018-11-23 11:57:44,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {6619#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2) (= main_~differences~0 1))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {6619#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2) (= main_~differences~0 1))} is VALID [2018-11-23 11:57:44,791 INFO L273 TraceCheckUtils]: 32: Hoare triple {6619#(and (exists ((main_~j~1 Int)) (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296))) (<= (mod main_~pat_len~0 4294967296) 2) (= main_~differences~0 1))} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {6629#(= main_~differences~0 2)} is VALID [2018-11-23 11:57:44,791 INFO L256 TraceCheckUtils]: 33: Hoare triple {6629#(= main_~differences~0 2)} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {6521#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:57:44,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {6521#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {6522#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:57:44,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {6522#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {6517#false} is VALID [2018-11-23 11:57:44,794 INFO L273 TraceCheckUtils]: 36: Hoare triple {6517#false} assume !false; {6517#false} is VALID [2018-11-23 11:57:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:57:44,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:44,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 15 [2018-11-23 11:57:44,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 11:57:44,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:44,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:57:44,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:44,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:57:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:57:44,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:57:44,902 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 15 states. [2018-11-23 11:57:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:50,032 INFO L93 Difference]: Finished difference Result 182 states and 247 transitions. [2018-11-23 11:57:50,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:57:50,032 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 11:57:50,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:57:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2018-11-23 11:57:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:57:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2018-11-23 11:57:50,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 154 transitions. [2018-11-23 11:57:50,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:50,905 INFO L225 Difference]: With dead ends: 182 [2018-11-23 11:57:50,905 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 11:57:50,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:57:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 11:57:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-11-23 11:57:51,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:51,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 116 states. [2018-11-23 11:57:51,340 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 116 states. [2018-11-23 11:57:51,340 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 116 states. [2018-11-23 11:57:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:51,348 INFO L93 Difference]: Finished difference Result 172 states and 234 transitions. [2018-11-23 11:57:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2018-11-23 11:57:51,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:51,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:51,350 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 172 states. [2018-11-23 11:57:51,350 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 172 states. [2018-11-23 11:57:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:51,356 INFO L93 Difference]: Finished difference Result 172 states and 234 transitions. [2018-11-23 11:57:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2018-11-23 11:57:51,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:51,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:51,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:51,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:51,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 11:57:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2018-11-23 11:57:51,362 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 37 [2018-11-23 11:57:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:51,362 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2018-11-23 11:57:51,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:57:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2018-11-23 11:57:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:57:51,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:51,364 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:57:51,364 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:51,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:51,364 INFO L82 PathProgramCache]: Analyzing trace with hash 484703446, now seen corresponding path program 1 times [2018-11-23 11:57:51,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:51,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:51,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:51,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:51,802 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-23 11:57:52,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7405#true} is VALID [2018-11-23 11:57:52,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {7405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7405#true} is VALID [2018-11-23 11:57:52,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-23 11:57:52,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #156#return; {7405#true} is VALID [2018-11-23 11:57:52,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret28 := main(); {7405#true} is VALID [2018-11-23 11:57:52,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {7405#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} ~j~1 := 0; {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,587 INFO L273 TraceCheckUtils]: 13: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,587 INFO L273 TraceCheckUtils]: 14: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,587 INFO L256 TraceCheckUtils]: 15: Hoare triple {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {7405#true} is VALID [2018-11-23 11:57:52,588 INFO L273 TraceCheckUtils]: 16: Hoare triple {7405#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {7408#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (or (and (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))))} is VALID [2018-11-23 11:57:52,589 INFO L273 TraceCheckUtils]: 17: Hoare triple {7408#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (or (and (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))))} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {7409#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (= is_relaxed_prefix_~i~0 0) (or (and (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~shift~0 0) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))))} is VALID [2018-11-23 11:57:52,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {7409#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (= is_relaxed_prefix_~i~0 0) (or (and (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~shift~0 0) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {7410#(and (or (and (= |is_relaxed_prefix_#t~mem5| (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0)) (= |is_relaxed_prefix_#t~mem4| (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= |is_relaxed_prefix_#in~pat.offset| 0))) (= is_relaxed_prefix_~i~0 0))} is VALID [2018-11-23 11:57:52,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {7410#(and (or (and (= |is_relaxed_prefix_#t~mem5| (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0)) (= |is_relaxed_prefix_#t~mem4| (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= |is_relaxed_prefix_#in~pat.offset| 0))) (= is_relaxed_prefix_~i~0 0))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {7411#(and (or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0))) (= is_relaxed_prefix_~i~0 0))} is VALID [2018-11-23 11:57:52,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {7411#(and (or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0))) (= is_relaxed_prefix_~i~0 0))} assume 0 == ~shift~0;~shift~0 := 1; {7411#(and (or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0))) (= is_relaxed_prefix_~i~0 0))} is VALID [2018-11-23 11:57:52,594 INFO L273 TraceCheckUtils]: 21: Hoare triple {7411#(and (or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0))) (= is_relaxed_prefix_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7412#(or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} is VALID [2018-11-23 11:57:52,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {7412#(or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {7412#(or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} is VALID [2018-11-23 11:57:52,595 INFO L273 TraceCheckUtils]: 23: Hoare triple {7412#(or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {7412#(or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} is VALID [2018-11-23 11:57:52,596 INFO L273 TraceCheckUtils]: 24: Hoare triple {7412#(or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} assume true; {7412#(or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} is VALID [2018-11-23 11:57:52,598 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {7412#(or (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) 0))) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} {7407#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} #160#return; {7413#(and (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) 0))) (= main_~pat~0.offset 0) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,598 INFO L273 TraceCheckUtils]: 26: Hoare triple {7413#(and (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) 0))) (= main_~pat~0.offset 0) (= main_~a~0.offset 0))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {7413#(and (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) 0))) (= main_~pat~0.offset 0) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:57:52,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {7413#(and (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) 0))) (= main_~pat~0.offset 0) (= main_~a~0.offset 0))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {7414#(and (not (= (select (select |#memory_int| main_~a~0.base) (+ (* (- 17179869184) (div (+ main_~i~2 (* 4294967295 main_~differences~0)) 4294967296)) (* 4 main_~i~2) main_~a~0.offset (* 17179869180 main_~differences~0))) (select (select |#memory_int| main_~pat~0.base) (+ (* 4 main_~i~2) main_~pat~0.offset)))) (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (= main_~differences~0 0) (= main_~i~2 0))} is VALID [2018-11-23 11:57:52,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {7414#(and (not (= (select (select |#memory_int| main_~a~0.base) (+ (* (- 17179869184) (div (+ main_~i~2 (* 4294967295 main_~differences~0)) 4294967296)) (* 4 main_~i~2) main_~a~0.offset (* 17179869180 main_~differences~0))) (select (select |#memory_int| main_~pat~0.base) (+ (* 4 main_~i~2) main_~pat~0.offset)))) (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (= main_~differences~0 0) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {7415#(and (= main_~differences~0 0) (not (= |main_#t~mem25| |main_#t~mem24|)) (= main_~i~2 0))} is VALID [2018-11-23 11:57:52,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {7415#(and (= main_~differences~0 0) (not (= |main_#t~mem25| |main_#t~mem24|)) (= main_~i~2 0))} assume !(#t~mem24 != #t~mem25);havoc #t~mem24;havoc #t~mem25; {7406#false} is VALID [2018-11-23 11:57:52,602 INFO L273 TraceCheckUtils]: 30: Hoare triple {7406#false} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {7406#false} is VALID [2018-11-23 11:57:52,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {7406#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {7406#false} is VALID [2018-11-23 11:57:52,603 INFO L273 TraceCheckUtils]: 32: Hoare triple {7406#false} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {7406#false} is VALID [2018-11-23 11:57:52,603 INFO L256 TraceCheckUtils]: 33: Hoare triple {7406#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {7406#false} is VALID [2018-11-23 11:57:52,603 INFO L273 TraceCheckUtils]: 34: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2018-11-23 11:57:52,604 INFO L273 TraceCheckUtils]: 35: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2018-11-23 11:57:52,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2018-11-23 11:57:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:57:52,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:52,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:52,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:52,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:52,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 11:57:52,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:57:52,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:57:52,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:57:52,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:57:52,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2018-11-23 11:57:52,812 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:57:52,813 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, |v_main_#t~nondet13_3|]. (and (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296)) (= main_~j~1 0) (= (store |v_#memory_int_12| main_~a~0.base (store (select |v_#memory_int_12| main_~a~0.base) (+ (* 4 main_~j~1) main_~a~0.offset) |v_main_#t~nondet13_3|)) |#memory_int|)) [2018-11-23 11:57:52,813 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296)) (= main_~j~1 0)) [2018-11-23 11:57:53,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-11-23 11:57:53,123 INFO L478 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 41 treesize of output 34 [2018-11-23 11:57:53,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:57:53,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:57:53,164 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:57:53,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 11:57:53,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:57:53,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:57:53,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 11:57:53,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:57:53,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:57:53,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:57:53,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:93, output treesize:8 [2018-11-23 11:57:53,259 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:57:53,259 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_4, v_prenex_2, v_prenex_5, v_prenex_3, v_prenex_1, |#memory_int|, main_~pat~0.base, main_~pat~0.offset, main_~a~0.base, main_~a~0.offset]. (let ((.cse7 (mod (* 4294967295 main_~differences~0) 4294967296))) (let ((.cse2 (<= .cse7 2147483647)) (.cse3 (* 4 .cse7)) (.cse4 (= main_~differences~0 0))) (or (let ((.cse1 (select v_prenex_4 v_prenex_3)) (.cse0 (select (select v_prenex_4 v_prenex_2) v_prenex_5))) (and (not (= .cse0 (select .cse1 v_prenex_1))) .cse2 (= |main_#t~mem25| (select .cse1 (+ .cse3 v_prenex_1))) (= |main_#t~mem24| .cse0) .cse4)) (let ((.cse6 (select |#memory_int| main_~a~0.base)) (.cse5 (select (select |#memory_int| main_~pat~0.base) main_~pat~0.offset))) (and (not .cse2) (not (= .cse5 (select .cse6 main_~a~0.offset))) (= |main_#t~mem25| (select .cse6 (+ .cse3 main_~a~0.offset (- 17179869184)))) .cse4 (= |main_#t~mem24| .cse5)))))) [2018-11-23 11:57:53,259 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~differences~0 0) (not (= |main_#t~mem25| |main_#t~mem24|))) [2018-11-23 11:57:53,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7405#true} is VALID [2018-11-23 11:57:53,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {7405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7405#true} is VALID [2018-11-23 11:57:53,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2018-11-23 11:57:53,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #156#return; {7405#true} is VALID [2018-11-23 11:57:53,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret28 := main(); {7405#true} is VALID [2018-11-23 11:57:53,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {7405#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {7434#(= main_~j~0 0)} is VALID [2018-11-23 11:57:53,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {7434#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {7434#(= main_~j~0 0)} is VALID [2018-11-23 11:57:53,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {7434#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {7405#true} is VALID [2018-11-23 11:57:53,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {7405#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {7405#true} is VALID [2018-11-23 11:57:53,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {7405#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {7405#true} is VALID [2018-11-23 11:57:53,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {7405#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {7405#true} is VALID [2018-11-23 11:57:53,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {7405#true} ~j~1 := 0; {7453#(= main_~j~1 0)} is VALID [2018-11-23 11:57:53,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {7453#(= main_~j~1 0)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {7457#(and (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296)) (= main_~j~1 0))} is VALID [2018-11-23 11:57:53,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {7457#(and (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296)) (= main_~j~1 0))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {7461#(and (< 0 (mod main_~a_len~0 4294967296)) (= main_~j~1 1))} is VALID [2018-11-23 11:57:53,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {7461#(and (< 0 (mod main_~a_len~0 4294967296)) (= main_~j~1 1))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {7405#true} is VALID [2018-11-23 11:57:53,289 INFO L256 TraceCheckUtils]: 15: Hoare triple {7405#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {7405#true} is VALID [2018-11-23 11:57:53,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {7405#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {7471#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} is VALID [2018-11-23 11:57:53,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {7471#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {7475#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= 0 is_relaxed_prefix_~shift~0) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} is VALID [2018-11-23 11:57:53,292 INFO L273 TraceCheckUtils]: 18: Hoare triple {7475#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= 0 is_relaxed_prefix_~shift~0) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {7479#(and (= |is_relaxed_prefix_#t~mem4| (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|)) (= |is_relaxed_prefix_#t~mem5| (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:57:53,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {7479#(and (= |is_relaxed_prefix_#t~mem4| (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|)) (= |is_relaxed_prefix_#t~mem5| (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:57:53,293 INFO L273 TraceCheckUtils]: 20: Hoare triple {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} assume 0 == ~shift~0;~shift~0 := 1; {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:57:53,293 INFO L273 TraceCheckUtils]: 21: Hoare triple {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:57:53,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:57:53,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:57:53,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} assume true; {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:57:53,297 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {7483#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) |is_relaxed_prefix_#in~pat.offset|) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} {7405#true} #160#return; {7502#(not (= (select (select |#memory_int| main_~pat~0.base) main_~pat~0.offset) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:57:53,297 INFO L273 TraceCheckUtils]: 26: Hoare triple {7502#(not (= (select (select |#memory_int| main_~pat~0.base) main_~pat~0.offset) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {7502#(not (= (select (select |#memory_int| main_~pat~0.base) main_~pat~0.offset) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:57:53,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {7502#(not (= (select (select |#memory_int| main_~pat~0.base) main_~pat~0.offset) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {7509#(and (not (= (select (select |#memory_int| main_~pat~0.base) main_~pat~0.offset) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~differences~0 0) (= main_~i~2 0))} is VALID [2018-11-23 11:57:53,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {7509#(and (not (= (select (select |#memory_int| main_~pat~0.base) main_~pat~0.offset) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~differences~0 0) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {7513#(and (= main_~differences~0 0) (not (= |main_#t~mem25| |main_#t~mem24|)))} is VALID [2018-11-23 11:57:53,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {7513#(and (= main_~differences~0 0) (not (= |main_#t~mem25| |main_#t~mem24|)))} assume !(#t~mem24 != #t~mem25);havoc #t~mem24;havoc #t~mem25; {7406#false} is VALID [2018-11-23 11:57:53,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {7406#false} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {7406#false} is VALID [2018-11-23 11:57:53,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {7406#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {7406#false} is VALID [2018-11-23 11:57:53,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {7406#false} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {7406#false} is VALID [2018-11-23 11:57:53,301 INFO L256 TraceCheckUtils]: 33: Hoare triple {7406#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {7406#false} is VALID [2018-11-23 11:57:53,301 INFO L273 TraceCheckUtils]: 34: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2018-11-23 11:57:53,301 INFO L273 TraceCheckUtils]: 35: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2018-11-23 11:57:53,301 INFO L273 TraceCheckUtils]: 36: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2018-11-23 11:57:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:57:53,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:53,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-11-23 11:57:53,325 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-11-23 11:57:53,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:53,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:57:53,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:53,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:57:53,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:57:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:57:53,395 INFO L87 Difference]: Start difference. First operand 116 states and 151 transitions. Second operand 22 states. [2018-11-23 11:58:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:01,122 INFO L93 Difference]: Finished difference Result 236 states and 318 transitions. [2018-11-23 11:58:01,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:58:01,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-11-23 11:58:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 179 transitions. [2018-11-23 11:58:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 179 transitions. [2018-11-23 11:58:01,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 179 transitions. [2018-11-23 11:58:01,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:01,763 INFO L225 Difference]: With dead ends: 236 [2018-11-23 11:58:01,763 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 11:58:01,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:58:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 11:58:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 133. [2018-11-23 11:58:02,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:02,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 133 states. [2018-11-23 11:58:02,390 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 133 states. [2018-11-23 11:58:02,390 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 133 states. [2018-11-23 11:58:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:02,399 INFO L93 Difference]: Finished difference Result 210 states and 280 transitions. [2018-11-23 11:58:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 280 transitions. [2018-11-23 11:58:02,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:02,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:02,400 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 210 states. [2018-11-23 11:58:02,400 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 210 states. [2018-11-23 11:58:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:02,409 INFO L93 Difference]: Finished difference Result 210 states and 280 transitions. [2018-11-23 11:58:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 280 transitions. [2018-11-23 11:58:02,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:02,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:02,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:02,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 11:58:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 172 transitions. [2018-11-23 11:58:02,416 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 172 transitions. Word has length 37 [2018-11-23 11:58:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:02,416 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 172 transitions. [2018-11-23 11:58:02,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:58:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 172 transitions. [2018-11-23 11:58:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:58:02,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:02,418 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:02,418 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:02,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:02,418 INFO L82 PathProgramCache]: Analyzing trace with hash 671034992, now seen corresponding path program 1 times [2018-11-23 11:58:02,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:02,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:02,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:02,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:02,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:03,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {8466#true} call ULTIMATE.init(); {8466#true} is VALID [2018-11-23 11:58:03,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {8466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8466#true} is VALID [2018-11-23 11:58:03,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {8466#true} assume true; {8466#true} is VALID [2018-11-23 11:58:03,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8466#true} {8466#true} #156#return; {8466#true} is VALID [2018-11-23 11:58:03,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {8466#true} call #t~ret28 := main(); {8466#true} is VALID [2018-11-23 11:58:03,152 INFO L273 TraceCheckUtils]: 5: Hoare triple {8466#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {8466#true} is VALID [2018-11-23 11:58:03,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {8466#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {8466#true} is VALID [2018-11-23 11:58:03,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {8466#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {8466#true} is VALID [2018-11-23 11:58:03,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {8466#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {8466#true} is VALID [2018-11-23 11:58:03,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {8466#true} ~j~1 := 0; {8466#true} is VALID [2018-11-23 11:58:03,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {8466#true} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {8466#true} is VALID [2018-11-23 11:58:03,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {8466#true} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {8466#true} is VALID [2018-11-23 11:58:03,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {8466#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {8466#true} is VALID [2018-11-23 11:58:03,154 INFO L256 TraceCheckUtils]: 13: Hoare triple {8466#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {8466#true} is VALID [2018-11-23 11:58:03,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {8466#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {8466#true} is VALID [2018-11-23 11:58:03,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {8466#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {8466#true} is VALID [2018-11-23 11:58:03,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {8466#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {8466#true} is VALID [2018-11-23 11:58:03,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {8466#true} assume !(#t~mem4 != #t~mem5);havoc #t~mem5;havoc #t~mem4; {8466#true} is VALID [2018-11-23 11:58:03,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {8466#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8466#true} is VALID [2018-11-23 11:58:03,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {8466#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {8466#true} is VALID [2018-11-23 11:58:03,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {8466#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {8466#true} is VALID [2018-11-23 11:58:03,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {8466#true} assume true; {8466#true} is VALID [2018-11-23 11:58:03,156 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {8466#true} {8466#true} #160#return; {8466#true} is VALID [2018-11-23 11:58:03,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {8466#true} assume 0 != #t~ret14 % 256;havoc #t~ret14; {8466#true} is VALID [2018-11-23 11:58:03,156 INFO L256 TraceCheckUtils]: 24: Hoare triple {8466#true} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {8466#true} is VALID [2018-11-23 11:58:03,156 INFO L273 TraceCheckUtils]: 25: Hoare triple {8466#true} ~cond := #in~cond; {8466#true} is VALID [2018-11-23 11:58:03,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {8466#true} assume !(0 == ~cond); {8466#true} is VALID [2018-11-23 11:58:03,157 INFO L273 TraceCheckUtils]: 27: Hoare triple {8466#true} assume true; {8466#true} is VALID [2018-11-23 11:58:03,157 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {8466#true} {8466#true} #162#return; {8466#true} is VALID [2018-11-23 11:58:03,157 INFO L273 TraceCheckUtils]: 29: Hoare triple {8466#true} ~different~0 := #t~nondet15;havoc #t~nondet15; {8466#true} is VALID [2018-11-23 11:58:03,157 INFO L273 TraceCheckUtils]: 30: Hoare triple {8466#true} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {8466#true} is VALID [2018-11-23 11:58:03,174 INFO L273 TraceCheckUtils]: 31: Hoare triple {8466#true} ~i~1 := 0; {8468#(= main_~i~1 0)} is VALID [2018-11-23 11:58:03,176 INFO L273 TraceCheckUtils]: 32: Hoare triple {8468#(= main_~i~1 0)} assume !!(~i~1 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~1 % 4294967296 < ~a_len~0 % 4294967296); {8468#(= main_~i~1 0)} is VALID [2018-11-23 11:58:03,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {8468#(= main_~i~1 0)} assume !(~i~1 % 4294967296 < ~different~0 % 4294967296); {8469#(and (<= (+ main_~different~0 (* 4294967296 (div main_~i~1 4294967296))) (+ main_~i~1 (* 4294967296 (div main_~different~0 4294967296)))) (= main_~i~1 0))} is VALID [2018-11-23 11:58:03,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {8469#(and (<= (+ main_~different~0 (* 4294967296 (div main_~i~1 4294967296))) (+ main_~i~1 (* 4294967296 (div main_~different~0 4294967296)))) (= main_~i~1 0))} assume !(~i~1 % 4294967296 == ~different~0 % 4294967296); {8467#false} is VALID [2018-11-23 11:58:03,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {8467#false} assume ~i~1 % 4294967296 > ~different~0 % 4294967296;call #t~mem21 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~1, 4);call #t~mem22 := read~int(~a~0.base, ~a~0.offset + 4 * (~i~1 - 1), 4); {8467#false} is VALID [2018-11-23 11:58:03,179 INFO L256 TraceCheckUtils]: 36: Hoare triple {8467#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {8467#false} is VALID [2018-11-23 11:58:03,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {8467#false} ~cond := #in~cond; {8467#false} is VALID [2018-11-23 11:58:03,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {8467#false} assume 0 == ~cond; {8467#false} is VALID [2018-11-23 11:58:03,179 INFO L273 TraceCheckUtils]: 39: Hoare triple {8467#false} assume !false; {8467#false} is VALID [2018-11-23 11:58:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:58:03,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:03,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:58:03,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 11:58:03,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:03,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:58:03,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:03,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:58:03,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:58:03,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:58:03,222 INFO L87 Difference]: Start difference. First operand 133 states and 172 transitions. Second operand 4 states. [2018-11-23 11:58:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:03,781 INFO L93 Difference]: Finished difference Result 151 states and 195 transitions. [2018-11-23 11:58:03,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:03,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-23 11:58:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:58:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 11:58:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:58:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 11:58:03,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2018-11-23 11:58:03,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:03,899 INFO L225 Difference]: With dead ends: 151 [2018-11-23 11:58:03,899 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 11:58:03,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:58:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 11:58:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-23 11:58:04,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:04,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2018-11-23 11:58:04,685 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2018-11-23 11:58:04,685 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2018-11-23 11:58:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:04,690 INFO L93 Difference]: Finished difference Result 138 states and 178 transitions. [2018-11-23 11:58:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 178 transitions. [2018-11-23 11:58:04,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:04,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:04,691 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2018-11-23 11:58:04,691 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2018-11-23 11:58:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:04,695 INFO L93 Difference]: Finished difference Result 138 states and 178 transitions. [2018-11-23 11:58:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 178 transitions. [2018-11-23 11:58:04,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:04,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:04,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:04,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 11:58:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 176 transitions. [2018-11-23 11:58:04,699 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 176 transitions. Word has length 40 [2018-11-23 11:58:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:04,699 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 176 transitions. [2018-11-23 11:58:04,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:58:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 176 transitions. [2018-11-23 11:58:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:58:04,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:04,701 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:04,701 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:04,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash 646057629, now seen corresponding path program 2 times [2018-11-23 11:58:04,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:04,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:04,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:04,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:04,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:05,740 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-23 11:58:05,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2018-11-23 11:58:05,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9126#true} is VALID [2018-11-23 11:58:05,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2018-11-23 11:58:05,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #156#return; {9126#true} is VALID [2018-11-23 11:58:05,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret28 := main(); {9126#true} is VALID [2018-11-23 11:58:05,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {9126#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {9126#true} is VALID [2018-11-23 11:58:05,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {9126#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {9126#true} is VALID [2018-11-23 11:58:05,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {9126#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {9126#true} is VALID [2018-11-23 11:58:05,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {9126#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {9126#true} is VALID [2018-11-23 11:58:05,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {9126#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {9126#true} is VALID [2018-11-23 11:58:05,759 INFO L273 TraceCheckUtils]: 10: Hoare triple {9126#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {9126#true} is VALID [2018-11-23 11:58:05,759 INFO L273 TraceCheckUtils]: 11: Hoare triple {9126#true} ~j~1 := 0; {9126#true} is VALID [2018-11-23 11:58:05,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {9126#true} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {9126#true} is VALID [2018-11-23 11:58:05,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {9126#true} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {9126#true} is VALID [2018-11-23 11:58:05,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {9126#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {9126#true} is VALID [2018-11-23 11:58:05,760 INFO L256 TraceCheckUtils]: 15: Hoare triple {9126#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {9126#true} is VALID [2018-11-23 11:58:05,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {9126#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {9126#true} is VALID [2018-11-23 11:58:05,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {9126#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {9126#true} is VALID [2018-11-23 11:58:05,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {9126#true} is VALID [2018-11-23 11:58:05,761 INFO L273 TraceCheckUtils]: 19: Hoare triple {9126#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {9126#true} is VALID [2018-11-23 11:58:05,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {9126#true} assume 0 == ~shift~0;~shift~0 := 1; {9126#true} is VALID [2018-11-23 11:58:05,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {9126#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9126#true} is VALID [2018-11-23 11:58:05,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {9126#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {9126#true} is VALID [2018-11-23 11:58:05,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {9126#true} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {9126#true} is VALID [2018-11-23 11:58:05,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {9126#true} assume true; {9126#true} is VALID [2018-11-23 11:58:05,762 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {9126#true} {9126#true} #160#return; {9126#true} is VALID [2018-11-23 11:58:05,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {9126#true} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {9126#true} is VALID [2018-11-23 11:58:05,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {9126#true} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {9128#(= main_~differences~0 0)} is VALID [2018-11-23 11:58:05,762 INFO L273 TraceCheckUtils]: 28: Hoare triple {9128#(= main_~differences~0 0)} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {9128#(= main_~differences~0 0)} is VALID [2018-11-23 11:58:05,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {9128#(= main_~differences~0 0)} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {9129#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} is VALID [2018-11-23 11:58:05,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {9129#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {9129#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} is VALID [2018-11-23 11:58:05,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {9129#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {9129#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} is VALID [2018-11-23 11:58:05,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {9129#(and (<= 1 main_~differences~0) (<= main_~differences~0 1))} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {9130#(and (<= 2 main_~differences~0) (<= main_~differences~0 2))} is VALID [2018-11-23 11:58:05,765 INFO L273 TraceCheckUtils]: 33: Hoare triple {9130#(and (<= 2 main_~differences~0) (<= main_~differences~0 2))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {9130#(and (<= 2 main_~differences~0) (<= main_~differences~0 2))} is VALID [2018-11-23 11:58:05,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {9130#(and (<= 2 main_~differences~0) (<= main_~differences~0 2))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {9130#(and (<= 2 main_~differences~0) (<= main_~differences~0 2))} is VALID [2018-11-23 11:58:05,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {9130#(and (<= 2 main_~differences~0) (<= main_~differences~0 2))} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {9131#(and (<= (div main_~differences~0 4294967296) 0) (<= 3 main_~differences~0))} is VALID [2018-11-23 11:58:05,768 INFO L256 TraceCheckUtils]: 36: Hoare triple {9131#(and (<= (div main_~differences~0 4294967296) 0) (<= 3 main_~differences~0))} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {9132#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 11:58:05,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {9132#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9133#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 11:58:05,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {9133#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {9127#false} is VALID [2018-11-23 11:58:05,769 INFO L273 TraceCheckUtils]: 39: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2018-11-23 11:58:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:58:05,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:05,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:05,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:05,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:05,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:05,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:05,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {9126#true} call ULTIMATE.init(); {9126#true} is VALID [2018-11-23 11:58:05,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {9126#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9126#true} is VALID [2018-11-23 11:58:05,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {9126#true} assume true; {9126#true} is VALID [2018-11-23 11:58:05,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9126#true} {9126#true} #156#return; {9126#true} is VALID [2018-11-23 11:58:05,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {9126#true} call #t~ret28 := main(); {9126#true} is VALID [2018-11-23 11:58:05,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {9126#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {9152#(= main_~j~0 0)} is VALID [2018-11-23 11:58:05,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {9152#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {9152#(= main_~j~0 0)} is VALID [2018-11-23 11:58:05,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {9152#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {9126#true} is VALID [2018-11-23 11:58:05,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {9126#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {9126#true} is VALID [2018-11-23 11:58:05,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {9126#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {9126#true} is VALID [2018-11-23 11:58:05,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {9126#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {9126#true} is VALID [2018-11-23 11:58:05,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {9126#true} ~j~1 := 0; {9171#(= main_~j~1 0)} is VALID [2018-11-23 11:58:05,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {9171#(= main_~j~1 0)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {9171#(= main_~j~1 0)} is VALID [2018-11-23 11:58:05,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {9171#(= main_~j~1 0)} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {9178#(= main_~j~1 1)} is VALID [2018-11-23 11:58:05,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {9178#(= main_~j~1 1)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {9182#(<= (mod main_~a_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:05,976 INFO L256 TraceCheckUtils]: 15: Hoare triple {9182#(<= (mod main_~a_len~0 4294967296) 1)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {9126#true} is VALID [2018-11-23 11:58:05,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {9126#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {9126#true} is VALID [2018-11-23 11:58:05,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {9126#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {9126#true} is VALID [2018-11-23 11:58:05,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {9126#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {9126#true} is VALID [2018-11-23 11:58:05,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {9126#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {9126#true} is VALID [2018-11-23 11:58:05,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {9126#true} assume 0 == ~shift~0;~shift~0 := 1; {9126#true} is VALID [2018-11-23 11:58:05,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {9126#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9126#true} is VALID [2018-11-23 11:58:05,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {9126#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {9126#true} is VALID [2018-11-23 11:58:05,977 INFO L273 TraceCheckUtils]: 23: Hoare triple {9126#true} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {9126#true} is VALID [2018-11-23 11:58:05,977 INFO L273 TraceCheckUtils]: 24: Hoare triple {9126#true} assume true; {9126#true} is VALID [2018-11-23 11:58:05,978 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {9126#true} {9182#(<= (mod main_~a_len~0 4294967296) 1)} #160#return; {9182#(<= (mod main_~a_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:05,978 INFO L273 TraceCheckUtils]: 26: Hoare triple {9182#(<= (mod main_~a_len~0 4294967296) 1)} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {9182#(<= (mod main_~a_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:05,979 INFO L273 TraceCheckUtils]: 27: Hoare triple {9182#(<= (mod main_~a_len~0 4294967296) 1)} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {9222#(and (<= (mod main_~a_len~0 4294967296) 1) (= main_~i~2 0))} is VALID [2018-11-23 11:58:05,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {9222#(and (<= (mod main_~a_len~0 4294967296) 1) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {9222#(and (<= (mod main_~a_len~0 4294967296) 1) (= main_~i~2 0))} is VALID [2018-11-23 11:58:05,980 INFO L273 TraceCheckUtils]: 29: Hoare triple {9222#(and (<= (mod main_~a_len~0 4294967296) 1) (= main_~i~2 0))} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {9222#(and (<= (mod main_~a_len~0 4294967296) 1) (= main_~i~2 0))} is VALID [2018-11-23 11:58:05,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {9222#(and (<= (mod main_~a_len~0 4294967296) 1) (= main_~i~2 0))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {9232#(and (<= (mod main_~a_len~0 4294967296) 1) (= main_~i~2 1))} is VALID [2018-11-23 11:58:05,982 INFO L273 TraceCheckUtils]: 31: Hoare triple {9232#(and (<= (mod main_~a_len~0 4294967296) 1) (= main_~i~2 1))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {9127#false} is VALID [2018-11-23 11:58:05,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {9127#false} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {9127#false} is VALID [2018-11-23 11:58:05,982 INFO L273 TraceCheckUtils]: 33: Hoare triple {9127#false} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {9127#false} is VALID [2018-11-23 11:58:05,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {9127#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {9127#false} is VALID [2018-11-23 11:58:05,982 INFO L273 TraceCheckUtils]: 35: Hoare triple {9127#false} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {9127#false} is VALID [2018-11-23 11:58:05,983 INFO L256 TraceCheckUtils]: 36: Hoare triple {9127#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {9127#false} is VALID [2018-11-23 11:58:05,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {9127#false} ~cond := #in~cond; {9127#false} is VALID [2018-11-23 11:58:05,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {9127#false} assume 0 == ~cond; {9127#false} is VALID [2018-11-23 11:58:05,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {9127#false} assume !false; {9127#false} is VALID [2018-11-23 11:58:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:06,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:06,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:58:06,004 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-23 11:58:06,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:06,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:58:06,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:06,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:58:06,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:58:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:58:06,065 INFO L87 Difference]: Start difference. First operand 136 states and 176 transitions. Second operand 14 states. [2018-11-23 11:58:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:08,921 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2018-11-23 11:58:08,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:58:08,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-23 11:58:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2018-11-23 11:58:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2018-11-23 11:58:08,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 141 transitions. [2018-11-23 11:58:10,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:10,153 INFO L225 Difference]: With dead ends: 206 [2018-11-23 11:58:10,153 INFO L226 Difference]: Without dead ends: 180 [2018-11-23 11:58:10,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:58:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-23 11:58:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 145. [2018-11-23 11:58:10,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:10,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand 145 states. [2018-11-23 11:58:10,573 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 145 states. [2018-11-23 11:58:10,573 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 145 states. [2018-11-23 11:58:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:10,578 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2018-11-23 11:58:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 236 transitions. [2018-11-23 11:58:10,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:10,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:10,579 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 180 states. [2018-11-23 11:58:10,580 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 180 states. [2018-11-23 11:58:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:10,586 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2018-11-23 11:58:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 236 transitions. [2018-11-23 11:58:10,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:10,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:10,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:10,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 11:58:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2018-11-23 11:58:10,590 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 40 [2018-11-23 11:58:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:10,591 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2018-11-23 11:58:10,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:58:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2018-11-23 11:58:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:58:10,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:10,592 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:10,592 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:10,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash 713052019, now seen corresponding path program 2 times [2018-11-23 11:58:10,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:10,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:10,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:11,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {10092#true} call ULTIMATE.init(); {10092#true} is VALID [2018-11-23 11:58:11,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {10092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10092#true} is VALID [2018-11-23 11:58:11,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {10092#true} assume true; {10092#true} is VALID [2018-11-23 11:58:11,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10092#true} {10092#true} #156#return; {10092#true} is VALID [2018-11-23 11:58:11,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {10092#true} call #t~ret28 := main(); {10092#true} is VALID [2018-11-23 11:58:11,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {10092#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {10092#true} is VALID [2018-11-23 11:58:11,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {10092#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {10094#(<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 4294967294))} is VALID [2018-11-23 11:58:11,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {10094#(<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 4294967294))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {10095#(<= (+ (* 4294967296 (div main_~j~0 4294967296)) 1) main_~j~0)} is VALID [2018-11-23 11:58:11,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {10095#(<= (+ (* 4294967296 (div main_~j~0 4294967296)) 1) main_~j~0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} ~j~1 := 0; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,225 INFO L256 TraceCheckUtils]: 17: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {10092#true} is VALID [2018-11-23 11:58:11,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {10092#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {10092#true} is VALID [2018-11-23 11:58:11,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {10092#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {10092#true} is VALID [2018-11-23 11:58:11,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {10092#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {10092#true} is VALID [2018-11-23 11:58:11,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {10092#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {10092#true} is VALID [2018-11-23 11:58:11,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {10092#true} assume 0 == ~shift~0;~shift~0 := 1; {10092#true} is VALID [2018-11-23 11:58:11,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {10092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10092#true} is VALID [2018-11-23 11:58:11,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {10092#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {10092#true} is VALID [2018-11-23 11:58:11,226 INFO L273 TraceCheckUtils]: 25: Hoare triple {10092#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {10092#true} is VALID [2018-11-23 11:58:11,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {10092#true} assume !(0 == ~shift~0);#res := 0; {10092#true} is VALID [2018-11-23 11:58:11,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {10092#true} assume true; {10092#true} is VALID [2018-11-23 11:58:11,227 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {10092#true} {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} #160#return; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,228 INFO L273 TraceCheckUtils]: 29: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,228 INFO L273 TraceCheckUtils]: 30: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} is VALID [2018-11-23 11:58:11,230 INFO L273 TraceCheckUtils]: 31: Hoare triple {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} is VALID [2018-11-23 11:58:11,230 INFO L273 TraceCheckUtils]: 32: Hoare triple {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} is VALID [2018-11-23 11:58:11,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {10098#(<= (+ main_~i~2 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~i~2 4294967296))))} is VALID [2018-11-23 11:58:11,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {10098#(<= (+ main_~i~2 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~i~2 4294967296))))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {10099#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} is VALID [2018-11-23 11:58:11,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {10099#(<= (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296)) 1) (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))))} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {10093#false} is VALID [2018-11-23 11:58:11,233 INFO L256 TraceCheckUtils]: 36: Hoare triple {10093#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {10093#false} is VALID [2018-11-23 11:58:11,233 INFO L273 TraceCheckUtils]: 37: Hoare triple {10093#false} ~cond := #in~cond; {10093#false} is VALID [2018-11-23 11:58:11,233 INFO L273 TraceCheckUtils]: 38: Hoare triple {10093#false} assume 0 == ~cond; {10093#false} is VALID [2018-11-23 11:58:11,233 INFO L273 TraceCheckUtils]: 39: Hoare triple {10093#false} assume !false; {10093#false} is VALID [2018-11-23 11:58:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:58:11,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:11,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:11,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:11,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:11,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:11,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:11,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {10092#true} call ULTIMATE.init(); {10092#true} is VALID [2018-11-23 11:58:11,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {10092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10092#true} is VALID [2018-11-23 11:58:11,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {10092#true} assume true; {10092#true} is VALID [2018-11-23 11:58:11,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10092#true} {10092#true} #156#return; {10092#true} is VALID [2018-11-23 11:58:11,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {10092#true} call #t~ret28 := main(); {10092#true} is VALID [2018-11-23 11:58:11,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {10092#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {10118#(= main_~j~0 0)} is VALID [2018-11-23 11:58:11,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {10118#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {10118#(= main_~j~0 0)} is VALID [2018-11-23 11:58:11,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {10118#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {10125#(= main_~j~0 1)} is VALID [2018-11-23 11:58:11,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {10125#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} ~j~1 := 0; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,473 INFO L256 TraceCheckUtils]: 17: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {10092#true} is VALID [2018-11-23 11:58:11,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {10092#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {10092#true} is VALID [2018-11-23 11:58:11,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {10092#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {10092#true} is VALID [2018-11-23 11:58:11,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {10092#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {10092#true} is VALID [2018-11-23 11:58:11,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {10092#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {10092#true} is VALID [2018-11-23 11:58:11,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {10092#true} assume 0 == ~shift~0;~shift~0 := 1; {10092#true} is VALID [2018-11-23 11:58:11,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {10092#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10092#true} is VALID [2018-11-23 11:58:11,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {10092#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {10092#true} is VALID [2018-11-23 11:58:11,474 INFO L273 TraceCheckUtils]: 25: Hoare triple {10092#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {10092#true} is VALID [2018-11-23 11:58:11,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {10092#true} assume !(0 == ~shift~0);#res := 0; {10092#true} is VALID [2018-11-23 11:58:11,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {10092#true} assume true; {10092#true} is VALID [2018-11-23 11:58:11,476 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {10092#true} {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} #160#return; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} is VALID [2018-11-23 11:58:11,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {10096#(<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0)} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} is VALID [2018-11-23 11:58:11,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} is VALID [2018-11-23 11:58:11,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} is VALID [2018-11-23 11:58:11,479 INFO L273 TraceCheckUtils]: 33: Hoare triple {10097#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 0))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {10204#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 1))} is VALID [2018-11-23 11:58:11,480 INFO L273 TraceCheckUtils]: 34: Hoare triple {10204#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (= main_~i~2 1))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {10208#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (<= (mod main_~a_len~0 4294967296) 1))} is VALID [2018-11-23 11:58:11,481 INFO L273 TraceCheckUtils]: 35: Hoare triple {10208#(and (<= (+ (* 4294967296 (div main_~pat_len~0 4294967296)) 2) main_~pat_len~0) (<= (mod main_~a_len~0 4294967296) 1))} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {10093#false} is VALID [2018-11-23 11:58:11,481 INFO L256 TraceCheckUtils]: 36: Hoare triple {10093#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {10093#false} is VALID [2018-11-23 11:58:11,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {10093#false} ~cond := #in~cond; {10093#false} is VALID [2018-11-23 11:58:11,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {10093#false} assume 0 == ~cond; {10093#false} is VALID [2018-11-23 11:58:11,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {10093#false} assume !false; {10093#false} is VALID [2018-11-23 11:58:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:58:11,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:11,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-23 11:58:11,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:58:11,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:11,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:58:11,594 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-23 11:58:11,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:58:11,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:58:11,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:11,595 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand 12 states. [2018-11-23 11:58:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,031 INFO L93 Difference]: Finished difference Result 305 states and 417 transitions. [2018-11-23 11:58:15,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:58:15,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:58:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 180 transitions. [2018-11-23 11:58:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 180 transitions. [2018-11-23 11:58:15,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 180 transitions. [2018-11-23 11:58:15,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:15,311 INFO L225 Difference]: With dead ends: 305 [2018-11-23 11:58:15,311 INFO L226 Difference]: Without dead ends: 296 [2018-11-23 11:58:15,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:58:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-23 11:58:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 150. [2018-11-23 11:58:15,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:15,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand 150 states. [2018-11-23 11:58:15,974 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 150 states. [2018-11-23 11:58:15,974 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 150 states. [2018-11-23 11:58:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,983 INFO L93 Difference]: Finished difference Result 296 states and 405 transitions. [2018-11-23 11:58:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 405 transitions. [2018-11-23 11:58:15,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:15,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:15,985 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 296 states. [2018-11-23 11:58:15,985 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 296 states. [2018-11-23 11:58:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,993 INFO L93 Difference]: Finished difference Result 296 states and 405 transitions. [2018-11-23 11:58:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 405 transitions. [2018-11-23 11:58:15,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:15,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:15,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:15,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 11:58:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2018-11-23 11:58:15,998 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 40 [2018-11-23 11:58:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:15,999 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2018-11-23 11:58:15,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:58:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2018-11-23 11:58:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:58:16,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:16,000 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:16,000 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:16,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1256035556, now seen corresponding path program 1 times [2018-11-23 11:58:16,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:16,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:16,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:16,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {11439#true} call ULTIMATE.init(); {11439#true} is VALID [2018-11-23 11:58:16,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {11439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11439#true} is VALID [2018-11-23 11:58:16,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {11439#true} assume true; {11439#true} is VALID [2018-11-23 11:58:16,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11439#true} {11439#true} #156#return; {11439#true} is VALID [2018-11-23 11:58:16,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {11439#true} call #t~ret28 := main(); {11439#true} is VALID [2018-11-23 11:58:16,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {11439#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {11439#true} is VALID [2018-11-23 11:58:16,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {11439#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {11439#true} is VALID [2018-11-23 11:58:16,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {11439#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {11439#true} is VALID [2018-11-23 11:58:16,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {11439#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {11439#true} is VALID [2018-11-23 11:58:16,327 INFO L273 TraceCheckUtils]: 9: Hoare triple {11439#true} ~j~1 := 0; {11441#(= main_~j~1 0)} is VALID [2018-11-23 11:58:16,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {11441#(= main_~j~1 0)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {11441#(= main_~j~1 0)} is VALID [2018-11-23 11:58:16,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {11441#(= main_~j~1 0)} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {11442#(and (<= 1 main_~j~1) (<= main_~j~1 1))} is VALID [2018-11-23 11:58:16,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {11442#(and (<= 1 main_~j~1) (<= main_~j~1 1))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} is VALID [2018-11-23 11:58:16,328 INFO L256 TraceCheckUtils]: 13: Hoare triple {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {11439#true} is VALID [2018-11-23 11:58:16,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {11439#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {11439#true} is VALID [2018-11-23 11:58:16,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {11439#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {11439#true} is VALID [2018-11-23 11:58:16,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {11439#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {11439#true} is VALID [2018-11-23 11:58:16,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {11439#true} assume !(#t~mem4 != #t~mem5);havoc #t~mem5;havoc #t~mem4; {11439#true} is VALID [2018-11-23 11:58:16,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {11439#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11439#true} is VALID [2018-11-23 11:58:16,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {11439#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {11439#true} is VALID [2018-11-23 11:58:16,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {11439#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {11439#true} is VALID [2018-11-23 11:58:16,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {11439#true} assume true; {11439#true} is VALID [2018-11-23 11:58:16,330 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {11439#true} {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} #160#return; {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} is VALID [2018-11-23 11:58:16,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} assume 0 != #t~ret14 % 256;havoc #t~ret14; {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} is VALID [2018-11-23 11:58:16,331 INFO L256 TraceCheckUtils]: 24: Hoare triple {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {11439#true} is VALID [2018-11-23 11:58:16,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {11439#true} ~cond := #in~cond; {11439#true} is VALID [2018-11-23 11:58:16,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {11439#true} assume !(0 == ~cond); {11439#true} is VALID [2018-11-23 11:58:16,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {11439#true} assume true; {11439#true} is VALID [2018-11-23 11:58:16,332 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {11439#true} {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} #162#return; {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} is VALID [2018-11-23 11:58:16,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} ~different~0 := #t~nondet15;havoc #t~nondet15; {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} is VALID [2018-11-23 11:58:16,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} is VALID [2018-11-23 11:58:16,334 INFO L273 TraceCheckUtils]: 31: Hoare triple {11443#(<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1))} ~i~1 := 0; {11444#(and (<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1)) (= main_~i~1 0))} is VALID [2018-11-23 11:58:16,334 INFO L273 TraceCheckUtils]: 32: Hoare triple {11444#(and (<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1)) (= main_~i~1 0))} assume !!(~i~1 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~1 % 4294967296 < ~a_len~0 % 4294967296); {11444#(and (<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1)) (= main_~i~1 0))} is VALID [2018-11-23 11:58:16,335 INFO L273 TraceCheckUtils]: 33: Hoare triple {11444#(and (<= main_~a_len~0 (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1)) (= main_~i~1 0))} assume ~i~1 % 4294967296 < ~different~0 % 4294967296;call #t~mem17 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~1, 4);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);assume 0 != (if #t~mem17 == #t~mem18 then 1 else 0);havoc #t~mem18;havoc #t~mem17; {11445#(and (<= (+ main_~a_len~0 (* 4294967296 (div (+ (* 4294967296 (div main_~different~0 4294967296)) (+ (- main_~different~0) 2)) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1)) (= main_~i~1 0))} is VALID [2018-11-23 11:58:16,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {11445#(and (<= (+ main_~a_len~0 (* 4294967296 (div (+ (* 4294967296 (div main_~different~0 4294967296)) (+ (- main_~different~0) 2)) 4294967296))) (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1)) (= main_~i~1 0))} #t~post16 := ~i~1;~i~1 := 1 + #t~post16;havoc #t~post16; {11446#(or (<= (+ main_~a_len~0 (* 4294967296 (div main_~i~1 4294967296))) (+ main_~i~1 (* 4294967296 (div main_~a_len~0 4294967296)))) (<= (+ main_~i~1 (* 4294967296 (div main_~different~0 4294967296)) 2) (+ main_~different~0 (* 4294967296 (div main_~i~1 4294967296)))))} is VALID [2018-11-23 11:58:16,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {11446#(or (<= (+ main_~a_len~0 (* 4294967296 (div main_~i~1 4294967296))) (+ main_~i~1 (* 4294967296 (div main_~a_len~0 4294967296)))) (<= (+ main_~i~1 (* 4294967296 (div main_~different~0 4294967296)) 2) (+ main_~different~0 (* 4294967296 (div main_~i~1 4294967296)))))} assume !!(~i~1 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~1 % 4294967296 < ~a_len~0 % 4294967296); {11447#(<= (+ main_~i~1 (* 4294967296 (div main_~different~0 4294967296)) 2) (+ main_~different~0 (* 4294967296 (div main_~i~1 4294967296))))} is VALID [2018-11-23 11:58:16,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {11447#(<= (+ main_~i~1 (* 4294967296 (div main_~different~0 4294967296)) 2) (+ main_~different~0 (* 4294967296 (div main_~i~1 4294967296))))} assume !(~i~1 % 4294967296 < ~different~0 % 4294967296); {11440#false} is VALID [2018-11-23 11:58:16,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {11440#false} assume !(~i~1 % 4294967296 == ~different~0 % 4294967296); {11440#false} is VALID [2018-11-23 11:58:16,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {11440#false} assume ~i~1 % 4294967296 > ~different~0 % 4294967296;call #t~mem21 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~1, 4);call #t~mem22 := read~int(~a~0.base, ~a~0.offset + 4 * (~i~1 - 1), 4); {11440#false} is VALID [2018-11-23 11:58:16,339 INFO L256 TraceCheckUtils]: 39: Hoare triple {11440#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {11440#false} is VALID [2018-11-23 11:58:16,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {11440#false} ~cond := #in~cond; {11440#false} is VALID [2018-11-23 11:58:16,339 INFO L273 TraceCheckUtils]: 41: Hoare triple {11440#false} assume 0 == ~cond; {11440#false} is VALID [2018-11-23 11:58:16,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {11440#false} assume !false; {11440#false} is VALID [2018-11-23 11:58:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:16,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:16,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:16,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:16,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:16,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {11439#true} call ULTIMATE.init(); {11439#true} is VALID [2018-11-23 11:58:16,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {11439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11439#true} is VALID [2018-11-23 11:58:16,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {11439#true} assume true; {11439#true} is VALID [2018-11-23 11:58:16,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11439#true} {11439#true} #156#return; {11439#true} is VALID [2018-11-23 11:58:16,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {11439#true} call #t~ret28 := main(); {11439#true} is VALID [2018-11-23 11:58:16,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {11439#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {11466#(= main_~j~0 0)} is VALID [2018-11-23 11:58:16,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {11466#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {11466#(= main_~j~0 0)} is VALID [2018-11-23 11:58:16,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {11466#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {11473#(= main_~j~0 1)} is VALID [2018-11-23 11:58:16,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {11473#(= main_~j~0 1)} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} ~j~1 := 0; {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,542 INFO L256 TraceCheckUtils]: 13: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {11439#true} is VALID [2018-11-23 11:58:16,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {11439#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {11439#true} is VALID [2018-11-23 11:58:16,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {11439#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {11439#true} is VALID [2018-11-23 11:58:16,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {11439#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {11439#true} is VALID [2018-11-23 11:58:16,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {11439#true} assume !(#t~mem4 != #t~mem5);havoc #t~mem5;havoc #t~mem4; {11439#true} is VALID [2018-11-23 11:58:16,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {11439#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11439#true} is VALID [2018-11-23 11:58:16,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {11439#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {11439#true} is VALID [2018-11-23 11:58:16,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {11439#true} assume !(~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0);#res := 1; {11439#true} is VALID [2018-11-23 11:58:16,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {11439#true} assume true; {11439#true} is VALID [2018-11-23 11:58:16,545 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {11439#true} {11477#(<= (mod main_~pat_len~0 4294967296) 1)} #160#return; {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} assume 0 != #t~ret14 % 256;havoc #t~ret14; {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,546 INFO L256 TraceCheckUtils]: 24: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} call __VERIFIER_assert((if ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296 then 1 else 0)); {11439#true} is VALID [2018-11-23 11:58:16,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {11439#true} ~cond := #in~cond; {11439#true} is VALID [2018-11-23 11:58:16,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {11439#true} assume !(0 == ~cond); {11439#true} is VALID [2018-11-23 11:58:16,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {11439#true} assume true; {11439#true} is VALID [2018-11-23 11:58:16,547 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {11439#true} {11477#(<= (mod main_~pat_len~0 4294967296) 1)} #162#return; {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,547 INFO L273 TraceCheckUtils]: 29: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} ~different~0 := #t~nondet15;havoc #t~nondet15; {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {11477#(<= (mod main_~pat_len~0 4294967296) 1)} is VALID [2018-11-23 11:58:16,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {11477#(<= (mod main_~pat_len~0 4294967296) 1)} ~i~1 := 0; {11547#(and (<= (mod main_~pat_len~0 4294967296) 1) (= main_~i~1 0))} is VALID [2018-11-23 11:58:16,549 INFO L273 TraceCheckUtils]: 32: Hoare triple {11547#(and (<= (mod main_~pat_len~0 4294967296) 1) (= main_~i~1 0))} assume !!(~i~1 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~1 % 4294967296 < ~a_len~0 % 4294967296); {11547#(and (<= (mod main_~pat_len~0 4294967296) 1) (= main_~i~1 0))} is VALID [2018-11-23 11:58:16,549 INFO L273 TraceCheckUtils]: 33: Hoare triple {11547#(and (<= (mod main_~pat_len~0 4294967296) 1) (= main_~i~1 0))} assume ~i~1 % 4294967296 < ~different~0 % 4294967296;call #t~mem17 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~1, 4);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);assume 0 != (if #t~mem17 == #t~mem18 then 1 else 0);havoc #t~mem18;havoc #t~mem17; {11547#(and (<= (mod main_~pat_len~0 4294967296) 1) (= main_~i~1 0))} is VALID [2018-11-23 11:58:16,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {11547#(and (<= (mod main_~pat_len~0 4294967296) 1) (= main_~i~1 0))} #t~post16 := ~i~1;~i~1 := 1 + #t~post16;havoc #t~post16; {11557#(and (= main_~i~1 1) (<= (mod main_~pat_len~0 4294967296) 1))} is VALID [2018-11-23 11:58:16,550 INFO L273 TraceCheckUtils]: 35: Hoare triple {11557#(and (= main_~i~1 1) (<= (mod main_~pat_len~0 4294967296) 1))} assume !!(~i~1 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~1 % 4294967296 < ~a_len~0 % 4294967296); {11440#false} is VALID [2018-11-23 11:58:16,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {11440#false} assume !(~i~1 % 4294967296 < ~different~0 % 4294967296); {11440#false} is VALID [2018-11-23 11:58:16,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {11440#false} assume !(~i~1 % 4294967296 == ~different~0 % 4294967296); {11440#false} is VALID [2018-11-23 11:58:16,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {11440#false} assume ~i~1 % 4294967296 > ~different~0 % 4294967296;call #t~mem21 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~1, 4);call #t~mem22 := read~int(~a~0.base, ~a~0.offset + 4 * (~i~1 - 1), 4); {11440#false} is VALID [2018-11-23 11:58:16,551 INFO L256 TraceCheckUtils]: 39: Hoare triple {11440#false} call __VERIFIER_assert((if #t~mem21 == #t~mem22 then 1 else 0)); {11440#false} is VALID [2018-11-23 11:58:16,551 INFO L273 TraceCheckUtils]: 40: Hoare triple {11440#false} ~cond := #in~cond; {11440#false} is VALID [2018-11-23 11:58:16,551 INFO L273 TraceCheckUtils]: 41: Hoare triple {11440#false} assume 0 == ~cond; {11440#false} is VALID [2018-11-23 11:58:16,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {11440#false} assume !false; {11440#false} is VALID [2018-11-23 11:58:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:58:16,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:16,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:58:16,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 11:58:16,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:16,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:58:16,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:16,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:58:16,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:58:16,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:58:16,650 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand 14 states. [2018-11-23 11:58:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:19,207 INFO L93 Difference]: Finished difference Result 198 states and 255 transitions. [2018-11-23 11:58:19,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:58:19,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 11:58:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 148 transitions. [2018-11-23 11:58:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 148 transitions. [2018-11-23 11:58:19,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 148 transitions. [2018-11-23 11:58:19,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:19,385 INFO L225 Difference]: With dead ends: 198 [2018-11-23 11:58:19,385 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:58:19,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:58:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:58:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2018-11-23 11:58:19,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:19,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 123 states. [2018-11-23 11:58:19,869 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 123 states. [2018-11-23 11:58:19,869 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 123 states. [2018-11-23 11:58:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:19,871 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2018-11-23 11:58:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 172 transitions. [2018-11-23 11:58:19,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:19,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:19,872 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 133 states. [2018-11-23 11:58:19,872 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 133 states. [2018-11-23 11:58:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:19,874 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2018-11-23 11:58:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 172 transitions. [2018-11-23 11:58:19,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:19,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:19,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:19,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:58:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 159 transitions. [2018-11-23 11:58:19,878 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 159 transitions. Word has length 43 [2018-11-23 11:58:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:19,878 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 159 transitions. [2018-11-23 11:58:19,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:58:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 159 transitions. [2018-11-23 11:58:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:58:19,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:19,879 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:19,879 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:19,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1276109268, now seen corresponding path program 1 times [2018-11-23 11:58:19,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:19,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:19,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:19,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:19,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:20,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {12298#true} call ULTIMATE.init(); {12298#true} is VALID [2018-11-23 11:58:20,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {12298#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12298#true} is VALID [2018-11-23 11:58:20,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {12298#true} assume true; {12298#true} is VALID [2018-11-23 11:58:20,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12298#true} {12298#true} #156#return; {12298#true} is VALID [2018-11-23 11:58:20,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {12298#true} call #t~ret28 := main(); {12298#true} is VALID [2018-11-23 11:58:20,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {12298#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {12298#true} is VALID [2018-11-23 11:58:20,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {12298#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {12298#true} is VALID [2018-11-23 11:58:20,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {12298#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {12298#true} is VALID [2018-11-23 11:58:20,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {12298#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {12298#true} is VALID [2018-11-23 11:58:20,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {12298#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {12298#true} is VALID [2018-11-23 11:58:20,192 INFO L273 TraceCheckUtils]: 10: Hoare triple {12298#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {12298#true} is VALID [2018-11-23 11:58:20,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {12298#true} ~j~1 := 0; {12298#true} is VALID [2018-11-23 11:58:20,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {12298#true} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {12300#(and (<= main_~j~1 (+ (* 4294967296 (div main_~j~1 4294967296)) 4294967294)) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} is VALID [2018-11-23 11:58:20,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {12300#(and (<= main_~j~1 (+ (* 4294967296 (div main_~j~1 4294967296)) 4294967294)) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {12301#(and (<= main_~j~1 (+ (* 4294967296 (div (+ main_~j~1 (- 1)) 4294967296)) 4294967295)) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} is VALID [2018-11-23 11:58:20,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {12301#(and (<= main_~j~1 (+ (* 4294967296 (div (+ main_~j~1 (- 1)) 4294967296)) 4294967295)) (<= (+ (* 4294967296 (div main_~a_len~0 4294967296)) 1) main_~a_len~0))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} is VALID [2018-11-23 11:58:20,198 INFO L273 TraceCheckUtils]: 15: Hoare triple {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} is VALID [2018-11-23 11:58:20,198 INFO L273 TraceCheckUtils]: 16: Hoare triple {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} is VALID [2018-11-23 11:58:20,199 INFO L256 TraceCheckUtils]: 17: Hoare triple {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {12298#true} is VALID [2018-11-23 11:58:20,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {12298#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {12298#true} is VALID [2018-11-23 11:58:20,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {12298#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {12298#true} is VALID [2018-11-23 11:58:20,199 INFO L273 TraceCheckUtils]: 20: Hoare triple {12298#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {12298#true} is VALID [2018-11-23 11:58:20,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {12298#true} assume !(#t~mem4 != #t~mem5);havoc #t~mem5;havoc #t~mem4; {12298#true} is VALID [2018-11-23 11:58:20,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {12298#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12298#true} is VALID [2018-11-23 11:58:20,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {12298#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {12298#true} is VALID [2018-11-23 11:58:20,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {12298#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {12298#true} is VALID [2018-11-23 11:58:20,200 INFO L273 TraceCheckUtils]: 25: Hoare triple {12298#true} assume 0 == ~shift~0;~shift~0 := 1; {12298#true} is VALID [2018-11-23 11:58:20,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {12298#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12298#true} is VALID [2018-11-23 11:58:20,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {12298#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {12298#true} is VALID [2018-11-23 11:58:20,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {12298#true} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {12298#true} is VALID [2018-11-23 11:58:20,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {12298#true} assume true; {12298#true} is VALID [2018-11-23 11:58:20,202 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {12298#true} {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} #160#return; {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} is VALID [2018-11-23 11:58:20,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} is VALID [2018-11-23 11:58:20,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {12302#(<= (div main_~j~1 4294967296) (div (+ (* 4294967296 (div main_~j~1 4294967296)) (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2)))) 4294967296))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {12303#(and (<= 0 (div (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2))) 4294967296)) (= main_~i~2 0))} is VALID [2018-11-23 11:58:20,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {12303#(and (<= 0 (div (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2))) 4294967296)) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {12303#(and (<= 0 (div (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2))) 4294967296)) (= main_~i~2 0))} is VALID [2018-11-23 11:58:20,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {12303#(and (<= 0 (div (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2))) 4294967296)) (= main_~i~2 0))} assume !(#t~mem24 != #t~mem25);havoc #t~mem24;havoc #t~mem25; {12303#(and (<= 0 (div (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2))) 4294967296)) (= main_~i~2 0))} is VALID [2018-11-23 11:58:20,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {12303#(and (<= 0 (div (+ main_~a_len~0 (+ (* (- 4294967296) (div main_~a_len~0 4294967296)) (- 2))) 4294967296)) (= main_~i~2 0))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {12304#(and (< 0 (+ (div main_~i~2 4294967296) 1)) (<= (+ main_~i~2 (* 4294967296 (div main_~a_len~0 4294967296))) main_~a_len~0) (<= (+ main_~i~2 (* 4294967296 (div main_~a_len~0 4294967296)) 1) (+ main_~a_len~0 (* 4294967296 (div main_~i~2 4294967296)))))} is VALID [2018-11-23 11:58:20,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {12304#(and (< 0 (+ (div main_~i~2 4294967296) 1)) (<= (+ main_~i~2 (* 4294967296 (div main_~a_len~0 4294967296))) main_~a_len~0) (<= (+ main_~i~2 (* 4294967296 (div main_~a_len~0 4294967296)) 1) (+ main_~a_len~0 (* 4294967296 (div main_~i~2 4294967296)))))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {12305#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296))))} is VALID [2018-11-23 11:58:20,207 INFO L273 TraceCheckUtils]: 37: Hoare triple {12305#(<= (+ main_~pat_len~0 (* 4294967296 (div main_~a_len~0 4294967296))) (+ main_~a_len~0 (* 4294967296 (div main_~pat_len~0 4294967296))))} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {12299#false} is VALID [2018-11-23 11:58:20,208 INFO L256 TraceCheckUtils]: 38: Hoare triple {12299#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {12299#false} is VALID [2018-11-23 11:58:20,208 INFO L273 TraceCheckUtils]: 39: Hoare triple {12299#false} ~cond := #in~cond; {12299#false} is VALID [2018-11-23 11:58:20,208 INFO L273 TraceCheckUtils]: 40: Hoare triple {12299#false} assume 0 == ~cond; {12299#false} is VALID [2018-11-23 11:58:20,208 INFO L273 TraceCheckUtils]: 41: Hoare triple {12299#false} assume !false; {12299#false} is VALID [2018-11-23 11:58:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:58:20,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:20,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:20,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:20,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:20,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {12298#true} call ULTIMATE.init(); {12298#true} is VALID [2018-11-23 11:58:20,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {12298#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12298#true} is VALID [2018-11-23 11:58:20,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {12298#true} assume true; {12298#true} is VALID [2018-11-23 11:58:20,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12298#true} {12298#true} #156#return; {12298#true} is VALID [2018-11-23 11:58:20,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {12298#true} call #t~ret28 := main(); {12298#true} is VALID [2018-11-23 11:58:20,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {12298#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {12324#(= main_~j~0 0)} is VALID [2018-11-23 11:58:20,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {12324#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {12324#(= main_~j~0 0)} is VALID [2018-11-23 11:58:20,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {12324#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {12331#(= main_~j~0 1)} is VALID [2018-11-23 11:58:20,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {12331#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {12335#(< 1 (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:58:20,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {12335#(< 1 (mod main_~pat_len~0 4294967296))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {12335#(< 1 (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:58:20,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {12335#(< 1 (mod main_~pat_len~0 4294967296))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {12335#(< 1 (mod main_~pat_len~0 4294967296))} is VALID [2018-11-23 11:58:20,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {12335#(< 1 (mod main_~pat_len~0 4294967296))} ~j~1 := 0; {12345#(and (< 1 (mod main_~pat_len~0 4294967296)) (= main_~j~1 0))} is VALID [2018-11-23 11:58:20,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {12345#(and (< 1 (mod main_~pat_len~0 4294967296)) (= main_~j~1 0))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {12345#(and (< 1 (mod main_~pat_len~0 4294967296)) (= main_~j~1 0))} is VALID [2018-11-23 11:58:20,476 INFO L273 TraceCheckUtils]: 13: Hoare triple {12345#(and (< 1 (mod main_~pat_len~0 4294967296)) (= main_~j~1 0))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {12352#(and (< 1 (mod main_~pat_len~0 4294967296)) (= main_~j~1 1))} is VALID [2018-11-23 11:58:20,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {12352#(and (< 1 (mod main_~pat_len~0 4294967296)) (= main_~j~1 1))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} is VALID [2018-11-23 11:58:20,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} is VALID [2018-11-23 11:58:20,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} is VALID [2018-11-23 11:58:20,479 INFO L256 TraceCheckUtils]: 17: Hoare triple {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {12298#true} is VALID [2018-11-23 11:58:20,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {12298#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {12298#true} is VALID [2018-11-23 11:58:20,479 INFO L273 TraceCheckUtils]: 19: Hoare triple {12298#true} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {12298#true} is VALID [2018-11-23 11:58:20,479 INFO L273 TraceCheckUtils]: 20: Hoare triple {12298#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {12298#true} is VALID [2018-11-23 11:58:20,479 INFO L273 TraceCheckUtils]: 21: Hoare triple {12298#true} assume !(#t~mem4 != #t~mem5);havoc #t~mem5;havoc #t~mem4; {12298#true} is VALID [2018-11-23 11:58:20,480 INFO L273 TraceCheckUtils]: 22: Hoare triple {12298#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12298#true} is VALID [2018-11-23 11:58:20,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {12298#true} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {12298#true} is VALID [2018-11-23 11:58:20,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {12298#true} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {12298#true} is VALID [2018-11-23 11:58:20,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {12298#true} assume 0 == ~shift~0;~shift~0 := 1; {12298#true} is VALID [2018-11-23 11:58:20,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {12298#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12298#true} is VALID [2018-11-23 11:58:20,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {12298#true} assume !(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296); {12298#true} is VALID [2018-11-23 11:58:20,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {12298#true} assume ~pat_length % 4294967296 > ~a_length % 4294967296 && 1 == ~shift~0;#res := 0; {12298#true} is VALID [2018-11-23 11:58:20,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {12298#true} assume true; {12298#true} is VALID [2018-11-23 11:58:20,482 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {12298#true} {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} #160#return; {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} is VALID [2018-11-23 11:58:20,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} is VALID [2018-11-23 11:58:20,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {12356#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {12411#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)) (= main_~i~2 0))} is VALID [2018-11-23 11:58:20,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {12411#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {12411#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)) (= main_~i~2 0))} is VALID [2018-11-23 11:58:20,484 INFO L273 TraceCheckUtils]: 34: Hoare triple {12411#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)) (= main_~i~2 0))} assume !(#t~mem24 != #t~mem25);havoc #t~mem24;havoc #t~mem25; {12411#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)) (= main_~i~2 0))} is VALID [2018-11-23 11:58:20,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {12411#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)) (= main_~i~2 0))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {12421#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)) (= main_~i~2 1))} is VALID [2018-11-23 11:58:20,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {12421#(and (< 1 (mod main_~pat_len~0 4294967296)) (< 1 (mod main_~a_len~0 4294967296)) (= main_~i~2 1))} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {12299#false} is VALID [2018-11-23 11:58:20,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {12299#false} assume ~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296;#t~pre27 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre27; {12299#false} is VALID [2018-11-23 11:58:20,486 INFO L256 TraceCheckUtils]: 38: Hoare triple {12299#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {12299#false} is VALID [2018-11-23 11:58:20,487 INFO L273 TraceCheckUtils]: 39: Hoare triple {12299#false} ~cond := #in~cond; {12299#false} is VALID [2018-11-23 11:58:20,487 INFO L273 TraceCheckUtils]: 40: Hoare triple {12299#false} assume 0 == ~cond; {12299#false} is VALID [2018-11-23 11:58:20,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {12299#false} assume !false; {12299#false} is VALID [2018-11-23 11:58:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:58:20,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:20,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-11-23 11:58:20,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-23 11:58:20,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:20,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:58:20,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:20,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:58:20,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:58:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:20,583 INFO L87 Difference]: Start difference. First operand 123 states and 159 transitions. Second operand 16 states. [2018-11-23 11:58:28,549 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-11-23 11:58:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:48,886 INFO L93 Difference]: Finished difference Result 254 states and 342 transitions. [2018-11-23 11:58:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:58:48,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-23 11:58:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 151 transitions. [2018-11-23 11:58:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 151 transitions. [2018-11-23 11:58:48,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 151 transitions. [2018-11-23 11:58:49,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:49,137 INFO L225 Difference]: With dead ends: 254 [2018-11-23 11:58:49,137 INFO L226 Difference]: Without dead ends: 246 [2018-11-23 11:58:49,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:58:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-23 11:58:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 126. [2018-11-23 11:58:49,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:49,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand 126 states. [2018-11-23 11:58:49,766 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 126 states. [2018-11-23 11:58:49,766 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 126 states. [2018-11-23 11:58:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,773 INFO L93 Difference]: Finished difference Result 246 states and 331 transitions. [2018-11-23 11:58:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 331 transitions. [2018-11-23 11:58:49,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:49,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:49,774 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 246 states. [2018-11-23 11:58:49,774 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 246 states. [2018-11-23 11:58:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,781 INFO L93 Difference]: Finished difference Result 246 states and 331 transitions. [2018-11-23 11:58:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 331 transitions. [2018-11-23 11:58:49,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:49,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:49,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:49,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:58:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 162 transitions. [2018-11-23 11:58:49,785 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 162 transitions. Word has length 42 [2018-11-23 11:58:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:49,785 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 162 transitions. [2018-11-23 11:58:49,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:58:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 162 transitions. [2018-11-23 11:58:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:58:49,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:49,786 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:49,786 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:49,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash 853110628, now seen corresponding path program 1 times [2018-11-23 11:58:49,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:49,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:49,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:51,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {13448#true} call ULTIMATE.init(); {13448#true} is VALID [2018-11-23 11:58:51,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {13448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13448#true} is VALID [2018-11-23 11:58:51,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {13448#true} assume true; {13448#true} is VALID [2018-11-23 11:58:51,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13448#true} {13448#true} #156#return; {13448#true} is VALID [2018-11-23 11:58:51,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {13448#true} call #t~ret28 := main(); {13448#true} is VALID [2018-11-23 11:58:51,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {13448#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {13450#(and (= 0 main_~pat~0.offset) (= main_~j~0 0) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {13450#(and (= 0 main_~pat~0.offset) (= main_~j~0 0) (= main_~a~0.offset 0))} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {13450#(and (= 0 main_~pat~0.offset) (= main_~j~0 0) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {13450#(and (= 0 main_~pat~0.offset) (= main_~j~0 0) (= main_~a~0.offset 0))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {13451#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {13451#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {13451#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {13451#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} ~j~1 := 0; {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} is VALID [2018-11-23 11:58:51,075 INFO L256 TraceCheckUtils]: 17: Hoare triple {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {13448#true} is VALID [2018-11-23 11:58:51,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {13448#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {13453#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (or (and (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))))} is VALID [2018-11-23 11:58:51,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {13453#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (or (and (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))))} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {13454#(and (or (and (= is_relaxed_prefix_~i~0 0) (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))) (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)))} is VALID [2018-11-23 11:58:51,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {13454#(and (or (and (= is_relaxed_prefix_~i~0 0) (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))) (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {13454#(and (or (and (= is_relaxed_prefix_~i~0 0) (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))) (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)))} is VALID [2018-11-23 11:58:51,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {13454#(and (or (and (= is_relaxed_prefix_~i~0 0) (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))) (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {13454#(and (or (and (= is_relaxed_prefix_~i~0 0) (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))) (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)))} is VALID [2018-11-23 11:58:51,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {13454#(and (or (and (= is_relaxed_prefix_~i~0 0) (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))) (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)))} assume 0 == ~shift~0;~shift~0 := 1; {13455#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (or (and (= is_relaxed_prefix_~i~0 0) (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (= is_relaxed_prefix_~shift~0 1) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))))} is VALID [2018-11-23 11:58:51,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {13455#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (or (and (= is_relaxed_prefix_~i~0 0) (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (= is_relaxed_prefix_~shift~0 1) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|)))) (not (= is_relaxed_prefix_~pat.offset 0))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13456#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (or (and (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= (* 4 is_relaxed_prefix_~shift~0) (+ is_relaxed_prefix_~a.offset (* 4 is_relaxed_prefix_~i~0))) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|))) (= is_relaxed_prefix_~shift~0 1)) (not (= is_relaxed_prefix_~pat.offset 0))))} is VALID [2018-11-23 11:58:51,084 INFO L273 TraceCheckUtils]: 24: Hoare triple {13456#(and (or (= is_relaxed_prefix_~pat.offset 0) (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset)) (or (and (or (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= is_relaxed_prefix_~a.offset 0)) (or (not (= is_relaxed_prefix_~a.offset 0)) (and (= is_relaxed_prefix_~a.base |is_relaxed_prefix_#in~a.base|) (= (* 4 is_relaxed_prefix_~shift~0) (+ is_relaxed_prefix_~a.offset (* 4 is_relaxed_prefix_~i~0))) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|))) (= is_relaxed_prefix_~shift~0 1)) (not (= is_relaxed_prefix_~pat.offset 0))))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {13457#(or (and (or (and (= |is_relaxed_prefix_#t~mem4| (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (- (- 4)))) (= |is_relaxed_prefix_#t~mem5| (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0))) (not (= |is_relaxed_prefix_#in~a.offset| 0))) (= is_relaxed_prefix_~shift~0 1)) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} is VALID [2018-11-23 11:58:51,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {13457#(or (and (or (and (= |is_relaxed_prefix_#t~mem4| (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (- (- 4)))) (= |is_relaxed_prefix_#t~mem5| (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0))) (not (= |is_relaxed_prefix_#in~a.offset| 0))) (= is_relaxed_prefix_~shift~0 1)) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {13458#(or (and (or (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (- (- 4))))) (not (= |is_relaxed_prefix_#in~a.offset| 0))) (= is_relaxed_prefix_~shift~0 1)) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} is VALID [2018-11-23 11:58:51,086 INFO L273 TraceCheckUtils]: 26: Hoare triple {13458#(or (and (or (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (- (- 4))))) (not (= |is_relaxed_prefix_#in~a.offset| 0))) (= is_relaxed_prefix_~shift~0 1)) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} assume !(0 == ~shift~0);#res := 0; {13459#(or (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (- (- 4))))) (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} is VALID [2018-11-23 11:58:51,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {13459#(or (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (- (- 4))))) (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} assume true; {13459#(or (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (- (- 4))))) (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} is VALID [2018-11-23 11:58:51,089 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {13459#(or (not (= (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) 0) (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (- (- 4))))) (not (= |is_relaxed_prefix_#in~a.offset| 0)) (not (= |is_relaxed_prefix_#in~pat.offset| 0)))} {13452#(and (= 0 main_~pat~0.offset) (= main_~a~0.offset 0))} #160#return; {13460#(and (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))))} is VALID [2018-11-23 11:58:51,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {13460#(and (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {13460#(and (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))))} is VALID [2018-11-23 11:58:51,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {13460#(and (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {13461#(and (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (= main_~differences~0 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))) (= main_~i~2 0))} is VALID [2018-11-23 11:58:51,092 INFO L273 TraceCheckUtils]: 31: Hoare triple {13461#(and (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (= main_~differences~0 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {13461#(and (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (= main_~differences~0 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))) (= main_~i~2 0))} is VALID [2018-11-23 11:58:51,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {13461#(and (= main_~pat~0.offset 0) (= main_~a~0.offset 0) (= main_~differences~0 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))) (= main_~i~2 0))} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {13462#(and (= main_~pat~0.offset 0) (<= 1 main_~differences~0) (= main_~a~0.offset 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))) (<= main_~differences~0 1) (= main_~i~2 0))} is VALID [2018-11-23 11:58:51,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {13462#(and (= main_~pat~0.offset 0) (<= 1 main_~differences~0) (= main_~a~0.offset 0) (not (= (select (select |#memory_int| main_~a~0.base) 0) (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset (* 4 1))))) (<= main_~differences~0 1) (= main_~i~2 0))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {13463#(and (<= 4294967296 (+ main_~i~2 (* 4294967295 main_~differences~0))) (= main_~pat~0.offset 0) (not (= (select (select |#memory_int| main_~a~0.base) (+ (* (- 17179869184) (div (+ main_~i~2 (* 4294967295 main_~differences~0)) 4294967296)) (* 4 main_~i~2) main_~a~0.offset (* 17179869180 main_~differences~0))) (select (select |#memory_int| main_~pat~0.base) (+ (* 4 main_~i~2) main_~pat~0.offset)))) (= main_~a~0.offset 0) (<= (+ main_~i~2 (* 4294967295 main_~differences~0)) 4294967296))} is VALID [2018-11-23 11:58:51,098 INFO L273 TraceCheckUtils]: 34: Hoare triple {13463#(and (<= 4294967296 (+ main_~i~2 (* 4294967295 main_~differences~0))) (= main_~pat~0.offset 0) (not (= (select (select |#memory_int| main_~a~0.base) (+ (* (- 17179869184) (div (+ main_~i~2 (* 4294967295 main_~differences~0)) 4294967296)) (* 4 main_~i~2) main_~a~0.offset (* 17179869180 main_~differences~0))) (select (select |#memory_int| main_~pat~0.base) (+ (* 4 main_~i~2) main_~pat~0.offset)))) (= main_~a~0.offset 0) (<= (+ main_~i~2 (* 4294967295 main_~differences~0)) 4294967296))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {13464#(and (<= 1 (div (+ main_~i~2 (* 4294967295 main_~differences~0)) 4294967296)) (not (= |main_#t~mem25| |main_#t~mem24|)))} is VALID [2018-11-23 11:58:51,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {13464#(and (<= 1 (div (+ main_~i~2 (* 4294967295 main_~differences~0)) 4294967296)) (not (= |main_#t~mem25| |main_#t~mem24|)))} assume !(#t~mem24 != #t~mem25);havoc #t~mem24;havoc #t~mem25; {13449#false} is VALID [2018-11-23 11:58:51,099 INFO L273 TraceCheckUtils]: 36: Hoare triple {13449#false} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {13449#false} is VALID [2018-11-23 11:58:51,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {13449#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {13449#false} is VALID [2018-11-23 11:58:51,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {13449#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {13449#false} is VALID [2018-11-23 11:58:51,099 INFO L256 TraceCheckUtils]: 39: Hoare triple {13449#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {13449#false} is VALID [2018-11-23 11:58:51,100 INFO L273 TraceCheckUtils]: 40: Hoare triple {13449#false} ~cond := #in~cond; {13449#false} is VALID [2018-11-23 11:58:51,100 INFO L273 TraceCheckUtils]: 41: Hoare triple {13449#false} assume 0 == ~cond; {13449#false} is VALID [2018-11-23 11:58:51,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {13449#false} assume !false; {13449#false} is VALID [2018-11-23 11:58:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:58:51,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:51,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:51,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:51,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:51,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 11:58:51,664 INFO L478 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 27 treesize of output 16 [2018-11-23 11:58:51,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:51,685 INFO L478 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 16 treesize of output 9 [2018-11-23 11:58:51,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:51,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-11-23 11:58:51,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:58:51,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:58:51,733 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-23 11:58:51,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:31, output treesize:4 [2018-11-23 11:58:51,737 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:58:51,737 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pat~0.base, main_~pat~0.offset, main_~a~0.base, main_~a~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (.cse1 (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)))) (and (= |main_#t~mem25| .cse0) (not (= .cse1 .cse0)) (= |main_#t~mem24| .cse1))) [2018-11-23 11:58:51,737 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_#t~mem25| |main_#t~mem24|)) [2018-11-23 11:58:51,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {13448#true} call ULTIMATE.init(); {13448#true} is VALID [2018-11-23 11:58:51,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {13448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13448#true} is VALID [2018-11-23 11:58:51,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {13448#true} assume true; {13448#true} is VALID [2018-11-23 11:58:51,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13448#true} {13448#true} #156#return; {13448#true} is VALID [2018-11-23 11:58:51,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {13448#true} call #t~ret28 := main(); {13448#true} is VALID [2018-11-23 11:58:51,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {13448#true} ~pat_len~0 := #t~nondet6;havoc #t~nondet6;~a_len~0 := #t~nondet7;havoc #t~nondet7;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.alloc(4 * ~pat_len~0);~pat~0.base, ~pat~0.offset := #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4 * ~a_len~0);~a~0.base, ~a~0.offset := #t~malloc9.base, #t~malloc9.offset;~j~0 := 0; {13483#(= main_~j~0 0)} is VALID [2018-11-23 11:58:51,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {13483#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {13483#(= main_~j~0 0)} is VALID [2018-11-23 11:58:51,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {13483#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {13448#true} is VALID [2018-11-23 11:58:51,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {13448#true} assume !!(~j~0 % 4294967296 < ~pat_len~0 % 4294967296);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~pat~0.base, ~pat~0.offset + 4 * ~j~0, 4);havoc #t~nondet11; {13448#true} is VALID [2018-11-23 11:58:51,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {13448#true} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {13448#true} is VALID [2018-11-23 11:58:51,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {13448#true} assume !(~j~0 % 4294967296 < ~pat_len~0 % 4294967296); {13448#true} is VALID [2018-11-23 11:58:51,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {13448#true} ~j~1 := 0; {13448#true} is VALID [2018-11-23 11:58:51,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {13448#true} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {13448#true} is VALID [2018-11-23 11:58:51,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {13448#true} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {13448#true} is VALID [2018-11-23 11:58:51,799 INFO L273 TraceCheckUtils]: 14: Hoare triple {13448#true} assume !!(~j~1 % 4294967296 < ~a_len~0 % 4294967296);assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~a~0.base, ~a~0.offset + 4 * ~j~1, 4);havoc #t~nondet13; {13448#true} is VALID [2018-11-23 11:58:51,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {13448#true} #t~post12 := ~j~1;~j~1 := 1 + #t~post12;havoc #t~post12; {13448#true} is VALID [2018-11-23 11:58:51,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {13448#true} assume !(~j~1 % 4294967296 < ~a_len~0 % 4294967296); {13448#true} is VALID [2018-11-23 11:58:51,799 INFO L256 TraceCheckUtils]: 17: Hoare triple {13448#true} call #t~ret14 := is_relaxed_prefix(~pat~0.base, ~pat~0.offset, ~pat_len~0, ~a~0.base, ~a~0.offset, ~a_len~0); {13448#true} is VALID [2018-11-23 11:58:51,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {13448#true} ~pat.base, ~pat.offset := #in~pat.base, #in~pat.offset;~pat_length := #in~pat_length;~a.base, ~a.offset := #in~a.base, #in~a.offset;~a_length := #in~a_length; {13523#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} is VALID [2018-11-23 11:58:51,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {13523#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} assume !(~pat_length % 4294967296 > (1 + ~a_length) % 4294967296);~shift~0 := 0;~i~0 := 0; {13527#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} is VALID [2018-11-23 11:58:51,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {13527#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {13527#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} is VALID [2018-11-23 11:58:51,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {13527#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {13527#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} is VALID [2018-11-23 11:58:51,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {13527#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} assume 0 == ~shift~0;~shift~0 := 1; {13537#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= 1 is_relaxed_prefix_~shift~0) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} is VALID [2018-11-23 11:58:51,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {13537#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= 1 is_relaxed_prefix_~shift~0) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= 0 is_relaxed_prefix_~i~0) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13541#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= 1 is_relaxed_prefix_~shift~0) (= 1 is_relaxed_prefix_~i~0) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} is VALID [2018-11-23 11:58:51,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {13541#(and (= |is_relaxed_prefix_#in~pat.offset| is_relaxed_prefix_~pat.offset) (= 1 is_relaxed_prefix_~shift~0) (= 1 is_relaxed_prefix_~i~0) (= is_relaxed_prefix_~pat.base |is_relaxed_prefix_#in~pat.base|) (= |is_relaxed_prefix_#in~a.offset| is_relaxed_prefix_~a.offset) (= |is_relaxed_prefix_#in~a.base| is_relaxed_prefix_~a.base))} assume !!(~i~0 % 4294967296 < ~pat_length % 4294967296 && ~i~0 % 4294967296 < ~a_length % 4294967296);call #t~mem4 := read~int(~pat.base, ~pat.offset + 4 * ~i~0, 4);call #t~mem5 := read~int(~a.base, ~a.offset + 4 * (~i~0 - ~shift~0), 4); {13545#(and (= |is_relaxed_prefix_#t~mem4| (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (+ |is_relaxed_prefix_#in~pat.offset| 4))) (= |is_relaxed_prefix_#t~mem5| (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:58:51,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {13545#(and (= |is_relaxed_prefix_#t~mem4| (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (+ |is_relaxed_prefix_#in~pat.offset| 4))) (= |is_relaxed_prefix_#t~mem5| (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} assume #t~mem4 != #t~mem5;havoc #t~mem5;havoc #t~mem4; {13549#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (+ |is_relaxed_prefix_#in~pat.offset| 4)) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:58:51,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {13549#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (+ |is_relaxed_prefix_#in~pat.offset| 4)) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} assume !(0 == ~shift~0);#res := 0; {13549#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (+ |is_relaxed_prefix_#in~pat.offset| 4)) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:58:51,815 INFO L273 TraceCheckUtils]: 27: Hoare triple {13549#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (+ |is_relaxed_prefix_#in~pat.offset| 4)) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} assume true; {13549#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (+ |is_relaxed_prefix_#in~pat.offset| 4)) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} is VALID [2018-11-23 11:58:51,817 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {13549#(not (= (select (select |#memory_int| |is_relaxed_prefix_#in~pat.base|) (+ |is_relaxed_prefix_#in~pat.offset| 4)) (select (select |#memory_int| |is_relaxed_prefix_#in~a.base|) |is_relaxed_prefix_#in~a.offset|)))} {13448#true} #160#return; {13559#(not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:58:51,817 INFO L273 TraceCheckUtils]: 29: Hoare triple {13559#(not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~ret14 % 256);havoc #t~ret14; {13559#(not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:58:51,819 INFO L273 TraceCheckUtils]: 30: Hoare triple {13559#(not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume ~pat_len~0 % 4294967296 <= (1 + ~a_len~0) % 4294967296;~differences~0 := 0;~i~2 := 0; {13566#(and (not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~differences~0 0) (= main_~i~2 0))} is VALID [2018-11-23 11:58:51,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {13566#(and (not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~differences~0 0) (= main_~i~2 0))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {13566#(and (not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~differences~0 0) (= main_~i~2 0))} is VALID [2018-11-23 11:58:51,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {13566#(and (not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~differences~0 0) (= main_~i~2 0))} assume #t~mem24 != #t~mem25;havoc #t~mem24;havoc #t~mem25;#t~pre26 := 1 + ~differences~0;~differences~0 := 1 + ~differences~0;havoc #t~pre26; {13573#(and (not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~differences~0 1) (= main_~i~2 0))} is VALID [2018-11-23 11:58:51,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {13573#(and (not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~differences~0 1) (= main_~i~2 0))} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {13577#(and (not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~i~2 1) (= main_~differences~0 1))} is VALID [2018-11-23 11:58:51,823 INFO L273 TraceCheckUtils]: 34: Hoare triple {13577#(and (not (= (select (select |#memory_int| main_~pat~0.base) (+ main_~pat~0.offset 4)) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (= main_~i~2 1) (= main_~differences~0 1))} assume !!(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296);call #t~mem24 := read~int(~pat~0.base, ~pat~0.offset + 4 * ~i~2, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * (if (~i~2 - ~differences~0) % 4294967296 % 4294967296 <= 2147483647 then (~i~2 - ~differences~0) % 4294967296 % 4294967296 else (~i~2 - ~differences~0) % 4294967296 % 4294967296 - 4294967296), 4); {13581#(not (= |main_#t~mem25| |main_#t~mem24|))} is VALID [2018-11-23 11:58:51,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {13581#(not (= |main_#t~mem25| |main_#t~mem24|))} assume !(#t~mem24 != #t~mem25);havoc #t~mem24;havoc #t~mem25; {13449#false} is VALID [2018-11-23 11:58:51,824 INFO L273 TraceCheckUtils]: 36: Hoare triple {13449#false} #t~post23 := ~i~2;~i~2 := 1 + #t~post23;havoc #t~post23; {13449#false} is VALID [2018-11-23 11:58:51,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {13449#false} assume !(~i~2 % 4294967296 < ~pat_len~0 % 4294967296 && ~i~2 % 4294967296 < ~a_len~0 % 4294967296); {13449#false} is VALID [2018-11-23 11:58:51,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {13449#false} assume !(~pat_len~0 % 4294967296 > ~a_len~0 % 4294967296); {13449#false} is VALID [2018-11-23 11:58:51,824 INFO L256 TraceCheckUtils]: 39: Hoare triple {13449#false} call __VERIFIER_assert((if ~differences~0 % 4294967296 > 1 then 1 else 0)); {13449#false} is VALID [2018-11-23 11:58:51,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {13449#false} ~cond := #in~cond; {13449#false} is VALID [2018-11-23 11:58:51,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {13449#false} assume 0 == ~cond; {13449#false} is VALID [2018-11-23 11:58:51,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {13449#false} assume !false; {13449#false} is VALID [2018-11-23 11:58:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:58:51,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:51,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-11-23 11:58:51,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 43 [2018-11-23 11:58:51,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:51,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:58:51,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:51,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:58:51,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:58:51,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:58:51,938 INFO L87 Difference]: Start difference. First operand 126 states and 162 transitions. Second operand 29 states.