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/reducercommutativity/sep05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:16:28,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:16:28,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:16:28,918 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:16:28,919 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:16:28,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:16:28,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:16:28,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:16:28,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:16:28,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:16:28,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:16:28,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:16:28,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:16:28,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:16:28,930 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:16:28,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:16:28,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:16:28,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:16:28,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:16:28,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:16:28,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:16:28,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:16:28,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:16:28,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:16:28,955 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:16:28,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:16:28,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:16:28,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:16:28,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:16:28,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:16:28,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:16:28,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:16:28,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:16:28,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:16:28,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:16:28,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:16:28,965 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 12:16:28,980 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:16:28,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:16:28,981 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:16:28,981 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:16:28,982 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:16:28,982 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:16:28,982 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:16:28,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:16:28,983 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:16:28,983 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:16:28,983 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:16:28,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:16:28,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:16:28,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:16:28,984 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:16:28,984 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:16:28,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:16:28,984 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:16:28,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:16:28,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:16:28,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:16:28,985 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:16:28,985 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:16:28,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:28,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:16:28,986 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:16:28,986 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:16:28,986 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:16:28,986 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:16:28,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:16:28,987 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:16:29,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:16:29,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:16:29,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:16:29,065 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:16:29,065 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:16:29,066 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-11-23 12:16:29,129 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c9dcf55/bd40fb212da64fcebdf730e88d96fea4/FLAGce9be12e1 [2018-11-23 12:16:29,644 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:16:29,645 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep05_true-unreach-call_true-termination.i [2018-11-23 12:16:29,652 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c9dcf55/bd40fb212da64fcebdf730e88d96fea4/FLAGce9be12e1 [2018-11-23 12:16:29,998 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c9dcf55/bd40fb212da64fcebdf730e88d96fea4 [2018-11-23 12:16:30,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:16:30,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:16:30,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:30,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:16:30,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:16:30,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e75a9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30, skipping insertion in model container [2018-11-23 12:16:30,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:16:30,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:16:30,278 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:30,290 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:16:30,319 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:30,338 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:16:30,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30 WrapperNode [2018-11-23 12:16:30,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:30,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:30,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:16:30,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:16:30,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:30,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:16:30,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:16:30,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:16:30,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (1/1) ... [2018-11-23 12:16:30,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:16:30,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:16:30,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:16:30,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:16:30,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (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 12:16:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:16:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:16:30,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:16:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:16:30,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:16:30,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:16:30,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:16:30,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:16:30,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:16:30,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:16:30,597 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2018-11-23 12:16:30,597 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2018-11-23 12:16:31,489 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:16:31,489 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:16:31,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:31 BoogieIcfgContainer [2018-11-23 12:16:31,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:16:31,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:16:31,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:16:31,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:16:31,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:16:30" (1/3) ... [2018-11-23 12:16:31,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ffd708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:31, skipping insertion in model container [2018-11-23 12:16:31,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:30" (2/3) ... [2018-11-23 12:16:31,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ffd708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:31, skipping insertion in model container [2018-11-23 12:16:31,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:31" (3/3) ... [2018-11-23 12:16:31,498 INFO L112 eAbstractionObserver]: Analyzing ICFG sep05_true-unreach-call_true-termination.i [2018-11-23 12:16:31,507 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:16:31,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:16:31,532 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:16:31,567 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:16:31,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:16:31,568 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:16:31,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:16:31,569 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:16:31,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:16:31,569 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:16:31,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:16:31,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:16:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:16:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:31,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:31,600 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:31,603 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:31,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:31,610 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2018-11-23 12:16:31,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:31,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:31,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:31,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:16:31,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:16:31,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:31,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2018-11-23 12:16:31,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret14 := main(); {35#true} is VALID [2018-11-23 12:16:31,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {35#true} is VALID [2018-11-23 12:16:31,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 12:16:31,840 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:31,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {35#true} is VALID [2018-11-23 12:16:31,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:31,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#true} is VALID [2018-11-23 12:16:31,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:31,842 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#true} {36#false} #75#return; {36#false} is VALID [2018-11-23 12:16:31,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36#false} is VALID [2018-11-23 12:16:31,843 INFO L256 TraceCheckUtils]: 14: Hoare triple {36#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:31,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {35#true} is VALID [2018-11-23 12:16:31,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:31,843 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#true} is VALID [2018-11-23 12:16:31,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:31,844 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#true} {36#false} #77#return; {36#false} is VALID [2018-11-23 12:16:31,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {36#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {36#false} is VALID [2018-11-23 12:16:31,844 INFO L273 TraceCheckUtils]: 21: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 12:16:31,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {36#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {36#false} is VALID [2018-11-23 12:16:31,846 INFO L256 TraceCheckUtils]: 23: Hoare triple {36#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:31,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {35#true} is VALID [2018-11-23 12:16:31,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:31,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#true} is VALID [2018-11-23 12:16:31,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:31,850 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#true} {36#false} #79#return; {36#false} is VALID [2018-11-23 12:16:31,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {36#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {36#false} is VALID [2018-11-23 12:16:31,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {36#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36#false} is VALID [2018-11-23 12:16:31,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:16:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:16:31,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:31,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:16:31,872 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:31,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:31,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:16:32,020 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 12:16:32,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:16:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:16:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:16:32,033 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 12:16:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:32,258 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2018-11-23 12:16:32,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:16:32,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:16:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:16:32,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-23 12:16:32,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:32,635 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:16:32,635 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:16:32,639 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 12:16:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:16:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:16:32,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:32,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:32,699 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:32,699 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:32,705 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 12:16:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:32,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:32,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:32,707 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:32,707 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:32,712 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 12:16:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:32,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:32,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:32,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:32,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:16:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 12:16:32,720 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2018-11-23 12:16:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:32,721 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 12:16:32,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:16:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:32,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:32,723 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:32,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:32,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2018-11-23 12:16:32,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:32,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:32,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:32,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:32,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:32,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 12:16:32,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {204#true} is VALID [2018-11-23 12:16:32,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:32,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #71#return; {204#true} is VALID [2018-11-23 12:16:32,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret14 := main(); {204#true} is VALID [2018-11-23 12:16:32,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {206#(= main_~i~1 0)} is VALID [2018-11-23 12:16:32,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#(= main_~i~1 0)} assume !(~i~1 < 5); {205#false} is VALID [2018-11-23 12:16:32,838 INFO L256 TraceCheckUtils]: 7: Hoare triple {205#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {204#true} is VALID [2018-11-23 12:16:32,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {204#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {204#true} is VALID [2018-11-23 12:16:32,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {204#true} assume !(~i~0 < 5); {204#true} is VALID [2018-11-23 12:16:32,839 INFO L273 TraceCheckUtils]: 10: Hoare triple {204#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {204#true} is VALID [2018-11-23 12:16:32,839 INFO L273 TraceCheckUtils]: 11: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:32,840 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {204#true} {205#false} #75#return; {205#false} is VALID [2018-11-23 12:16:32,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {205#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {205#false} is VALID [2018-11-23 12:16:32,840 INFO L256 TraceCheckUtils]: 14: Hoare triple {205#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {204#true} is VALID [2018-11-23 12:16:32,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {204#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {204#true} is VALID [2018-11-23 12:16:32,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {204#true} assume !(~i~0 < 5); {204#true} is VALID [2018-11-23 12:16:32,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {204#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {204#true} is VALID [2018-11-23 12:16:32,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:32,842 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {204#true} {205#false} #77#return; {205#false} is VALID [2018-11-23 12:16:32,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {205#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {205#false} is VALID [2018-11-23 12:16:32,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {205#false} assume !(~i~2 < 4); {205#false} is VALID [2018-11-23 12:16:32,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {205#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {205#false} is VALID [2018-11-23 12:16:32,843 INFO L256 TraceCheckUtils]: 23: Hoare triple {205#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {204#true} is VALID [2018-11-23 12:16:32,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {204#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {204#true} is VALID [2018-11-23 12:16:32,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {204#true} assume !(~i~0 < 5); {204#true} is VALID [2018-11-23 12:16:32,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {204#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {204#true} is VALID [2018-11-23 12:16:32,845 INFO L273 TraceCheckUtils]: 27: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:32,845 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {204#true} {205#false} #79#return; {205#false} is VALID [2018-11-23 12:16:32,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {205#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {205#false} is VALID [2018-11-23 12:16:32,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {205#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {205#false} is VALID [2018-11-23 12:16:32,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 12:16:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:16:32,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:32,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:16:32,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:16:32,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:32,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:16:32,961 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 12:16:32,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:16:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:16:32,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:32,963 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2018-11-23 12:16:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:33,660 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 12:16:33,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:33,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:16:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:16:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:16:33,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 12:16:33,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:33,827 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:16:33,827 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:16:33,829 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 12:16:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:16:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:16:33,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:33,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:33,896 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:33,896 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:33,900 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:16:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:33,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:33,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:33,902 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:16:33,902 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:16:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:33,905 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:16:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:33,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:33,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:33,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:33,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:16:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 12:16:33,910 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2018-11-23 12:16:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:33,910 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 12:16:33,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:16:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:16:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:16:33,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:33,912 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:16:33,913 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:33,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:33,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2018-11-23 12:16:33,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:33,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:33,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:33,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:33,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:34,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 12:16:34,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-23 12:16:34,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:34,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #71#return; {373#true} is VALID [2018-11-23 12:16:34,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret14 := main(); {373#true} is VALID [2018-11-23 12:16:34,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {373#true} is VALID [2018-11-23 12:16:34,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {373#true} is VALID [2018-11-23 12:16:34,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {373#true} is VALID [2018-11-23 12:16:34,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#true} assume !(~i~1 < 5); {373#true} is VALID [2018-11-23 12:16:34,004 INFO L256 TraceCheckUtils]: 9: Hoare triple {373#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {373#true} is VALID [2018-11-23 12:16:34,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {373#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {375#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:34,010 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#(= sep_~i~0 0)} assume !(~i~0 < 5); {374#false} is VALID [2018-11-23 12:16:34,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {374#false} is VALID [2018-11-23 12:16:34,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:34,011 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {374#false} {373#true} #75#return; {374#false} is VALID [2018-11-23 12:16:34,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:34,012 INFO L256 TraceCheckUtils]: 16: Hoare triple {374#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {373#true} is VALID [2018-11-23 12:16:34,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {373#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {373#true} is VALID [2018-11-23 12:16:34,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {373#true} assume !(~i~0 < 5); {373#true} is VALID [2018-11-23 12:16:34,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {373#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {373#true} is VALID [2018-11-23 12:16:34,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:34,013 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {373#true} {374#false} #77#return; {374#false} is VALID [2018-11-23 12:16:34,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {374#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {374#false} is VALID [2018-11-23 12:16:34,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !(~i~2 < 4); {374#false} is VALID [2018-11-23 12:16:34,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {374#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:34,014 INFO L256 TraceCheckUtils]: 25: Hoare triple {374#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {373#true} is VALID [2018-11-23 12:16:34,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {373#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {373#true} is VALID [2018-11-23 12:16:34,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {373#true} assume !(~i~0 < 5); {373#true} is VALID [2018-11-23 12:16:34,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {373#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {373#true} is VALID [2018-11-23 12:16:34,015 INFO L273 TraceCheckUtils]: 29: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:34,016 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {373#true} {374#false} #79#return; {374#false} is VALID [2018-11-23 12:16:34,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {374#false} is VALID [2018-11-23 12:16:34,016 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {374#false} is VALID [2018-11-23 12:16:34,017 INFO L273 TraceCheckUtils]: 33: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 12:16:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:16:34,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:34,020 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 12:16:34,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:34,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:34,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 12:16:34,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-23 12:16:34,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:34,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #71#return; {373#true} is VALID [2018-11-23 12:16:34,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret14 := main(); {373#true} is VALID [2018-11-23 12:16:34,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {373#true} is VALID [2018-11-23 12:16:34,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {373#true} is VALID [2018-11-23 12:16:34,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {373#true} is VALID [2018-11-23 12:16:34,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#true} assume !(~i~1 < 5); {373#true} is VALID [2018-11-23 12:16:34,258 INFO L256 TraceCheckUtils]: 9: Hoare triple {373#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {373#true} is VALID [2018-11-23 12:16:34,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {373#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {409#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:34,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {409#(<= sep_~i~0 0)} assume !(~i~0 < 5); {374#false} is VALID [2018-11-23 12:16:34,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {374#false} is VALID [2018-11-23 12:16:34,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:34,265 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {374#false} {373#true} #75#return; {374#false} is VALID [2018-11-23 12:16:34,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:34,265 INFO L256 TraceCheckUtils]: 16: Hoare triple {374#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {374#false} is VALID [2018-11-23 12:16:34,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {374#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {374#false} is VALID [2018-11-23 12:16:34,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {374#false} assume !(~i~0 < 5); {374#false} is VALID [2018-11-23 12:16:34,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {374#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {374#false} is VALID [2018-11-23 12:16:34,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:34,268 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {374#false} {374#false} #77#return; {374#false} is VALID [2018-11-23 12:16:34,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {374#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {374#false} is VALID [2018-11-23 12:16:34,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !(~i~2 < 4); {374#false} is VALID [2018-11-23 12:16:34,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {374#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:34,269 INFO L256 TraceCheckUtils]: 25: Hoare triple {374#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {374#false} is VALID [2018-11-23 12:16:34,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {374#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {374#false} is VALID [2018-11-23 12:16:34,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {374#false} assume !(~i~0 < 5); {374#false} is VALID [2018-11-23 12:16:34,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {374#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {374#false} is VALID [2018-11-23 12:16:34,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:34,271 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {374#false} {374#false} #79#return; {374#false} is VALID [2018-11-23 12:16:34,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {374#false} is VALID [2018-11-23 12:16:34,271 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {374#false} is VALID [2018-11-23 12:16:34,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 12:16:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:16:34,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:34,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:16:34,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:16:34,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:34,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:16:34,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:34,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:16:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:16:34,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:34,436 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 12:16:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:34,807 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2018-11-23 12:16:34,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:34,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:16:34,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:16:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:16:34,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 12:16:34,928 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 12:16:34,930 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:16:34,931 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:16:34,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:16:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 12:16:34,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:34,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:34,949 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:34,949 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:34,952 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:16:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:16:34,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:34,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:34,954 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-23 12:16:34,954 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-23 12:16:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:34,957 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:16:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:16:34,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:34,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:34,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:34,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:16:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:16:34,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2018-11-23 12:16:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:34,961 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:16:34,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:16:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:16:34,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:34,964 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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 12:16:34,964 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:34,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:34,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2018-11-23 12:16:34,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:34,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:34,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:34,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:34,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:35,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2018-11-23 12:16:35,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {649#true} is VALID [2018-11-23 12:16:35,126 INFO L273 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:35,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2018-11-23 12:16:35,126 INFO L256 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret14 := main(); {649#true} is VALID [2018-11-23 12:16:35,127 INFO L273 TraceCheckUtils]: 5: Hoare triple {649#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {649#true} is VALID [2018-11-23 12:16:35,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {649#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {649#true} is VALID [2018-11-23 12:16:35,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {649#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {649#true} is VALID [2018-11-23 12:16:35,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {649#true} assume !(~i~1 < 5); {649#true} is VALID [2018-11-23 12:16:35,127 INFO L256 TraceCheckUtils]: 9: Hoare triple {649#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {649#true} is VALID [2018-11-23 12:16:35,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {649#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {649#true} is VALID [2018-11-23 12:16:35,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {649#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:35,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {649#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {649#true} is VALID [2018-11-23 12:16:35,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {649#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {649#true} is VALID [2018-11-23 12:16:35,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {649#true} assume !(~i~0 < 5); {649#true} is VALID [2018-11-23 12:16:35,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {649#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {649#true} is VALID [2018-11-23 12:16:35,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:35,129 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {649#true} {649#true} #75#return; {649#true} is VALID [2018-11-23 12:16:35,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {649#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {649#true} is VALID [2018-11-23 12:16:35,130 INFO L256 TraceCheckUtils]: 19: Hoare triple {649#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {649#true} is VALID [2018-11-23 12:16:35,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {649#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {649#true} is VALID [2018-11-23 12:16:35,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {649#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:35,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {649#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {649#true} is VALID [2018-11-23 12:16:35,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {649#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {649#true} is VALID [2018-11-23 12:16:35,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {649#true} assume !(~i~0 < 5); {649#true} is VALID [2018-11-23 12:16:35,132 INFO L273 TraceCheckUtils]: 25: Hoare triple {649#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {649#true} is VALID [2018-11-23 12:16:35,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:35,132 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {649#true} {649#true} #77#return; {649#true} is VALID [2018-11-23 12:16:35,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {649#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {651#(= main_~i~2 0)} is VALID [2018-11-23 12:16:35,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {651#(= main_~i~2 0)} assume !(~i~2 < 4); {650#false} is VALID [2018-11-23 12:16:35,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {650#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {650#false} is VALID [2018-11-23 12:16:35,142 INFO L256 TraceCheckUtils]: 31: Hoare triple {650#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {649#true} is VALID [2018-11-23 12:16:35,142 INFO L273 TraceCheckUtils]: 32: Hoare triple {649#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {649#true} is VALID [2018-11-23 12:16:35,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {649#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:35,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {649#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {649#true} is VALID [2018-11-23 12:16:35,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {649#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {649#true} is VALID [2018-11-23 12:16:35,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {649#true} assume !(~i~0 < 5); {649#true} is VALID [2018-11-23 12:16:35,143 INFO L273 TraceCheckUtils]: 37: Hoare triple {649#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {649#true} is VALID [2018-11-23 12:16:35,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:35,144 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {649#true} {650#false} #79#return; {650#false} is VALID [2018-11-23 12:16:35,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {650#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {650#false} is VALID [2018-11-23 12:16:35,144 INFO L273 TraceCheckUtils]: 41: Hoare triple {650#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {650#false} is VALID [2018-11-23 12:16:35,145 INFO L273 TraceCheckUtils]: 42: Hoare triple {650#false} assume !false; {650#false} is VALID [2018-11-23 12:16:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:35,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:35,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:16:35,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-23 12:16:35,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:35,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:16:35,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:35,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:16:35,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:16:35,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:35,206 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2018-11-23 12:16:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:35,394 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:16:35,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:35,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-23 12:16:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 12:16:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 12:16:35,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 12:16:35,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:35,506 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:16:35,507 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:16:35,507 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 12:16:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:16:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 12:16:35,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:35,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:35,519 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:35,519 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:35,522 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:16:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:35,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:35,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:35,524 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 12:16:35,524 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 12:16:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:35,527 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:16:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:35,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:35,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:35,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:35,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:16:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:16:35,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2018-11-23 12:16:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:35,531 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:16:35,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:16:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:16:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:16:35,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:35,533 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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 12:16:35,533 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:35,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:35,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2018-11-23 12:16:35,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:35,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:35,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:35,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:35,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:35,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2018-11-23 12:16:35,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {823#true} is VALID [2018-11-23 12:16:35,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:35,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #71#return; {823#true} is VALID [2018-11-23 12:16:35,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret14 := main(); {823#true} is VALID [2018-11-23 12:16:35,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {823#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {825#(= main_~i~1 0)} is VALID [2018-11-23 12:16:35,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {825#(= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {825#(= main_~i~1 0)} is VALID [2018-11-23 12:16:35,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {825#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {826#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:35,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(<= main_~i~1 1)} assume !(~i~1 < 5); {824#false} is VALID [2018-11-23 12:16:35,787 INFO L256 TraceCheckUtils]: 9: Hoare triple {824#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {823#true} is VALID [2018-11-23 12:16:35,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {823#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {823#true} is VALID [2018-11-23 12:16:35,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {823#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:35,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {823#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {823#true} is VALID [2018-11-23 12:16:35,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {823#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {823#true} is VALID [2018-11-23 12:16:35,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {823#true} assume !(~i~0 < 5); {823#true} is VALID [2018-11-23 12:16:35,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {823#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {823#true} is VALID [2018-11-23 12:16:35,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:35,790 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {823#true} {824#false} #75#return; {824#false} is VALID [2018-11-23 12:16:35,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {824#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:35,790 INFO L256 TraceCheckUtils]: 19: Hoare triple {824#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {823#true} is VALID [2018-11-23 12:16:35,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {823#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {823#true} is VALID [2018-11-23 12:16:35,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {823#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:35,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {823#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {823#true} is VALID [2018-11-23 12:16:35,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {823#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {823#true} is VALID [2018-11-23 12:16:35,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {823#true} assume !(~i~0 < 5); {823#true} is VALID [2018-11-23 12:16:35,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {823#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {823#true} is VALID [2018-11-23 12:16:35,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:35,792 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {823#true} {824#false} #77#return; {824#false} is VALID [2018-11-23 12:16:35,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {824#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {824#false} is VALID [2018-11-23 12:16:35,793 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {824#false} is VALID [2018-11-23 12:16:35,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {824#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {824#false} is VALID [2018-11-23 12:16:35,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {824#false} assume !(~i~2 < 4); {824#false} is VALID [2018-11-23 12:16:35,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {824#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:35,794 INFO L256 TraceCheckUtils]: 33: Hoare triple {824#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {823#true} is VALID [2018-11-23 12:16:35,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {823#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {823#true} is VALID [2018-11-23 12:16:35,795 INFO L273 TraceCheckUtils]: 35: Hoare triple {823#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:35,795 INFO L273 TraceCheckUtils]: 36: Hoare triple {823#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {823#true} is VALID [2018-11-23 12:16:35,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {823#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {823#true} is VALID [2018-11-23 12:16:35,796 INFO L273 TraceCheckUtils]: 38: Hoare triple {823#true} assume !(~i~0 < 5); {823#true} is VALID [2018-11-23 12:16:35,796 INFO L273 TraceCheckUtils]: 39: Hoare triple {823#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {823#true} is VALID [2018-11-23 12:16:35,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:35,797 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {823#true} {824#false} #79#return; {824#false} is VALID [2018-11-23 12:16:35,797 INFO L273 TraceCheckUtils]: 42: Hoare triple {824#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {824#false} is VALID [2018-11-23 12:16:35,799 INFO L273 TraceCheckUtils]: 43: Hoare triple {824#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {824#false} is VALID [2018-11-23 12:16:35,799 INFO L273 TraceCheckUtils]: 44: Hoare triple {824#false} assume !false; {824#false} is VALID [2018-11-23 12:16:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:35,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:35,802 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 12:16:35,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:35,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:36,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2018-11-23 12:16:36,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {823#true} is VALID [2018-11-23 12:16:36,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:36,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #71#return; {823#true} is VALID [2018-11-23 12:16:36,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret14 := main(); {823#true} is VALID [2018-11-23 12:16:36,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {823#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {845#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:36,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {845#(<= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {845#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:36,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {845#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {826#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:36,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(<= main_~i~1 1)} assume !(~i~1 < 5); {824#false} is VALID [2018-11-23 12:16:36,286 INFO L256 TraceCheckUtils]: 9: Hoare triple {824#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {824#false} is VALID [2018-11-23 12:16:36,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {824#false} is VALID [2018-11-23 12:16:36,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {824#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:36,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {824#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {824#false} is VALID [2018-11-23 12:16:36,287 INFO L273 TraceCheckUtils]: 13: Hoare triple {824#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {824#false} is VALID [2018-11-23 12:16:36,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {824#false} assume !(~i~0 < 5); {824#false} is VALID [2018-11-23 12:16:36,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {824#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {824#false} is VALID [2018-11-23 12:16:36,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:36,288 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {824#false} {824#false} #75#return; {824#false} is VALID [2018-11-23 12:16:36,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {824#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:36,289 INFO L256 TraceCheckUtils]: 19: Hoare triple {824#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {824#false} is VALID [2018-11-23 12:16:36,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {824#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {824#false} is VALID [2018-11-23 12:16:36,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {824#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:36,289 INFO L273 TraceCheckUtils]: 22: Hoare triple {824#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {824#false} is VALID [2018-11-23 12:16:36,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {824#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {824#false} is VALID [2018-11-23 12:16:36,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {824#false} assume !(~i~0 < 5); {824#false} is VALID [2018-11-23 12:16:36,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {824#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {824#false} is VALID [2018-11-23 12:16:36,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:36,291 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {824#false} {824#false} #77#return; {824#false} is VALID [2018-11-23 12:16:36,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {824#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {824#false} is VALID [2018-11-23 12:16:36,291 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {824#false} is VALID [2018-11-23 12:16:36,291 INFO L273 TraceCheckUtils]: 30: Hoare triple {824#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {824#false} is VALID [2018-11-23 12:16:36,292 INFO L273 TraceCheckUtils]: 31: Hoare triple {824#false} assume !(~i~2 < 4); {824#false} is VALID [2018-11-23 12:16:36,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {824#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:36,292 INFO L256 TraceCheckUtils]: 33: Hoare triple {824#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {824#false} is VALID [2018-11-23 12:16:36,292 INFO L273 TraceCheckUtils]: 34: Hoare triple {824#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {824#false} is VALID [2018-11-23 12:16:36,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {824#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:36,293 INFO L273 TraceCheckUtils]: 36: Hoare triple {824#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {824#false} is VALID [2018-11-23 12:16:36,293 INFO L273 TraceCheckUtils]: 37: Hoare triple {824#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {824#false} is VALID [2018-11-23 12:16:36,294 INFO L273 TraceCheckUtils]: 38: Hoare triple {824#false} assume !(~i~0 < 5); {824#false} is VALID [2018-11-23 12:16:36,294 INFO L273 TraceCheckUtils]: 39: Hoare triple {824#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {824#false} is VALID [2018-11-23 12:16:36,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:36,294 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {824#false} {824#false} #79#return; {824#false} is VALID [2018-11-23 12:16:36,295 INFO L273 TraceCheckUtils]: 42: Hoare triple {824#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {824#false} is VALID [2018-11-23 12:16:36,295 INFO L273 TraceCheckUtils]: 43: Hoare triple {824#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {824#false} is VALID [2018-11-23 12:16:36,295 INFO L273 TraceCheckUtils]: 44: Hoare triple {824#false} assume !false; {824#false} is VALID [2018-11-23 12:16:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:36,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:36,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:16:36,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:16:36,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:36,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:16:36,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:36,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:16:36,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:16:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:16:36,447 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 12:16:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:36,637 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-23 12:16:36,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:16:36,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:16:36,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:16:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:16:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:16:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:16:36,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 12:16:36,785 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 12:16:36,788 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:16:36,788 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:16:36,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:16:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:16:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 12:16:36,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:36,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:36,804 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:36,804 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:36,807 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 12:16:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:16:36,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:36,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:36,809 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 12:16:36,809 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 12:16:36,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:36,813 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 12:16:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:16:36,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:36,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:36,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:36,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:16:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 12:16:36,816 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2018-11-23 12:16:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:36,816 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 12:16:36,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:16:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:16:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:16:36,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:36,823 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:36,824 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:36,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:36,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2018-11-23 12:16:36,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:36,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:36,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:36,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:37,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 12:16:37,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {1152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1152#true} is VALID [2018-11-23 12:16:37,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:37,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #71#return; {1152#true} is VALID [2018-11-23 12:16:37,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret14 := main(); {1152#true} is VALID [2018-11-23 12:16:37,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1154#(= main_~i~1 0)} is VALID [2018-11-23 12:16:37,032 INFO L273 TraceCheckUtils]: 6: Hoare triple {1154#(= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1154#(= main_~i~1 0)} is VALID [2018-11-23 12:16:37,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {1154#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1155#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:37,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {1155#(<= main_~i~1 1)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1155#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:37,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {1155#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1156#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:37,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(<= main_~i~1 2)} assume !(~i~1 < 5); {1153#false} is VALID [2018-11-23 12:16:37,039 INFO L256 TraceCheckUtils]: 11: Hoare triple {1153#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1152#true} is VALID [2018-11-23 12:16:37,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {1152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1152#true} is VALID [2018-11-23 12:16:37,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:37,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {1152#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1152#true} is VALID [2018-11-23 12:16:37,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {1152#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1152#true} is VALID [2018-11-23 12:16:37,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {1152#true} assume !(~i~0 < 5); {1152#true} is VALID [2018-11-23 12:16:37,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {1152#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1152#true} is VALID [2018-11-23 12:16:37,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:37,041 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1152#true} {1153#false} #75#return; {1153#false} is VALID [2018-11-23 12:16:37,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {1153#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:37,041 INFO L256 TraceCheckUtils]: 21: Hoare triple {1153#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1152#true} is VALID [2018-11-23 12:16:37,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {1152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1152#true} is VALID [2018-11-23 12:16:37,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {1152#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:37,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {1152#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1152#true} is VALID [2018-11-23 12:16:37,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {1152#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1152#true} is VALID [2018-11-23 12:16:37,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {1152#true} assume !(~i~0 < 5); {1152#true} is VALID [2018-11-23 12:16:37,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {1152#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1152#true} is VALID [2018-11-23 12:16:37,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:37,044 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1152#true} {1153#false} #77#return; {1153#false} is VALID [2018-11-23 12:16:37,044 INFO L273 TraceCheckUtils]: 30: Hoare triple {1153#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1153#false} is VALID [2018-11-23 12:16:37,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {1153#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1153#false} is VALID [2018-11-23 12:16:37,045 INFO L273 TraceCheckUtils]: 32: Hoare triple {1153#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1153#false} is VALID [2018-11-23 12:16:37,045 INFO L273 TraceCheckUtils]: 33: Hoare triple {1153#false} assume !(~i~2 < 4); {1153#false} is VALID [2018-11-23 12:16:37,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {1153#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:37,045 INFO L256 TraceCheckUtils]: 35: Hoare triple {1153#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1152#true} is VALID [2018-11-23 12:16:37,045 INFO L273 TraceCheckUtils]: 36: Hoare triple {1152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1152#true} is VALID [2018-11-23 12:16:37,046 INFO L273 TraceCheckUtils]: 37: Hoare triple {1152#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:37,046 INFO L273 TraceCheckUtils]: 38: Hoare triple {1152#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1152#true} is VALID [2018-11-23 12:16:37,046 INFO L273 TraceCheckUtils]: 39: Hoare triple {1152#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1152#true} is VALID [2018-11-23 12:16:37,046 INFO L273 TraceCheckUtils]: 40: Hoare triple {1152#true} assume !(~i~0 < 5); {1152#true} is VALID [2018-11-23 12:16:37,046 INFO L273 TraceCheckUtils]: 41: Hoare triple {1152#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1152#true} is VALID [2018-11-23 12:16:37,047 INFO L273 TraceCheckUtils]: 42: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:37,047 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1152#true} {1153#false} #79#return; {1153#false} is VALID [2018-11-23 12:16:37,047 INFO L273 TraceCheckUtils]: 44: Hoare triple {1153#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1153#false} is VALID [2018-11-23 12:16:37,047 INFO L273 TraceCheckUtils]: 45: Hoare triple {1153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1153#false} is VALID [2018-11-23 12:16:37,047 INFO L273 TraceCheckUtils]: 46: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 12:16:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:37,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:37,050 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 12:16:37,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:37,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:37,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:37,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:37,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 12:16:37,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {1152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1152#true} is VALID [2018-11-23 12:16:37,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:37,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #71#return; {1152#true} is VALID [2018-11-23 12:16:37,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret14 := main(); {1152#true} is VALID [2018-11-23 12:16:37,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1175#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:37,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {1175#(<= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1175#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:37,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {1175#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1155#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:37,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {1155#(<= main_~i~1 1)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1155#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:37,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {1155#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1156#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:37,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(<= main_~i~1 2)} assume !(~i~1 < 5); {1153#false} is VALID [2018-11-23 12:16:37,231 INFO L256 TraceCheckUtils]: 11: Hoare triple {1153#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1153#false} is VALID [2018-11-23 12:16:37,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {1153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1153#false} is VALID [2018-11-23 12:16:37,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {1153#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:37,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1153#false} is VALID [2018-11-23 12:16:37,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1153#false} is VALID [2018-11-23 12:16:37,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {1153#false} assume !(~i~0 < 5); {1153#false} is VALID [2018-11-23 12:16:37,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {1153#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1153#false} is VALID [2018-11-23 12:16:37,233 INFO L273 TraceCheckUtils]: 18: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:37,234 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1153#false} {1153#false} #75#return; {1153#false} is VALID [2018-11-23 12:16:37,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {1153#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:37,234 INFO L256 TraceCheckUtils]: 21: Hoare triple {1153#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1153#false} is VALID [2018-11-23 12:16:37,234 INFO L273 TraceCheckUtils]: 22: Hoare triple {1153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1153#false} is VALID [2018-11-23 12:16:37,235 INFO L273 TraceCheckUtils]: 23: Hoare triple {1153#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:37,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {1153#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1153#false} is VALID [2018-11-23 12:16:37,235 INFO L273 TraceCheckUtils]: 25: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1153#false} is VALID [2018-11-23 12:16:37,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {1153#false} assume !(~i~0 < 5); {1153#false} is VALID [2018-11-23 12:16:37,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {1153#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1153#false} is VALID [2018-11-23 12:16:37,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:37,236 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1153#false} {1153#false} #77#return; {1153#false} is VALID [2018-11-23 12:16:37,236 INFO L273 TraceCheckUtils]: 30: Hoare triple {1153#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1153#false} is VALID [2018-11-23 12:16:37,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {1153#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1153#false} is VALID [2018-11-23 12:16:37,237 INFO L273 TraceCheckUtils]: 32: Hoare triple {1153#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1153#false} is VALID [2018-11-23 12:16:37,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {1153#false} assume !(~i~2 < 4); {1153#false} is VALID [2018-11-23 12:16:37,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {1153#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:37,237 INFO L256 TraceCheckUtils]: 35: Hoare triple {1153#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1153#false} is VALID [2018-11-23 12:16:37,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {1153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1153#false} is VALID [2018-11-23 12:16:37,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {1153#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:37,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {1153#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1153#false} is VALID [2018-11-23 12:16:37,238 INFO L273 TraceCheckUtils]: 39: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1153#false} is VALID [2018-11-23 12:16:37,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {1153#false} assume !(~i~0 < 5); {1153#false} is VALID [2018-11-23 12:16:37,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {1153#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1153#false} is VALID [2018-11-23 12:16:37,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:37,239 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1153#false} {1153#false} #79#return; {1153#false} is VALID [2018-11-23 12:16:37,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {1153#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1153#false} is VALID [2018-11-23 12:16:37,239 INFO L273 TraceCheckUtils]: 45: Hoare triple {1153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1153#false} is VALID [2018-11-23 12:16:37,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 12:16:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:37,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:37,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:16:37,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:16:37,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:37,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:16:37,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:37,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:16:37,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:16:37,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:37,321 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2018-11-23 12:16:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:37,552 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:16:37,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:16:37,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:16:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-23 12:16:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-23 12:16:37,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2018-11-23 12:16:37,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:37,774 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:16:37,774 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:16:37,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:16:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 12:16:37,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:37,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:37,822 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:37,822 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:37,824 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:16:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:16:37,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:37,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:37,826 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 12:16:37,826 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 12:16:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:37,828 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:16:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:16:37,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:37,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:37,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:37,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:16:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 12:16:37,832 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 47 [2018-11-23 12:16:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:37,832 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 12:16:37,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:16:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:16:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:16:37,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:37,833 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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 12:16:37,834 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:37,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1005160965, now seen corresponding path program 3 times [2018-11-23 12:16:37,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:37,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:37,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:37,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:38,048 INFO L256 TraceCheckUtils]: 0: Hoare triple {1498#true} call ULTIMATE.init(); {1498#true} is VALID [2018-11-23 12:16:38,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {1498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1498#true} is VALID [2018-11-23 12:16:38,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:38,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1498#true} {1498#true} #71#return; {1498#true} is VALID [2018-11-23 12:16:38,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {1498#true} call #t~ret14 := main(); {1498#true} is VALID [2018-11-23 12:16:38,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {1498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1500#(= main_~i~1 0)} is VALID [2018-11-23 12:16:38,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {1500#(= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1500#(= main_~i~1 0)} is VALID [2018-11-23 12:16:38,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {1500#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1501#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:38,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {1501#(<= main_~i~1 1)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1501#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:38,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {1501#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1502#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:38,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {1502#(<= main_~i~1 2)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1502#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:38,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {1502#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1503#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:38,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(<= main_~i~1 3)} assume !(~i~1 < 5); {1499#false} is VALID [2018-11-23 12:16:38,057 INFO L256 TraceCheckUtils]: 13: Hoare triple {1499#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:38,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:38,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {1498#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:38,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:38,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:38,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {1498#true} assume !(~i~0 < 5); {1498#true} is VALID [2018-11-23 12:16:38,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:38,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:38,059 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1498#true} {1499#false} #75#return; {1499#false} is VALID [2018-11-23 12:16:38,060 INFO L273 TraceCheckUtils]: 22: Hoare triple {1499#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1499#false} is VALID [2018-11-23 12:16:38,060 INFO L256 TraceCheckUtils]: 23: Hoare triple {1499#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:38,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:38,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {1498#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:38,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:38,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:38,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {1498#true} assume !(~i~0 < 5); {1498#true} is VALID [2018-11-23 12:16:38,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:38,062 INFO L273 TraceCheckUtils]: 30: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:38,062 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1498#true} {1499#false} #77#return; {1499#false} is VALID [2018-11-23 12:16:38,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {1499#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1499#false} is VALID [2018-11-23 12:16:38,063 INFO L273 TraceCheckUtils]: 33: Hoare triple {1499#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1499#false} is VALID [2018-11-23 12:16:38,063 INFO L273 TraceCheckUtils]: 34: Hoare triple {1499#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1499#false} is VALID [2018-11-23 12:16:38,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {1499#false} assume !(~i~2 < 4); {1499#false} is VALID [2018-11-23 12:16:38,063 INFO L273 TraceCheckUtils]: 36: Hoare triple {1499#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1499#false} is VALID [2018-11-23 12:16:38,064 INFO L256 TraceCheckUtils]: 37: Hoare triple {1499#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:38,064 INFO L273 TraceCheckUtils]: 38: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:38,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {1498#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:38,064 INFO L273 TraceCheckUtils]: 40: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:38,065 INFO L273 TraceCheckUtils]: 41: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:38,065 INFO L273 TraceCheckUtils]: 42: Hoare triple {1498#true} assume !(~i~0 < 5); {1498#true} is VALID [2018-11-23 12:16:38,065 INFO L273 TraceCheckUtils]: 43: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:38,065 INFO L273 TraceCheckUtils]: 44: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:38,066 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1498#true} {1499#false} #79#return; {1499#false} is VALID [2018-11-23 12:16:38,066 INFO L273 TraceCheckUtils]: 46: Hoare triple {1499#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1499#false} is VALID [2018-11-23 12:16:38,066 INFO L273 TraceCheckUtils]: 47: Hoare triple {1499#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1499#false} is VALID [2018-11-23 12:16:38,066 INFO L273 TraceCheckUtils]: 48: Hoare triple {1499#false} assume !false; {1499#false} is VALID [2018-11-23 12:16:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:38,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:38,070 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 12:16:38,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:38,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:16:38,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:38,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:38,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {1498#true} call ULTIMATE.init(); {1498#true} is VALID [2018-11-23 12:16:38,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {1498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1498#true} is VALID [2018-11-23 12:16:38,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:38,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1498#true} {1498#true} #71#return; {1498#true} is VALID [2018-11-23 12:16:38,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {1498#true} call #t~ret14 := main(); {1498#true} is VALID [2018-11-23 12:16:38,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {1498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1498#true} is VALID [2018-11-23 12:16:38,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {1498#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1498#true} is VALID [2018-11-23 12:16:38,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {1498#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1498#true} is VALID [2018-11-23 12:16:38,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {1498#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1498#true} is VALID [2018-11-23 12:16:38,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {1498#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1498#true} is VALID [2018-11-23 12:16:38,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {1498#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1498#true} is VALID [2018-11-23 12:16:38,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {1498#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1498#true} is VALID [2018-11-23 12:16:38,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {1498#true} assume !(~i~1 < 5); {1498#true} is VALID [2018-11-23 12:16:38,425 INFO L256 TraceCheckUtils]: 13: Hoare triple {1498#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:38,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:38,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {1498#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:38,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:38,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:38,426 INFO L273 TraceCheckUtils]: 18: Hoare triple {1498#true} assume !(~i~0 < 5); {1498#true} is VALID [2018-11-23 12:16:38,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:38,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:38,427 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1498#true} {1498#true} #75#return; {1498#true} is VALID [2018-11-23 12:16:38,427 INFO L273 TraceCheckUtils]: 22: Hoare triple {1498#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1498#true} is VALID [2018-11-23 12:16:38,427 INFO L256 TraceCheckUtils]: 23: Hoare triple {1498#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:38,428 INFO L273 TraceCheckUtils]: 24: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:38,428 INFO L273 TraceCheckUtils]: 25: Hoare triple {1498#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:38,428 INFO L273 TraceCheckUtils]: 26: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:38,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:38,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {1498#true} assume !(~i~0 < 5); {1498#true} is VALID [2018-11-23 12:16:38,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:38,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:38,429 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1498#true} {1498#true} #77#return; {1498#true} is VALID [2018-11-23 12:16:38,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {1498#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1498#true} is VALID [2018-11-23 12:16:38,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {1498#true} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1498#true} is VALID [2018-11-23 12:16:38,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {1498#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1498#true} is VALID [2018-11-23 12:16:38,430 INFO L273 TraceCheckUtils]: 35: Hoare triple {1498#true} assume !(~i~2 < 4); {1498#true} is VALID [2018-11-23 12:16:38,430 INFO L273 TraceCheckUtils]: 36: Hoare triple {1498#true} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1498#true} is VALID [2018-11-23 12:16:38,431 INFO L256 TraceCheckUtils]: 37: Hoare triple {1498#true} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:38,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1621#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:38,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {1621#(<= sep_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1621#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:38,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {1621#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1621#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:38,450 INFO L273 TraceCheckUtils]: 41: Hoare triple {1621#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1631#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:38,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {1631#(<= sep_~i~0 1)} assume !(~i~0 < 5); {1499#false} is VALID [2018-11-23 12:16:38,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {1499#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1499#false} is VALID [2018-11-23 12:16:38,451 INFO L273 TraceCheckUtils]: 44: Hoare triple {1499#false} assume true; {1499#false} is VALID [2018-11-23 12:16:38,451 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1499#false} {1498#true} #79#return; {1499#false} is VALID [2018-11-23 12:16:38,452 INFO L273 TraceCheckUtils]: 46: Hoare triple {1499#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1499#false} is VALID [2018-11-23 12:16:38,452 INFO L273 TraceCheckUtils]: 47: Hoare triple {1499#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1499#false} is VALID [2018-11-23 12:16:38,452 INFO L273 TraceCheckUtils]: 48: Hoare triple {1499#false} assume !false; {1499#false} is VALID [2018-11-23 12:16:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 12:16:38,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:38,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:16:38,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:16:38,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:38,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:38,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:38,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:38,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:38,606 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 8 states. [2018-11-23 12:16:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:39,025 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2018-11-23 12:16:39,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:39,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:16:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 12:16:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 12:16:39,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2018-11-23 12:16:39,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:39,135 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:16:39,135 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:16:39,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:16:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 12:16:39,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:39,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:39,176 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:39,176 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:39,179 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:16:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:16:39,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:39,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:39,180 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-23 12:16:39,180 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-23 12:16:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:39,182 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:16:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:16:39,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:39,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:39,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:39,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:16:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 12:16:39,186 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 49 [2018-11-23 12:16:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:39,186 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 12:16:39,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:16:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:16:39,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:39,188 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 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 12:16:39,188 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:39,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash 742022364, now seen corresponding path program 4 times [2018-11-23 12:16:39,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:39,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:39,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:39,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2018-11-23 12:16:39,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {1882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1882#true} is VALID [2018-11-23 12:16:39,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:39,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1882#true} {1882#true} #71#return; {1882#true} is VALID [2018-11-23 12:16:39,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {1882#true} call #t~ret14 := main(); {1882#true} is VALID [2018-11-23 12:16:39,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {1882#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1884#(= main_~i~1 0)} is VALID [2018-11-23 12:16:39,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {1884#(= main_~i~1 0)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1884#(= main_~i~1 0)} is VALID [2018-11-23 12:16:39,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {1884#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1885#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:39,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {1885#(<= main_~i~1 1)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1885#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:39,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {1885#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1886#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:39,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {1886#(<= main_~i~1 2)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1886#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:39,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {1886#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1887#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:39,658 INFO L273 TraceCheckUtils]: 12: Hoare triple {1887#(<= main_~i~1 3)} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1887#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:39,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {1887#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1888#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:39,660 INFO L273 TraceCheckUtils]: 14: Hoare triple {1888#(<= main_~i~1 4)} assume !(~i~1 < 5); {1883#false} is VALID [2018-11-23 12:16:39,660 INFO L256 TraceCheckUtils]: 15: Hoare triple {1883#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1882#true} is VALID [2018-11-23 12:16:39,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {1882#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1882#true} is VALID [2018-11-23 12:16:39,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {1882#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:39,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:39,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:39,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {1882#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:39,661 INFO L273 TraceCheckUtils]: 21: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:39,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:39,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {1882#true} assume !(~i~0 < 5); {1882#true} is VALID [2018-11-23 12:16:39,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {1882#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1882#true} is VALID [2018-11-23 12:16:39,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:39,662 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1882#true} {1883#false} #75#return; {1883#false} is VALID [2018-11-23 12:16:39,663 INFO L273 TraceCheckUtils]: 27: Hoare triple {1883#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:39,663 INFO L256 TraceCheckUtils]: 28: Hoare triple {1883#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1882#true} is VALID [2018-11-23 12:16:39,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {1882#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1882#true} is VALID [2018-11-23 12:16:39,663 INFO L273 TraceCheckUtils]: 30: Hoare triple {1882#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:39,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:39,664 INFO L273 TraceCheckUtils]: 32: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:39,664 INFO L273 TraceCheckUtils]: 33: Hoare triple {1882#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:39,664 INFO L273 TraceCheckUtils]: 34: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:39,665 INFO L273 TraceCheckUtils]: 35: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:39,665 INFO L273 TraceCheckUtils]: 36: Hoare triple {1882#true} assume !(~i~0 < 5); {1882#true} is VALID [2018-11-23 12:16:39,665 INFO L273 TraceCheckUtils]: 37: Hoare triple {1882#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1882#true} is VALID [2018-11-23 12:16:39,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:39,666 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1882#true} {1883#false} #77#return; {1883#false} is VALID [2018-11-23 12:16:39,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {1883#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1883#false} is VALID [2018-11-23 12:16:39,666 INFO L273 TraceCheckUtils]: 41: Hoare triple {1883#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1883#false} is VALID [2018-11-23 12:16:39,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {1883#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1883#false} is VALID [2018-11-23 12:16:39,666 INFO L273 TraceCheckUtils]: 43: Hoare triple {1883#false} assume !(~i~2 < 4); {1883#false} is VALID [2018-11-23 12:16:39,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {1883#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:39,667 INFO L256 TraceCheckUtils]: 45: Hoare triple {1883#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1882#true} is VALID [2018-11-23 12:16:39,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {1882#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1882#true} is VALID [2018-11-23 12:16:39,667 INFO L273 TraceCheckUtils]: 47: Hoare triple {1882#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:39,668 INFO L273 TraceCheckUtils]: 48: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:39,668 INFO L273 TraceCheckUtils]: 49: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:39,668 INFO L273 TraceCheckUtils]: 50: Hoare triple {1882#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:39,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:39,669 INFO L273 TraceCheckUtils]: 52: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:39,669 INFO L273 TraceCheckUtils]: 53: Hoare triple {1882#true} assume !(~i~0 < 5); {1882#true} is VALID [2018-11-23 12:16:39,669 INFO L273 TraceCheckUtils]: 54: Hoare triple {1882#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1882#true} is VALID [2018-11-23 12:16:39,670 INFO L273 TraceCheckUtils]: 55: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:39,670 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {1882#true} {1883#false} #79#return; {1883#false} is VALID [2018-11-23 12:16:39,670 INFO L273 TraceCheckUtils]: 57: Hoare triple {1883#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1883#false} is VALID [2018-11-23 12:16:39,670 INFO L273 TraceCheckUtils]: 58: Hoare triple {1883#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1883#false} is VALID [2018-11-23 12:16:39,670 INFO L273 TraceCheckUtils]: 59: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2018-11-23 12:16:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:16:39,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:39,677 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 12:16:39,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:16:39,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:16:39,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:39,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:39,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2018-11-23 12:16:39,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {1882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1882#true} is VALID [2018-11-23 12:16:39,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:39,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1882#true} {1882#true} #71#return; {1882#true} is VALID [2018-11-23 12:16:39,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {1882#true} call #t~ret14 := main(); {1882#true} is VALID [2018-11-23 12:16:39,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {1882#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1882#true} is VALID [2018-11-23 12:16:39,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {1882#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1882#true} is VALID [2018-11-23 12:16:39,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {1882#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1882#true} is VALID [2018-11-23 12:16:39,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {1882#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1882#true} is VALID [2018-11-23 12:16:39,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {1882#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1882#true} is VALID [2018-11-23 12:16:39,989 INFO L273 TraceCheckUtils]: 10: Hoare triple {1882#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1882#true} is VALID [2018-11-23 12:16:39,989 INFO L273 TraceCheckUtils]: 11: Hoare triple {1882#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1882#true} is VALID [2018-11-23 12:16:39,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {1882#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1882#true} is VALID [2018-11-23 12:16:39,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {1882#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1882#true} is VALID [2018-11-23 12:16:39,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {1882#true} assume !(~i~1 < 5); {1882#true} is VALID [2018-11-23 12:16:39,990 INFO L256 TraceCheckUtils]: 15: Hoare triple {1882#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1882#true} is VALID [2018-11-23 12:16:39,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {1882#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1940#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:39,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {1940#(<= sep_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1940#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:39,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {1940#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1940#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:39,995 INFO L273 TraceCheckUtils]: 19: Hoare triple {1940#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1950#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:39,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {1950#(<= sep_~i~0 1)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1950#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:39,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {1950#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1950#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:39,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {1950#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1960#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:39,998 INFO L273 TraceCheckUtils]: 23: Hoare triple {1960#(<= sep_~i~0 2)} assume !(~i~0 < 5); {1883#false} is VALID [2018-11-23 12:16:39,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {1883#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1883#false} is VALID [2018-11-23 12:16:39,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:39,998 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1883#false} {1882#true} #75#return; {1883#false} is VALID [2018-11-23 12:16:39,998 INFO L273 TraceCheckUtils]: 27: Hoare triple {1883#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:39,998 INFO L256 TraceCheckUtils]: 28: Hoare triple {1883#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1883#false} is VALID [2018-11-23 12:16:39,999 INFO L273 TraceCheckUtils]: 29: Hoare triple {1883#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1883#false} is VALID [2018-11-23 12:16:39,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {1883#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:39,999 INFO L273 TraceCheckUtils]: 31: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:39,999 INFO L273 TraceCheckUtils]: 32: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:39,999 INFO L273 TraceCheckUtils]: 33: Hoare triple {1883#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:39,999 INFO L273 TraceCheckUtils]: 34: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:39,999 INFO L273 TraceCheckUtils]: 35: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:39,999 INFO L273 TraceCheckUtils]: 36: Hoare triple {1883#false} assume !(~i~0 < 5); {1883#false} is VALID [2018-11-23 12:16:40,000 INFO L273 TraceCheckUtils]: 37: Hoare triple {1883#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1883#false} is VALID [2018-11-23 12:16:40,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:40,000 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1883#false} {1883#false} #77#return; {1883#false} is VALID [2018-11-23 12:16:40,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {1883#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1883#false} is VALID [2018-11-23 12:16:40,000 INFO L273 TraceCheckUtils]: 41: Hoare triple {1883#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1883#false} is VALID [2018-11-23 12:16:40,000 INFO L273 TraceCheckUtils]: 42: Hoare triple {1883#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1883#false} is VALID [2018-11-23 12:16:40,000 INFO L273 TraceCheckUtils]: 43: Hoare triple {1883#false} assume !(~i~2 < 4); {1883#false} is VALID [2018-11-23 12:16:40,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {1883#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:40,001 INFO L256 TraceCheckUtils]: 45: Hoare triple {1883#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1883#false} is VALID [2018-11-23 12:16:40,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {1883#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1883#false} is VALID [2018-11-23 12:16:40,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {1883#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:40,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:40,001 INFO L273 TraceCheckUtils]: 49: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:40,001 INFO L273 TraceCheckUtils]: 50: Hoare triple {1883#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:40,001 INFO L273 TraceCheckUtils]: 51: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:40,002 INFO L273 TraceCheckUtils]: 52: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:40,002 INFO L273 TraceCheckUtils]: 53: Hoare triple {1883#false} assume !(~i~0 < 5); {1883#false} is VALID [2018-11-23 12:16:40,002 INFO L273 TraceCheckUtils]: 54: Hoare triple {1883#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1883#false} is VALID [2018-11-23 12:16:40,002 INFO L273 TraceCheckUtils]: 55: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:40,002 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {1883#false} {1883#false} #79#return; {1883#false} is VALID [2018-11-23 12:16:40,002 INFO L273 TraceCheckUtils]: 57: Hoare triple {1883#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1883#false} is VALID [2018-11-23 12:16:40,002 INFO L273 TraceCheckUtils]: 58: Hoare triple {1883#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1883#false} is VALID [2018-11-23 12:16:40,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2018-11-23 12:16:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-23 12:16:40,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:40,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-23 12:16:40,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-11-23 12:16:40,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:40,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:16:40,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:40,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:16:40,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:16:40,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:16:40,121 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 10 states. [2018-11-23 12:16:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:40,482 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2018-11-23 12:16:40,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:16:40,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-11-23 12:16:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:16:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-23 12:16:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:16:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-23 12:16:40,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-23 12:16:40,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:40,591 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:16:40,591 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:16:40,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:16:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:16:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 12:16:40,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:40,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-23 12:16:40,616 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-23 12:16:40,617 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-23 12:16:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:40,620 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:16:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 12:16:40,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:40,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:40,621 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-23 12:16:40,621 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-23 12:16:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:40,623 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:16:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 12:16:40,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:40,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:40,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:40,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:16:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 12:16:40,626 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 60 [2018-11-23 12:16:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:40,626 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 12:16:40,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:16:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:16:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:16:40,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:40,628 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 3, 3, 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 12:16:40,628 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:40,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -535819369, now seen corresponding path program 5 times [2018-11-23 12:16:40,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:40,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:40,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:40,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:40,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:40,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {2326#true} call ULTIMATE.init(); {2326#true} is VALID [2018-11-23 12:16:40,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {2326#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2326#true} is VALID [2018-11-23 12:16:40,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {2326#true} assume true; {2326#true} is VALID [2018-11-23 12:16:40,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2326#true} {2326#true} #71#return; {2326#true} is VALID [2018-11-23 12:16:40,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {2326#true} call #t~ret14 := main(); {2326#true} is VALID [2018-11-23 12:16:40,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {2326#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2326#true} is VALID [2018-11-23 12:16:40,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:40,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:40,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:40,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:40,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:40,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:40,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:40,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:40,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:40,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:40,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {2326#true} assume !(~i~1 < 5); {2326#true} is VALID [2018-11-23 12:16:40,790 INFO L256 TraceCheckUtils]: 17: Hoare triple {2326#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2326#true} is VALID [2018-11-23 12:16:40,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {2326#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2328#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:40,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {2328#(= sep_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2328#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:40,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {2328#(= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2328#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:40,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {2328#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:40,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {2329#(<= sep_~i~0 1)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:40,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {2329#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:40,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {2329#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2330#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:40,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {2330#(<= sep_~i~0 2)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2330#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:40,877 INFO L273 TraceCheckUtils]: 26: Hoare triple {2330#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2330#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:40,877 INFO L273 TraceCheckUtils]: 27: Hoare triple {2330#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2331#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:40,880 INFO L273 TraceCheckUtils]: 28: Hoare triple {2331#(<= sep_~i~0 3)} assume !(~i~0 < 5); {2327#false} is VALID [2018-11-23 12:16:40,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {2327#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2327#false} is VALID [2018-11-23 12:16:40,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {2327#false} assume true; {2327#false} is VALID [2018-11-23 12:16:40,880 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2327#false} {2326#true} #75#return; {2327#false} is VALID [2018-11-23 12:16:40,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {2327#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2327#false} is VALID [2018-11-23 12:16:40,880 INFO L256 TraceCheckUtils]: 33: Hoare triple {2327#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2326#true} is VALID [2018-11-23 12:16:40,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {2326#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2326#true} is VALID [2018-11-23 12:16:40,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {2326#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2326#true} is VALID [2018-11-23 12:16:40,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {2326#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2326#true} is VALID [2018-11-23 12:16:40,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {2326#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2326#true} is VALID [2018-11-23 12:16:40,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {2326#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2326#true} is VALID [2018-11-23 12:16:40,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {2326#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2326#true} is VALID [2018-11-23 12:16:40,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {2326#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2326#true} is VALID [2018-11-23 12:16:40,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {2326#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2326#true} is VALID [2018-11-23 12:16:40,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {2326#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2326#true} is VALID [2018-11-23 12:16:40,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {2326#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2326#true} is VALID [2018-11-23 12:16:40,882 INFO L273 TraceCheckUtils]: 44: Hoare triple {2326#true} assume !(~i~0 < 5); {2326#true} is VALID [2018-11-23 12:16:40,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {2326#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2326#true} is VALID [2018-11-23 12:16:40,882 INFO L273 TraceCheckUtils]: 46: Hoare triple {2326#true} assume true; {2326#true} is VALID [2018-11-23 12:16:40,882 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2326#true} {2327#false} #77#return; {2327#false} is VALID [2018-11-23 12:16:40,882 INFO L273 TraceCheckUtils]: 48: Hoare triple {2327#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2327#false} is VALID [2018-11-23 12:16:40,883 INFO L273 TraceCheckUtils]: 49: Hoare triple {2327#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2327#false} is VALID [2018-11-23 12:16:40,883 INFO L273 TraceCheckUtils]: 50: Hoare triple {2327#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2327#false} is VALID [2018-11-23 12:16:40,883 INFO L273 TraceCheckUtils]: 51: Hoare triple {2327#false} assume !(~i~2 < 4); {2327#false} is VALID [2018-11-23 12:16:40,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {2327#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2327#false} is VALID [2018-11-23 12:16:40,883 INFO L256 TraceCheckUtils]: 53: Hoare triple {2327#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2326#true} is VALID [2018-11-23 12:16:40,883 INFO L273 TraceCheckUtils]: 54: Hoare triple {2326#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2326#true} is VALID [2018-11-23 12:16:40,883 INFO L273 TraceCheckUtils]: 55: Hoare triple {2326#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2326#true} is VALID [2018-11-23 12:16:40,883 INFO L273 TraceCheckUtils]: 56: Hoare triple {2326#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2326#true} is VALID [2018-11-23 12:16:40,884 INFO L273 TraceCheckUtils]: 57: Hoare triple {2326#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2326#true} is VALID [2018-11-23 12:16:40,884 INFO L273 TraceCheckUtils]: 58: Hoare triple {2326#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2326#true} is VALID [2018-11-23 12:16:40,884 INFO L273 TraceCheckUtils]: 59: Hoare triple {2326#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2326#true} is VALID [2018-11-23 12:16:40,884 INFO L273 TraceCheckUtils]: 60: Hoare triple {2326#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2326#true} is VALID [2018-11-23 12:16:40,884 INFO L273 TraceCheckUtils]: 61: Hoare triple {2326#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2326#true} is VALID [2018-11-23 12:16:40,884 INFO L273 TraceCheckUtils]: 62: Hoare triple {2326#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2326#true} is VALID [2018-11-23 12:16:40,884 INFO L273 TraceCheckUtils]: 63: Hoare triple {2326#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2326#true} is VALID [2018-11-23 12:16:40,885 INFO L273 TraceCheckUtils]: 64: Hoare triple {2326#true} assume !(~i~0 < 5); {2326#true} is VALID [2018-11-23 12:16:40,885 INFO L273 TraceCheckUtils]: 65: Hoare triple {2326#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2326#true} is VALID [2018-11-23 12:16:40,885 INFO L273 TraceCheckUtils]: 66: Hoare triple {2326#true} assume true; {2326#true} is VALID [2018-11-23 12:16:40,885 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2326#true} {2327#false} #79#return; {2327#false} is VALID [2018-11-23 12:16:40,885 INFO L273 TraceCheckUtils]: 68: Hoare triple {2327#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2327#false} is VALID [2018-11-23 12:16:40,886 INFO L273 TraceCheckUtils]: 69: Hoare triple {2327#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2327#false} is VALID [2018-11-23 12:16:40,886 INFO L273 TraceCheckUtils]: 70: Hoare triple {2327#false} assume !false; {2327#false} is VALID [2018-11-23 12:16:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 12:16:40,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:40,889 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 12:16:40,897 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:16:40,988 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:16:40,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:41,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:41,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {2326#true} call ULTIMATE.init(); {2326#true} is VALID [2018-11-23 12:16:41,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {2326#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2326#true} is VALID [2018-11-23 12:16:41,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {2326#true} assume true; {2326#true} is VALID [2018-11-23 12:16:41,166 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2326#true} {2326#true} #71#return; {2326#true} is VALID [2018-11-23 12:16:41,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {2326#true} call #t~ret14 := main(); {2326#true} is VALID [2018-11-23 12:16:41,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {2326#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2326#true} is VALID [2018-11-23 12:16:41,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:41,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:41,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:41,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:41,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:41,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:41,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:41,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:41,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {2326#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2326#true} is VALID [2018-11-23 12:16:41,168 INFO L273 TraceCheckUtils]: 15: Hoare triple {2326#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2326#true} is VALID [2018-11-23 12:16:41,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {2326#true} assume !(~i~1 < 5); {2326#true} is VALID [2018-11-23 12:16:41,168 INFO L256 TraceCheckUtils]: 17: Hoare triple {2326#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2326#true} is VALID [2018-11-23 12:16:41,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {2326#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2389#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:41,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {2389#(<= sep_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2389#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:41,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {2389#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2389#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:41,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {2389#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:41,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {2329#(<= sep_~i~0 1)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:41,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {2329#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:41,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {2329#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2330#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:41,172 INFO L273 TraceCheckUtils]: 25: Hoare triple {2330#(<= sep_~i~0 2)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2330#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:41,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {2330#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2330#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:41,173 INFO L273 TraceCheckUtils]: 27: Hoare triple {2330#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2331#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:41,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {2331#(<= sep_~i~0 3)} assume !(~i~0 < 5); {2327#false} is VALID [2018-11-23 12:16:41,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {2327#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2327#false} is VALID [2018-11-23 12:16:41,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {2327#false} assume true; {2327#false} is VALID [2018-11-23 12:16:41,174 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2327#false} {2326#true} #75#return; {2327#false} is VALID [2018-11-23 12:16:41,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {2327#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2327#false} is VALID [2018-11-23 12:16:41,175 INFO L256 TraceCheckUtils]: 33: Hoare triple {2327#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2327#false} is VALID [2018-11-23 12:16:41,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {2327#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2327#false} is VALID [2018-11-23 12:16:41,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {2327#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2327#false} is VALID [2018-11-23 12:16:41,176 INFO L273 TraceCheckUtils]: 36: Hoare triple {2327#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2327#false} is VALID [2018-11-23 12:16:41,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {2327#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2327#false} is VALID [2018-11-23 12:16:41,177 INFO L273 TraceCheckUtils]: 38: Hoare triple {2327#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2327#false} is VALID [2018-11-23 12:16:41,177 INFO L273 TraceCheckUtils]: 39: Hoare triple {2327#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2327#false} is VALID [2018-11-23 12:16:41,177 INFO L273 TraceCheckUtils]: 40: Hoare triple {2327#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2327#false} is VALID [2018-11-23 12:16:41,178 INFO L273 TraceCheckUtils]: 41: Hoare triple {2327#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2327#false} is VALID [2018-11-23 12:16:41,178 INFO L273 TraceCheckUtils]: 42: Hoare triple {2327#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2327#false} is VALID [2018-11-23 12:16:41,178 INFO L273 TraceCheckUtils]: 43: Hoare triple {2327#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2327#false} is VALID [2018-11-23 12:16:41,178 INFO L273 TraceCheckUtils]: 44: Hoare triple {2327#false} assume !(~i~0 < 5); {2327#false} is VALID [2018-11-23 12:16:41,178 INFO L273 TraceCheckUtils]: 45: Hoare triple {2327#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2327#false} is VALID [2018-11-23 12:16:41,178 INFO L273 TraceCheckUtils]: 46: Hoare triple {2327#false} assume true; {2327#false} is VALID [2018-11-23 12:16:41,179 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2327#false} {2327#false} #77#return; {2327#false} is VALID [2018-11-23 12:16:41,179 INFO L273 TraceCheckUtils]: 48: Hoare triple {2327#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2327#false} is VALID [2018-11-23 12:16:41,179 INFO L273 TraceCheckUtils]: 49: Hoare triple {2327#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2327#false} is VALID [2018-11-23 12:16:41,179 INFO L273 TraceCheckUtils]: 50: Hoare triple {2327#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2327#false} is VALID [2018-11-23 12:16:41,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {2327#false} assume !(~i~2 < 4); {2327#false} is VALID [2018-11-23 12:16:41,180 INFO L273 TraceCheckUtils]: 52: Hoare triple {2327#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2327#false} is VALID [2018-11-23 12:16:41,180 INFO L256 TraceCheckUtils]: 53: Hoare triple {2327#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2327#false} is VALID [2018-11-23 12:16:41,180 INFO L273 TraceCheckUtils]: 54: Hoare triple {2327#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2327#false} is VALID [2018-11-23 12:16:41,180 INFO L273 TraceCheckUtils]: 55: Hoare triple {2327#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2327#false} is VALID [2018-11-23 12:16:41,180 INFO L273 TraceCheckUtils]: 56: Hoare triple {2327#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2327#false} is VALID [2018-11-23 12:16:41,180 INFO L273 TraceCheckUtils]: 57: Hoare triple {2327#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2327#false} is VALID [2018-11-23 12:16:41,181 INFO L273 TraceCheckUtils]: 58: Hoare triple {2327#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2327#false} is VALID [2018-11-23 12:16:41,181 INFO L273 TraceCheckUtils]: 59: Hoare triple {2327#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2327#false} is VALID [2018-11-23 12:16:41,181 INFO L273 TraceCheckUtils]: 60: Hoare triple {2327#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2327#false} is VALID [2018-11-23 12:16:41,181 INFO L273 TraceCheckUtils]: 61: Hoare triple {2327#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2327#false} is VALID [2018-11-23 12:16:41,181 INFO L273 TraceCheckUtils]: 62: Hoare triple {2327#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2327#false} is VALID [2018-11-23 12:16:41,181 INFO L273 TraceCheckUtils]: 63: Hoare triple {2327#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2327#false} is VALID [2018-11-23 12:16:41,182 INFO L273 TraceCheckUtils]: 64: Hoare triple {2327#false} assume !(~i~0 < 5); {2327#false} is VALID [2018-11-23 12:16:41,182 INFO L273 TraceCheckUtils]: 65: Hoare triple {2327#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2327#false} is VALID [2018-11-23 12:16:41,182 INFO L273 TraceCheckUtils]: 66: Hoare triple {2327#false} assume true; {2327#false} is VALID [2018-11-23 12:16:41,182 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2327#false} {2327#false} #79#return; {2327#false} is VALID [2018-11-23 12:16:41,182 INFO L273 TraceCheckUtils]: 68: Hoare triple {2327#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2327#false} is VALID [2018-11-23 12:16:41,183 INFO L273 TraceCheckUtils]: 69: Hoare triple {2327#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2327#false} is VALID [2018-11-23 12:16:41,183 INFO L273 TraceCheckUtils]: 70: Hoare triple {2327#false} assume !false; {2327#false} is VALID [2018-11-23 12:16:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-23 12:16:41,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:41,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:16:41,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-23 12:16:41,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:41,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:16:41,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:41,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:16:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:16:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:41,292 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2018-11-23 12:16:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:41,519 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2018-11-23 12:16:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:16:41,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-23 12:16:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:16:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 12:16:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:16:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 12:16:41,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-23 12:16:41,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:41,654 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:16:41,654 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:16:41,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:16:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:16:41,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:41,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:16:41,806 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:16:41,806 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:16:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:41,809 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:16:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:16:41,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:41,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:41,809 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:16:41,809 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:16:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:41,811 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:16:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:16:41,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:41,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:41,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:41,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:16:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-23 12:16:41,814 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 71 [2018-11-23 12:16:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:41,814 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 12:16:41,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:16:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:16:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 12:16:41,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:41,816 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 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 12:16:41,816 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:41,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash -174901602, now seen corresponding path program 6 times [2018-11-23 12:16:41,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:41,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:41,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:41,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:41,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {2816#true} call ULTIMATE.init(); {2816#true} is VALID [2018-11-23 12:16:41,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {2816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2816#true} is VALID [2018-11-23 12:16:41,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-23 12:16:41,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2816#true} {2816#true} #71#return; {2816#true} is VALID [2018-11-23 12:16:41,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {2816#true} call #t~ret14 := main(); {2816#true} is VALID [2018-11-23 12:16:41,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {2816#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2816#true} is VALID [2018-11-23 12:16:41,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:41,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:41,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:41,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:41,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:41,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:41,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:41,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:41,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:41,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:41,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {2816#true} assume !(~i~1 < 5); {2816#true} is VALID [2018-11-23 12:16:41,976 INFO L256 TraceCheckUtils]: 17: Hoare triple {2816#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2816#true} is VALID [2018-11-23 12:16:41,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {2816#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2818#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:41,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {2818#(= sep_~i~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2818#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:41,978 INFO L273 TraceCheckUtils]: 20: Hoare triple {2818#(= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2818#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:41,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {2818#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2819#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:41,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {2819#(<= sep_~i~0 1)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2819#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:41,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {2819#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2819#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:41,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {2819#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2820#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:41,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {2820#(<= sep_~i~0 2)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2820#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:41,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {2820#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2820#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:41,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {2820#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2821#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:41,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {2821#(<= sep_~i~0 3)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2821#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:41,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {2821#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2821#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:41,983 INFO L273 TraceCheckUtils]: 30: Hoare triple {2821#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2822#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:41,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {2822#(<= sep_~i~0 4)} assume !(~i~0 < 5); {2817#false} is VALID [2018-11-23 12:16:41,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {2817#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2817#false} is VALID [2018-11-23 12:16:41,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {2817#false} assume true; {2817#false} is VALID [2018-11-23 12:16:41,985 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2817#false} {2816#true} #75#return; {2817#false} is VALID [2018-11-23 12:16:41,986 INFO L273 TraceCheckUtils]: 35: Hoare triple {2817#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2817#false} is VALID [2018-11-23 12:16:41,986 INFO L256 TraceCheckUtils]: 36: Hoare triple {2817#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2816#true} is VALID [2018-11-23 12:16:41,986 INFO L273 TraceCheckUtils]: 37: Hoare triple {2816#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2816#true} is VALID [2018-11-23 12:16:41,986 INFO L273 TraceCheckUtils]: 38: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:41,987 INFO L273 TraceCheckUtils]: 39: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:41,987 INFO L273 TraceCheckUtils]: 40: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:41,987 INFO L273 TraceCheckUtils]: 41: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:41,987 INFO L273 TraceCheckUtils]: 42: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:41,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:41,988 INFO L273 TraceCheckUtils]: 44: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:41,988 INFO L273 TraceCheckUtils]: 45: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:41,988 INFO L273 TraceCheckUtils]: 46: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:41,988 INFO L273 TraceCheckUtils]: 47: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:41,988 INFO L273 TraceCheckUtils]: 48: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:41,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:41,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {2816#true} assume !(~i~0 < 5); {2816#true} is VALID [2018-11-23 12:16:41,989 INFO L273 TraceCheckUtils]: 51: Hoare triple {2816#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2816#true} is VALID [2018-11-23 12:16:41,989 INFO L273 TraceCheckUtils]: 52: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-23 12:16:41,989 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {2816#true} {2817#false} #77#return; {2817#false} is VALID [2018-11-23 12:16:41,989 INFO L273 TraceCheckUtils]: 54: Hoare triple {2817#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2817#false} is VALID [2018-11-23 12:16:41,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {2817#false} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2817#false} is VALID [2018-11-23 12:16:41,990 INFO L273 TraceCheckUtils]: 56: Hoare triple {2817#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2817#false} is VALID [2018-11-23 12:16:41,990 INFO L273 TraceCheckUtils]: 57: Hoare triple {2817#false} assume !(~i~2 < 4); {2817#false} is VALID [2018-11-23 12:16:41,990 INFO L273 TraceCheckUtils]: 58: Hoare triple {2817#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2817#false} is VALID [2018-11-23 12:16:41,991 INFO L256 TraceCheckUtils]: 59: Hoare triple {2817#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2816#true} is VALID [2018-11-23 12:16:41,991 INFO L273 TraceCheckUtils]: 60: Hoare triple {2816#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2816#true} is VALID [2018-11-23 12:16:41,991 INFO L273 TraceCheckUtils]: 61: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:41,991 INFO L273 TraceCheckUtils]: 62: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:41,991 INFO L273 TraceCheckUtils]: 63: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:41,992 INFO L273 TraceCheckUtils]: 64: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:41,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:41,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:41,992 INFO L273 TraceCheckUtils]: 67: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:41,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:41,993 INFO L273 TraceCheckUtils]: 69: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:41,993 INFO L273 TraceCheckUtils]: 70: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:41,993 INFO L273 TraceCheckUtils]: 71: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:41,994 INFO L273 TraceCheckUtils]: 72: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:41,994 INFO L273 TraceCheckUtils]: 73: Hoare triple {2816#true} assume !(~i~0 < 5); {2816#true} is VALID [2018-11-23 12:16:41,994 INFO L273 TraceCheckUtils]: 74: Hoare triple {2816#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2816#true} is VALID [2018-11-23 12:16:41,994 INFO L273 TraceCheckUtils]: 75: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-23 12:16:41,994 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {2816#true} {2817#false} #79#return; {2817#false} is VALID [2018-11-23 12:16:41,995 INFO L273 TraceCheckUtils]: 77: Hoare triple {2817#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2817#false} is VALID [2018-11-23 12:16:41,995 INFO L273 TraceCheckUtils]: 78: Hoare triple {2817#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2817#false} is VALID [2018-11-23 12:16:41,995 INFO L273 TraceCheckUtils]: 79: Hoare triple {2817#false} assume !false; {2817#false} is VALID [2018-11-23 12:16:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-11-23 12:16:42,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:42,001 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 12:16:42,019 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:16:42,119 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:16:42,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:42,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:42,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {2816#true} call ULTIMATE.init(); {2816#true} is VALID [2018-11-23 12:16:42,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {2816#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2816#true} is VALID [2018-11-23 12:16:42,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-23 12:16:42,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2816#true} {2816#true} #71#return; {2816#true} is VALID [2018-11-23 12:16:42,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {2816#true} call #t~ret14 := main(); {2816#true} is VALID [2018-11-23 12:16:42,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {2816#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2816#true} is VALID [2018-11-23 12:16:42,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:42,284 INFO L273 TraceCheckUtils]: 7: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:42,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:42,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:42,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:42,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:42,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:42,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:42,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {2816#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2816#true} is VALID [2018-11-23 12:16:42,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {2816#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {2816#true} assume !(~i~1 < 5); {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L256 TraceCheckUtils]: 17: Hoare triple {2816#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {2816#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L273 TraceCheckUtils]: 20: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L273 TraceCheckUtils]: 21: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L273 TraceCheckUtils]: 22: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L273 TraceCheckUtils]: 23: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:42,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:42,287 INFO L273 TraceCheckUtils]: 25: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:42,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:42,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:42,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:42,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:42,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:42,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {2816#true} assume !(~i~0 < 5); {2816#true} is VALID [2018-11-23 12:16:42,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {2816#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2816#true} is VALID [2018-11-23 12:16:42,288 INFO L273 TraceCheckUtils]: 33: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-23 12:16:42,288 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2816#true} {2816#true} #75#return; {2816#true} is VALID [2018-11-23 12:16:42,288 INFO L273 TraceCheckUtils]: 35: Hoare triple {2816#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2816#true} is VALID [2018-11-23 12:16:42,288 INFO L256 TraceCheckUtils]: 36: Hoare triple {2816#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2816#true} is VALID [2018-11-23 12:16:42,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {2816#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2816#true} is VALID [2018-11-23 12:16:42,289 INFO L273 TraceCheckUtils]: 38: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:42,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:42,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:42,289 INFO L273 TraceCheckUtils]: 41: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:42,289 INFO L273 TraceCheckUtils]: 42: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:42,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:42,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:42,290 INFO L273 TraceCheckUtils]: 45: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:42,290 INFO L273 TraceCheckUtils]: 46: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:42,290 INFO L273 TraceCheckUtils]: 47: Hoare triple {2816#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2816#true} is VALID [2018-11-23 12:16:42,290 INFO L273 TraceCheckUtils]: 48: Hoare triple {2816#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2816#true} is VALID [2018-11-23 12:16:42,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {2816#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2816#true} is VALID [2018-11-23 12:16:42,290 INFO L273 TraceCheckUtils]: 50: Hoare triple {2816#true} assume !(~i~0 < 5); {2816#true} is VALID [2018-11-23 12:16:42,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {2816#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2816#true} is VALID [2018-11-23 12:16:42,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-23 12:16:42,291 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {2816#true} {2816#true} #77#return; {2816#true} is VALID [2018-11-23 12:16:42,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {2816#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2988#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:42,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {2988#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2988#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:42,292 INFO L273 TraceCheckUtils]: 56: Hoare triple {2988#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2995#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:42,292 INFO L273 TraceCheckUtils]: 57: Hoare triple {2995#(<= main_~i~2 1)} assume !(~i~2 < 4); {2817#false} is VALID [2018-11-23 12:16:42,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {2817#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {2817#false} is VALID [2018-11-23 12:16:42,293 INFO L256 TraceCheckUtils]: 59: Hoare triple {2817#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2817#false} is VALID [2018-11-23 12:16:42,293 INFO L273 TraceCheckUtils]: 60: Hoare triple {2817#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2817#false} is VALID [2018-11-23 12:16:42,293 INFO L273 TraceCheckUtils]: 61: Hoare triple {2817#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2817#false} is VALID [2018-11-23 12:16:42,293 INFO L273 TraceCheckUtils]: 62: Hoare triple {2817#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2817#false} is VALID [2018-11-23 12:16:42,293 INFO L273 TraceCheckUtils]: 63: Hoare triple {2817#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2817#false} is VALID [2018-11-23 12:16:42,293 INFO L273 TraceCheckUtils]: 64: Hoare triple {2817#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2817#false} is VALID [2018-11-23 12:16:42,293 INFO L273 TraceCheckUtils]: 65: Hoare triple {2817#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 66: Hoare triple {2817#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 67: Hoare triple {2817#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 68: Hoare triple {2817#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 69: Hoare triple {2817#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 70: Hoare triple {2817#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 71: Hoare triple {2817#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 72: Hoare triple {2817#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {2817#false} assume !(~i~0 < 5); {2817#false} is VALID [2018-11-23 12:16:42,294 INFO L273 TraceCheckUtils]: 74: Hoare triple {2817#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2817#false} is VALID [2018-11-23 12:16:42,295 INFO L273 TraceCheckUtils]: 75: Hoare triple {2817#false} assume true; {2817#false} is VALID [2018-11-23 12:16:42,295 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {2817#false} {2817#false} #79#return; {2817#false} is VALID [2018-11-23 12:16:42,295 INFO L273 TraceCheckUtils]: 77: Hoare triple {2817#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2817#false} is VALID [2018-11-23 12:16:42,295 INFO L273 TraceCheckUtils]: 78: Hoare triple {2817#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2817#false} is VALID [2018-11-23 12:16:42,295 INFO L273 TraceCheckUtils]: 79: Hoare triple {2817#false} assume !false; {2817#false} is VALID [2018-11-23 12:16:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-23 12:16:42,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:42,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-11-23 12:16:42,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-11-23 12:16:42,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:42,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:16:42,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:42,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:16:42,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:16:42,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:42,424 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 9 states. [2018-11-23 12:16:42,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:42,777 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-23 12:16:42,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:16:42,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-11-23 12:16:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:16:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2018-11-23 12:16:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:16:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2018-11-23 12:16:42,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2018-11-23 12:16:42,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:42,898 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:16:42,898 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:16:42,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:16:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 12:16:42,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:42,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 12:16:42,973 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 12:16:42,973 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 12:16:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:42,975 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-23 12:16:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-23 12:16:42,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:42,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:42,976 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 12:16:42,976 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 12:16:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:42,978 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-23 12:16:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-23 12:16:42,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:42,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:42,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:42,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:16:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-11-23 12:16:42,980 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 80 [2018-11-23 12:16:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:42,981 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-11-23 12:16:42,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:16:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 12:16:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:16:42,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:42,982 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:42,982 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:42,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1544076679, now seen corresponding path program 7 times [2018-11-23 12:16:42,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:42,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:42,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:43,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {3360#true} call ULTIMATE.init(); {3360#true} is VALID [2018-11-23 12:16:43,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {3360#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3360#true} is VALID [2018-11-23 12:16:43,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {3360#true} assume true; {3360#true} is VALID [2018-11-23 12:16:43,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3360#true} {3360#true} #71#return; {3360#true} is VALID [2018-11-23 12:16:43,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {3360#true} call #t~ret14 := main(); {3360#true} is VALID [2018-11-23 12:16:43,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {3360#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3360#true} is VALID [2018-11-23 12:16:43,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,290 INFO L273 TraceCheckUtils]: 13: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {3360#true} assume !(~i~1 < 5); {3360#true} is VALID [2018-11-23 12:16:43,291 INFO L256 TraceCheckUtils]: 17: Hoare triple {3360#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3360#true} is VALID [2018-11-23 12:16:43,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {3360#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3360#true} is VALID [2018-11-23 12:16:43,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 30: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 31: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,293 INFO L273 TraceCheckUtils]: 33: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {3360#true} assume !(~i~0 < 5); {3360#true} is VALID [2018-11-23 12:16:43,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {3360#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3360#true} is VALID [2018-11-23 12:16:43,293 INFO L273 TraceCheckUtils]: 36: Hoare triple {3360#true} assume true; {3360#true} is VALID [2018-11-23 12:16:43,293 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3360#true} {3360#true} #75#return; {3360#true} is VALID [2018-11-23 12:16:43,294 INFO L273 TraceCheckUtils]: 38: Hoare triple {3360#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3360#true} is VALID [2018-11-23 12:16:43,294 INFO L256 TraceCheckUtils]: 39: Hoare triple {3360#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3360#true} is VALID [2018-11-23 12:16:43,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {3360#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3360#true} is VALID [2018-11-23 12:16:43,294 INFO L273 TraceCheckUtils]: 41: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,294 INFO L273 TraceCheckUtils]: 42: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,295 INFO L273 TraceCheckUtils]: 43: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,295 INFO L273 TraceCheckUtils]: 44: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,295 INFO L273 TraceCheckUtils]: 45: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,295 INFO L273 TraceCheckUtils]: 46: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,295 INFO L273 TraceCheckUtils]: 47: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,296 INFO L273 TraceCheckUtils]: 49: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,296 INFO L273 TraceCheckUtils]: 51: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,296 INFO L273 TraceCheckUtils]: 52: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,296 INFO L273 TraceCheckUtils]: 54: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,297 INFO L273 TraceCheckUtils]: 55: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,297 INFO L273 TraceCheckUtils]: 56: Hoare triple {3360#true} assume !(~i~0 < 5); {3360#true} is VALID [2018-11-23 12:16:43,297 INFO L273 TraceCheckUtils]: 57: Hoare triple {3360#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3360#true} is VALID [2018-11-23 12:16:43,297 INFO L273 TraceCheckUtils]: 58: Hoare triple {3360#true} assume true; {3360#true} is VALID [2018-11-23 12:16:43,297 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3360#true} {3360#true} #77#return; {3360#true} is VALID [2018-11-23 12:16:43,298 INFO L273 TraceCheckUtils]: 60: Hoare triple {3360#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3362#(= main_~i~2 0)} is VALID [2018-11-23 12:16:43,300 INFO L273 TraceCheckUtils]: 61: Hoare triple {3362#(= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3362#(= main_~i~2 0)} is VALID [2018-11-23 12:16:43,300 INFO L273 TraceCheckUtils]: 62: Hoare triple {3362#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3363#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:43,303 INFO L273 TraceCheckUtils]: 63: Hoare triple {3363#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3363#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:43,303 INFO L273 TraceCheckUtils]: 64: Hoare triple {3363#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3364#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:43,304 INFO L273 TraceCheckUtils]: 65: Hoare triple {3364#(<= main_~i~2 2)} assume !(~i~2 < 4); {3361#false} is VALID [2018-11-23 12:16:43,304 INFO L273 TraceCheckUtils]: 66: Hoare triple {3361#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {3361#false} is VALID [2018-11-23 12:16:43,304 INFO L256 TraceCheckUtils]: 67: Hoare triple {3361#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3360#true} is VALID [2018-11-23 12:16:43,304 INFO L273 TraceCheckUtils]: 68: Hoare triple {3360#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3360#true} is VALID [2018-11-23 12:16:43,304 INFO L273 TraceCheckUtils]: 69: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,305 INFO L273 TraceCheckUtils]: 70: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,305 INFO L273 TraceCheckUtils]: 71: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,305 INFO L273 TraceCheckUtils]: 72: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,305 INFO L273 TraceCheckUtils]: 73: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,305 INFO L273 TraceCheckUtils]: 74: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,305 INFO L273 TraceCheckUtils]: 75: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,306 INFO L273 TraceCheckUtils]: 76: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,306 INFO L273 TraceCheckUtils]: 77: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,306 INFO L273 TraceCheckUtils]: 78: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,306 INFO L273 TraceCheckUtils]: 79: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,306 INFO L273 TraceCheckUtils]: 80: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,306 INFO L273 TraceCheckUtils]: 81: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,307 INFO L273 TraceCheckUtils]: 82: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,307 INFO L273 TraceCheckUtils]: 83: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,307 INFO L273 TraceCheckUtils]: 84: Hoare triple {3360#true} assume !(~i~0 < 5); {3360#true} is VALID [2018-11-23 12:16:43,307 INFO L273 TraceCheckUtils]: 85: Hoare triple {3360#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3360#true} is VALID [2018-11-23 12:16:43,307 INFO L273 TraceCheckUtils]: 86: Hoare triple {3360#true} assume true; {3360#true} is VALID [2018-11-23 12:16:43,307 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3360#true} {3361#false} #79#return; {3361#false} is VALID [2018-11-23 12:16:43,308 INFO L273 TraceCheckUtils]: 88: Hoare triple {3361#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3361#false} is VALID [2018-11-23 12:16:43,308 INFO L273 TraceCheckUtils]: 89: Hoare triple {3361#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3361#false} is VALID [2018-11-23 12:16:43,308 INFO L273 TraceCheckUtils]: 90: Hoare triple {3361#false} assume !false; {3361#false} is VALID [2018-11-23 12:16:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-23 12:16:43,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:43,315 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 12:16:43,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:43,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:43,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {3360#true} call ULTIMATE.init(); {3360#true} is VALID [2018-11-23 12:16:43,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {3360#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3360#true} is VALID [2018-11-23 12:16:43,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {3360#true} assume true; {3360#true} is VALID [2018-11-23 12:16:43,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3360#true} {3360#true} #71#return; {3360#true} is VALID [2018-11-23 12:16:43,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {3360#true} call #t~ret14 := main(); {3360#true} is VALID [2018-11-23 12:16:43,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {3360#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3360#true} is VALID [2018-11-23 12:16:43,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {3360#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3360#true} is VALID [2018-11-23 12:16:43,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {3360#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3360#true} is VALID [2018-11-23 12:16:43,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {3360#true} assume !(~i~1 < 5); {3360#true} is VALID [2018-11-23 12:16:43,510 INFO L256 TraceCheckUtils]: 17: Hoare triple {3360#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3360#true} is VALID [2018-11-23 12:16:43,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {3360#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3360#true} is VALID [2018-11-23 12:16:43,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,511 INFO L273 TraceCheckUtils]: 27: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,511 INFO L273 TraceCheckUtils]: 28: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,512 INFO L273 TraceCheckUtils]: 32: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,512 INFO L273 TraceCheckUtils]: 33: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {3360#true} assume !(~i~0 < 5); {3360#true} is VALID [2018-11-23 12:16:43,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {3360#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3360#true} is VALID [2018-11-23 12:16:43,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {3360#true} assume true; {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3360#true} {3360#true} #75#return; {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {3360#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L256 TraceCheckUtils]: 39: Hoare triple {3360#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {3360#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L273 TraceCheckUtils]: 43: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L273 TraceCheckUtils]: 44: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,513 INFO L273 TraceCheckUtils]: 45: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,514 INFO L273 TraceCheckUtils]: 46: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,514 INFO L273 TraceCheckUtils]: 47: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,514 INFO L273 TraceCheckUtils]: 48: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,514 INFO L273 TraceCheckUtils]: 49: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,514 INFO L273 TraceCheckUtils]: 50: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,514 INFO L273 TraceCheckUtils]: 51: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,514 INFO L273 TraceCheckUtils]: 52: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,514 INFO L273 TraceCheckUtils]: 53: Hoare triple {3360#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3360#true} is VALID [2018-11-23 12:16:43,515 INFO L273 TraceCheckUtils]: 54: Hoare triple {3360#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3360#true} is VALID [2018-11-23 12:16:43,515 INFO L273 TraceCheckUtils]: 55: Hoare triple {3360#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3360#true} is VALID [2018-11-23 12:16:43,515 INFO L273 TraceCheckUtils]: 56: Hoare triple {3360#true} assume !(~i~0 < 5); {3360#true} is VALID [2018-11-23 12:16:43,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {3360#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3360#true} is VALID [2018-11-23 12:16:43,515 INFO L273 TraceCheckUtils]: 58: Hoare triple {3360#true} assume true; {3360#true} is VALID [2018-11-23 12:16:43,515 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3360#true} {3360#true} #77#return; {3360#true} is VALID [2018-11-23 12:16:43,516 INFO L273 TraceCheckUtils]: 60: Hoare triple {3360#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3548#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:43,516 INFO L273 TraceCheckUtils]: 61: Hoare triple {3548#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3548#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:43,517 INFO L273 TraceCheckUtils]: 62: Hoare triple {3548#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3363#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:43,517 INFO L273 TraceCheckUtils]: 63: Hoare triple {3363#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3363#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:43,517 INFO L273 TraceCheckUtils]: 64: Hoare triple {3363#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3364#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:43,518 INFO L273 TraceCheckUtils]: 65: Hoare triple {3364#(<= main_~i~2 2)} assume !(~i~2 < 4); {3361#false} is VALID [2018-11-23 12:16:43,518 INFO L273 TraceCheckUtils]: 66: Hoare triple {3361#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {3361#false} is VALID [2018-11-23 12:16:43,518 INFO L256 TraceCheckUtils]: 67: Hoare triple {3361#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3361#false} is VALID [2018-11-23 12:16:43,518 INFO L273 TraceCheckUtils]: 68: Hoare triple {3361#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3361#false} is VALID [2018-11-23 12:16:43,518 INFO L273 TraceCheckUtils]: 69: Hoare triple {3361#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3361#false} is VALID [2018-11-23 12:16:43,519 INFO L273 TraceCheckUtils]: 70: Hoare triple {3361#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3361#false} is VALID [2018-11-23 12:16:43,519 INFO L273 TraceCheckUtils]: 71: Hoare triple {3361#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3361#false} is VALID [2018-11-23 12:16:43,519 INFO L273 TraceCheckUtils]: 72: Hoare triple {3361#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3361#false} is VALID [2018-11-23 12:16:43,519 INFO L273 TraceCheckUtils]: 73: Hoare triple {3361#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3361#false} is VALID [2018-11-23 12:16:43,519 INFO L273 TraceCheckUtils]: 74: Hoare triple {3361#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3361#false} is VALID [2018-11-23 12:16:43,519 INFO L273 TraceCheckUtils]: 75: Hoare triple {3361#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3361#false} is VALID [2018-11-23 12:16:43,519 INFO L273 TraceCheckUtils]: 76: Hoare triple {3361#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3361#false} is VALID [2018-11-23 12:16:43,520 INFO L273 TraceCheckUtils]: 77: Hoare triple {3361#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3361#false} is VALID [2018-11-23 12:16:43,520 INFO L273 TraceCheckUtils]: 78: Hoare triple {3361#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3361#false} is VALID [2018-11-23 12:16:43,520 INFO L273 TraceCheckUtils]: 79: Hoare triple {3361#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3361#false} is VALID [2018-11-23 12:16:43,520 INFO L273 TraceCheckUtils]: 80: Hoare triple {3361#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3361#false} is VALID [2018-11-23 12:16:43,520 INFO L273 TraceCheckUtils]: 81: Hoare triple {3361#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3361#false} is VALID [2018-11-23 12:16:43,520 INFO L273 TraceCheckUtils]: 82: Hoare triple {3361#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3361#false} is VALID [2018-11-23 12:16:43,521 INFO L273 TraceCheckUtils]: 83: Hoare triple {3361#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3361#false} is VALID [2018-11-23 12:16:43,521 INFO L273 TraceCheckUtils]: 84: Hoare triple {3361#false} assume !(~i~0 < 5); {3361#false} is VALID [2018-11-23 12:16:43,521 INFO L273 TraceCheckUtils]: 85: Hoare triple {3361#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3361#false} is VALID [2018-11-23 12:16:43,521 INFO L273 TraceCheckUtils]: 86: Hoare triple {3361#false} assume true; {3361#false} is VALID [2018-11-23 12:16:43,521 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3361#false} {3361#false} #79#return; {3361#false} is VALID [2018-11-23 12:16:43,521 INFO L273 TraceCheckUtils]: 88: Hoare triple {3361#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3361#false} is VALID [2018-11-23 12:16:43,521 INFO L273 TraceCheckUtils]: 89: Hoare triple {3361#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3361#false} is VALID [2018-11-23 12:16:43,521 INFO L273 TraceCheckUtils]: 90: Hoare triple {3361#false} assume !false; {3361#false} is VALID [2018-11-23 12:16:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 12:16:43,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:43,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:16:43,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-23 12:16:43,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:43,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:16:43,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:43,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:16:43,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:16:43,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:43,593 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 6 states. [2018-11-23 12:16:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:43,765 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2018-11-23 12:16:43,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:16:43,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-23 12:16:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 12:16:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-23 12:16:43,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-23 12:16:43,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:43,903 INFO L225 Difference]: With dead ends: 81 [2018-11-23 12:16:43,903 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:16:43,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:16:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 12:16:43,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:43,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-23 12:16:43,926 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-23 12:16:43,926 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-23 12:16:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:43,929 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 12:16:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 12:16:43,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:43,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:43,930 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-23 12:16:43,931 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-23 12:16:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:43,933 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 12:16:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 12:16:43,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:43,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:43,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:43,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:16:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-23 12:16:43,935 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 91 [2018-11-23 12:16:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:43,936 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 12:16:43,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:16:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 12:16:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 12:16:43,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:43,937 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:43,937 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash -513954565, now seen corresponding path program 8 times [2018-11-23 12:16:43,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:43,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:43,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:44,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {3939#true} call ULTIMATE.init(); {3939#true} is VALID [2018-11-23 12:16:44,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {3939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3939#true} is VALID [2018-11-23 12:16:44,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {3939#true} assume true; {3939#true} is VALID [2018-11-23 12:16:44,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3939#true} {3939#true} #71#return; {3939#true} is VALID [2018-11-23 12:16:44,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {3939#true} call #t~ret14 := main(); {3939#true} is VALID [2018-11-23 12:16:44,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {3939#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3939#true} is VALID [2018-11-23 12:16:44,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:44,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:44,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:44,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:44,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:44,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:44,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:44,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:44,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:44,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:44,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {3939#true} assume !(~i~1 < 5); {3939#true} is VALID [2018-11-23 12:16:44,808 INFO L256 TraceCheckUtils]: 17: Hoare triple {3939#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3939#true} is VALID [2018-11-23 12:16:44,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {3939#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3939#true} is VALID [2018-11-23 12:16:44,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,811 INFO L273 TraceCheckUtils]: 32: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,812 INFO L273 TraceCheckUtils]: 34: Hoare triple {3939#true} assume !(~i~0 < 5); {3939#true} is VALID [2018-11-23 12:16:44,812 INFO L273 TraceCheckUtils]: 35: Hoare triple {3939#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3939#true} is VALID [2018-11-23 12:16:44,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {3939#true} assume true; {3939#true} is VALID [2018-11-23 12:16:44,812 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3939#true} {3939#true} #75#return; {3939#true} is VALID [2018-11-23 12:16:44,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {3939#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3939#true} is VALID [2018-11-23 12:16:44,813 INFO L256 TraceCheckUtils]: 39: Hoare triple {3939#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3939#true} is VALID [2018-11-23 12:16:44,813 INFO L273 TraceCheckUtils]: 40: Hoare triple {3939#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3939#true} is VALID [2018-11-23 12:16:44,813 INFO L273 TraceCheckUtils]: 41: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,813 INFO L273 TraceCheckUtils]: 42: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,814 INFO L273 TraceCheckUtils]: 43: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,814 INFO L273 TraceCheckUtils]: 44: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,814 INFO L273 TraceCheckUtils]: 46: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,815 INFO L273 TraceCheckUtils]: 47: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,815 INFO L273 TraceCheckUtils]: 48: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,815 INFO L273 TraceCheckUtils]: 49: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,816 INFO L273 TraceCheckUtils]: 52: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,816 INFO L273 TraceCheckUtils]: 53: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,816 INFO L273 TraceCheckUtils]: 54: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,816 INFO L273 TraceCheckUtils]: 55: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,817 INFO L273 TraceCheckUtils]: 56: Hoare triple {3939#true} assume !(~i~0 < 5); {3939#true} is VALID [2018-11-23 12:16:44,817 INFO L273 TraceCheckUtils]: 57: Hoare triple {3939#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3939#true} is VALID [2018-11-23 12:16:44,817 INFO L273 TraceCheckUtils]: 58: Hoare triple {3939#true} assume true; {3939#true} is VALID [2018-11-23 12:16:44,817 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3939#true} {3939#true} #77#return; {3939#true} is VALID [2018-11-23 12:16:44,836 INFO L273 TraceCheckUtils]: 60: Hoare triple {3939#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3941#(= main_~i~2 0)} is VALID [2018-11-23 12:16:44,845 INFO L273 TraceCheckUtils]: 61: Hoare triple {3941#(= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3941#(= main_~i~2 0)} is VALID [2018-11-23 12:16:44,858 INFO L273 TraceCheckUtils]: 62: Hoare triple {3941#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3942#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:44,871 INFO L273 TraceCheckUtils]: 63: Hoare triple {3942#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3942#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:44,883 INFO L273 TraceCheckUtils]: 64: Hoare triple {3942#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3943#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:44,901 INFO L273 TraceCheckUtils]: 65: Hoare triple {3943#(<= main_~i~2 2)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3943#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:44,910 INFO L273 TraceCheckUtils]: 66: Hoare triple {3943#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3944#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:44,918 INFO L273 TraceCheckUtils]: 67: Hoare triple {3944#(<= main_~i~2 3)} assume !(~i~2 < 4); {3940#false} is VALID [2018-11-23 12:16:44,918 INFO L273 TraceCheckUtils]: 68: Hoare triple {3940#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {3940#false} is VALID [2018-11-23 12:16:44,918 INFO L256 TraceCheckUtils]: 69: Hoare triple {3940#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3939#true} is VALID [2018-11-23 12:16:44,918 INFO L273 TraceCheckUtils]: 70: Hoare triple {3939#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3939#true} is VALID [2018-11-23 12:16:44,919 INFO L273 TraceCheckUtils]: 71: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,919 INFO L273 TraceCheckUtils]: 72: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,919 INFO L273 TraceCheckUtils]: 73: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,919 INFO L273 TraceCheckUtils]: 74: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,919 INFO L273 TraceCheckUtils]: 75: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,919 INFO L273 TraceCheckUtils]: 76: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,919 INFO L273 TraceCheckUtils]: 77: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,919 INFO L273 TraceCheckUtils]: 78: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,920 INFO L273 TraceCheckUtils]: 79: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,920 INFO L273 TraceCheckUtils]: 80: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,920 INFO L273 TraceCheckUtils]: 81: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,920 INFO L273 TraceCheckUtils]: 82: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,920 INFO L273 TraceCheckUtils]: 83: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:44,920 INFO L273 TraceCheckUtils]: 84: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:44,920 INFO L273 TraceCheckUtils]: 85: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:44,920 INFO L273 TraceCheckUtils]: 86: Hoare triple {3939#true} assume !(~i~0 < 5); {3939#true} is VALID [2018-11-23 12:16:44,921 INFO L273 TraceCheckUtils]: 87: Hoare triple {3939#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3939#true} is VALID [2018-11-23 12:16:44,921 INFO L273 TraceCheckUtils]: 88: Hoare triple {3939#true} assume true; {3939#true} is VALID [2018-11-23 12:16:44,921 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {3939#true} {3940#false} #79#return; {3940#false} is VALID [2018-11-23 12:16:44,921 INFO L273 TraceCheckUtils]: 90: Hoare triple {3940#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3940#false} is VALID [2018-11-23 12:16:44,921 INFO L273 TraceCheckUtils]: 91: Hoare triple {3940#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3940#false} is VALID [2018-11-23 12:16:44,921 INFO L273 TraceCheckUtils]: 92: Hoare triple {3940#false} assume !false; {3940#false} is VALID [2018-11-23 12:16:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-23 12:16:44,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:44,925 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 12:16:44,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:44,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:44,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:45,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:45,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {3939#true} call ULTIMATE.init(); {3939#true} is VALID [2018-11-23 12:16:45,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {3939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3939#true} is VALID [2018-11-23 12:16:45,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {3939#true} assume true; {3939#true} is VALID [2018-11-23 12:16:45,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3939#true} {3939#true} #71#return; {3939#true} is VALID [2018-11-23 12:16:45,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {3939#true} call #t~ret14 := main(); {3939#true} is VALID [2018-11-23 12:16:45,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {3939#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3939#true} is VALID [2018-11-23 12:16:45,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:45,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:45,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:45,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:45,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:45,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:45,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:45,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:45,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {3939#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3939#true} is VALID [2018-11-23 12:16:45,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {3939#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3939#true} is VALID [2018-11-23 12:16:45,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {3939#true} assume !(~i~1 < 5); {3939#true} is VALID [2018-11-23 12:16:45,149 INFO L256 TraceCheckUtils]: 17: Hoare triple {3939#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {3939#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,151 INFO L273 TraceCheckUtils]: 27: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,151 INFO L273 TraceCheckUtils]: 29: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,151 INFO L273 TraceCheckUtils]: 31: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,151 INFO L273 TraceCheckUtils]: 32: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,151 INFO L273 TraceCheckUtils]: 33: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {3939#true} assume !(~i~0 < 5); {3939#true} is VALID [2018-11-23 12:16:45,152 INFO L273 TraceCheckUtils]: 35: Hoare triple {3939#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3939#true} is VALID [2018-11-23 12:16:45,152 INFO L273 TraceCheckUtils]: 36: Hoare triple {3939#true} assume true; {3939#true} is VALID [2018-11-23 12:16:45,152 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3939#true} {3939#true} #75#return; {3939#true} is VALID [2018-11-23 12:16:45,152 INFO L273 TraceCheckUtils]: 38: Hoare triple {3939#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3939#true} is VALID [2018-11-23 12:16:45,152 INFO L256 TraceCheckUtils]: 39: Hoare triple {3939#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3939#true} is VALID [2018-11-23 12:16:45,152 INFO L273 TraceCheckUtils]: 40: Hoare triple {3939#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3939#true} is VALID [2018-11-23 12:16:45,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,153 INFO L273 TraceCheckUtils]: 46: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,153 INFO L273 TraceCheckUtils]: 49: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,153 INFO L273 TraceCheckUtils]: 50: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,154 INFO L273 TraceCheckUtils]: 51: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,154 INFO L273 TraceCheckUtils]: 52: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,154 INFO L273 TraceCheckUtils]: 53: Hoare triple {3939#true} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3939#true} is VALID [2018-11-23 12:16:45,154 INFO L273 TraceCheckUtils]: 54: Hoare triple {3939#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3939#true} is VALID [2018-11-23 12:16:45,154 INFO L273 TraceCheckUtils]: 55: Hoare triple {3939#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3939#true} is VALID [2018-11-23 12:16:45,154 INFO L273 TraceCheckUtils]: 56: Hoare triple {3939#true} assume !(~i~0 < 5); {3939#true} is VALID [2018-11-23 12:16:45,154 INFO L273 TraceCheckUtils]: 57: Hoare triple {3939#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3939#true} is VALID [2018-11-23 12:16:45,154 INFO L273 TraceCheckUtils]: 58: Hoare triple {3939#true} assume true; {3939#true} is VALID [2018-11-23 12:16:45,155 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3939#true} {3939#true} #77#return; {3939#true} is VALID [2018-11-23 12:16:45,155 INFO L273 TraceCheckUtils]: 60: Hoare triple {3939#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4128#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:45,156 INFO L273 TraceCheckUtils]: 61: Hoare triple {4128#(<= main_~i~2 0)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4128#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:45,156 INFO L273 TraceCheckUtils]: 62: Hoare triple {4128#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3942#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:45,156 INFO L273 TraceCheckUtils]: 63: Hoare triple {3942#(<= main_~i~2 1)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3942#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:45,157 INFO L273 TraceCheckUtils]: 64: Hoare triple {3942#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3943#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:45,157 INFO L273 TraceCheckUtils]: 65: Hoare triple {3943#(<= main_~i~2 2)} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3943#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:45,158 INFO L273 TraceCheckUtils]: 66: Hoare triple {3943#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3944#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:45,158 INFO L273 TraceCheckUtils]: 67: Hoare triple {3944#(<= main_~i~2 3)} assume !(~i~2 < 4); {3940#false} is VALID [2018-11-23 12:16:45,158 INFO L273 TraceCheckUtils]: 68: Hoare triple {3940#false} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {3940#false} is VALID [2018-11-23 12:16:45,158 INFO L256 TraceCheckUtils]: 69: Hoare triple {3940#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3940#false} is VALID [2018-11-23 12:16:45,158 INFO L273 TraceCheckUtils]: 70: Hoare triple {3940#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3940#false} is VALID [2018-11-23 12:16:45,159 INFO L273 TraceCheckUtils]: 71: Hoare triple {3940#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3940#false} is VALID [2018-11-23 12:16:45,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {3940#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3940#false} is VALID [2018-11-23 12:16:45,159 INFO L273 TraceCheckUtils]: 73: Hoare triple {3940#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3940#false} is VALID [2018-11-23 12:16:45,159 INFO L273 TraceCheckUtils]: 74: Hoare triple {3940#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3940#false} is VALID [2018-11-23 12:16:45,159 INFO L273 TraceCheckUtils]: 75: Hoare triple {3940#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3940#false} is VALID [2018-11-23 12:16:45,159 INFO L273 TraceCheckUtils]: 76: Hoare triple {3940#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3940#false} is VALID [2018-11-23 12:16:45,159 INFO L273 TraceCheckUtils]: 77: Hoare triple {3940#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3940#false} is VALID [2018-11-23 12:16:45,159 INFO L273 TraceCheckUtils]: 78: Hoare triple {3940#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3940#false} is VALID [2018-11-23 12:16:45,160 INFO L273 TraceCheckUtils]: 79: Hoare triple {3940#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3940#false} is VALID [2018-11-23 12:16:45,160 INFO L273 TraceCheckUtils]: 80: Hoare triple {3940#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3940#false} is VALID [2018-11-23 12:16:45,160 INFO L273 TraceCheckUtils]: 81: Hoare triple {3940#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3940#false} is VALID [2018-11-23 12:16:45,160 INFO L273 TraceCheckUtils]: 82: Hoare triple {3940#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3940#false} is VALID [2018-11-23 12:16:45,160 INFO L273 TraceCheckUtils]: 83: Hoare triple {3940#false} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3940#false} is VALID [2018-11-23 12:16:45,160 INFO L273 TraceCheckUtils]: 84: Hoare triple {3940#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3940#false} is VALID [2018-11-23 12:16:45,160 INFO L273 TraceCheckUtils]: 85: Hoare triple {3940#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3940#false} is VALID [2018-11-23 12:16:45,160 INFO L273 TraceCheckUtils]: 86: Hoare triple {3940#false} assume !(~i~0 < 5); {3940#false} is VALID [2018-11-23 12:16:45,161 INFO L273 TraceCheckUtils]: 87: Hoare triple {3940#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3940#false} is VALID [2018-11-23 12:16:45,161 INFO L273 TraceCheckUtils]: 88: Hoare triple {3940#false} assume true; {3940#false} is VALID [2018-11-23 12:16:45,161 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {3940#false} {3940#false} #79#return; {3940#false} is VALID [2018-11-23 12:16:45,161 INFO L273 TraceCheckUtils]: 90: Hoare triple {3940#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3940#false} is VALID [2018-11-23 12:16:45,161 INFO L273 TraceCheckUtils]: 91: Hoare triple {3940#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3940#false} is VALID [2018-11-23 12:16:45,161 INFO L273 TraceCheckUtils]: 92: Hoare triple {3940#false} assume !false; {3940#false} is VALID [2018-11-23 12:16:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 12:16:45,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:45,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:16:45,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-23 12:16:45,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:45,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:16:45,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:45,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:16:45,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:16:45,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:45,230 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 7 states. [2018-11-23 12:16:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:45,477 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-11-23 12:16:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:16:45,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-23 12:16:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:16:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 12:16:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:16:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 12:16:45,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-23 12:16:45,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:45,555 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:16:45,555 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:16:45,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:16:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:16:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 12:16:45,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:45,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 12:16:45,582 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:16:45,582 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:16:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:45,584 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 12:16:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 12:16:45,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:45,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:45,585 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:16:45,585 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:16:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:45,587 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 12:16:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 12:16:45,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:45,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:45,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:45,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:16:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-11-23 12:16:45,590 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 93 [2018-11-23 12:16:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:45,591 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-23 12:16:45,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:16:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 12:16:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 12:16:45,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:45,592 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:45,593 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:45,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1590918909, now seen corresponding path program 9 times [2018-11-23 12:16:45,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:45,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:45,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:45,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:45,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:47,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {4532#true} call ULTIMATE.init(); {4532#true} is VALID [2018-11-23 12:16:47,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {4532#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4532#true} is VALID [2018-11-23 12:16:47,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {4532#true} assume true; {4532#true} is VALID [2018-11-23 12:16:47,010 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4532#true} {4532#true} #71#return; {4532#true} is VALID [2018-11-23 12:16:47,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {4532#true} call #t~ret14 := main(); {4532#true} is VALID [2018-11-23 12:16:47,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {4532#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4532#true} is VALID [2018-11-23 12:16:47,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:47,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:47,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:47,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:47,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:47,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:47,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:47,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:47,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:47,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:47,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {4532#true} assume !(~i~1 < 5); {4532#true} is VALID [2018-11-23 12:16:47,014 INFO L256 TraceCheckUtils]: 17: Hoare triple {4532#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {4532#true} is VALID [2018-11-23 12:16:47,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {4532#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:47,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {4534#(= sep_~ret~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:47,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {4534#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,022 INFO L273 TraceCheckUtils]: 29: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,023 INFO L273 TraceCheckUtils]: 30: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,024 INFO L273 TraceCheckUtils]: 31: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,025 INFO L273 TraceCheckUtils]: 32: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !(~i~0 < 5); {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:47,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {4540#(= |sep_#res| 5)} assume true; {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:47,031 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {4540#(= |sep_#res| 5)} {4532#true} #75#return; {4541#(and (<= 5 |main_#t~ret6|) (<= |main_#t~ret6| 5))} is VALID [2018-11-23 12:16:47,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {4541#(and (<= 5 |main_#t~ret6|) (<= |main_#t~ret6| 5))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4542#(= main_~ret~1 5)} is VALID [2018-11-23 12:16:47,032 INFO L256 TraceCheckUtils]: 39: Hoare triple {4542#(= main_~ret~1 5)} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {4532#true} is VALID [2018-11-23 12:16:47,033 INFO L273 TraceCheckUtils]: 40: Hoare triple {4532#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:47,034 INFO L273 TraceCheckUtils]: 41: Hoare triple {4534#(= sep_~ret~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:47,035 INFO L273 TraceCheckUtils]: 42: Hoare triple {4534#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,036 INFO L273 TraceCheckUtils]: 43: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,037 INFO L273 TraceCheckUtils]: 44: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,038 INFO L273 TraceCheckUtils]: 45: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,039 INFO L273 TraceCheckUtils]: 46: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,040 INFO L273 TraceCheckUtils]: 47: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,041 INFO L273 TraceCheckUtils]: 48: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,042 INFO L273 TraceCheckUtils]: 49: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,042 INFO L273 TraceCheckUtils]: 50: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,045 INFO L273 TraceCheckUtils]: 52: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,047 INFO L273 TraceCheckUtils]: 54: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,047 INFO L273 TraceCheckUtils]: 55: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !(~i~0 < 5); {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,050 INFO L273 TraceCheckUtils]: 57: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:47,050 INFO L273 TraceCheckUtils]: 58: Hoare triple {4540#(= |sep_#res| 5)} assume true; {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:47,052 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {4540#(= |sep_#res| 5)} {4542#(= main_~ret~1 5)} #77#return; {4543#(and (= main_~ret~1 |main_#t~ret9|) (= main_~ret~1 5))} is VALID [2018-11-23 12:16:47,053 INFO L273 TraceCheckUtils]: 60: Hoare triple {4543#(and (= main_~ret~1 |main_#t~ret9|) (= main_~ret~1 5))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,055 INFO L273 TraceCheckUtils]: 61: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,055 INFO L273 TraceCheckUtils]: 62: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,056 INFO L273 TraceCheckUtils]: 63: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,056 INFO L273 TraceCheckUtils]: 64: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,057 INFO L273 TraceCheckUtils]: 65: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,058 INFO L273 TraceCheckUtils]: 66: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,059 INFO L273 TraceCheckUtils]: 67: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,060 INFO L273 TraceCheckUtils]: 68: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,061 INFO L273 TraceCheckUtils]: 69: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !(~i~2 < 4); {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,061 INFO L273 TraceCheckUtils]: 70: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,062 INFO L256 TraceCheckUtils]: 71: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {4532#true} is VALID [2018-11-23 12:16:47,062 INFO L273 TraceCheckUtils]: 72: Hoare triple {4532#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:47,062 INFO L273 TraceCheckUtils]: 73: Hoare triple {4534#(= sep_~ret~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:47,064 INFO L273 TraceCheckUtils]: 74: Hoare triple {4534#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,064 INFO L273 TraceCheckUtils]: 75: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,065 INFO L273 TraceCheckUtils]: 76: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:47,066 INFO L273 TraceCheckUtils]: 77: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,066 INFO L273 TraceCheckUtils]: 78: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,067 INFO L273 TraceCheckUtils]: 79: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:47,068 INFO L273 TraceCheckUtils]: 80: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,069 INFO L273 TraceCheckUtils]: 81: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,069 INFO L273 TraceCheckUtils]: 82: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:47,071 INFO L273 TraceCheckUtils]: 83: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,088 INFO L273 TraceCheckUtils]: 84: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,089 INFO L273 TraceCheckUtils]: 85: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:47,090 INFO L273 TraceCheckUtils]: 86: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,091 INFO L273 TraceCheckUtils]: 87: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,091 INFO L273 TraceCheckUtils]: 88: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !(~i~0 < 5); {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:47,092 INFO L273 TraceCheckUtils]: 89: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:47,092 INFO L273 TraceCheckUtils]: 90: Hoare triple {4540#(= |sep_#res| 5)} assume true; {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:47,094 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {4540#(= |sep_#res| 5)} {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #79#return; {4545#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 |main_#t~ret13|))} is VALID [2018-11-23 12:16:47,095 INFO L273 TraceCheckUtils]: 92: Hoare triple {4545#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 |main_#t~ret13|))} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4546#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:47,096 INFO L273 TraceCheckUtils]: 93: Hoare triple {4546#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4533#false} is VALID [2018-11-23 12:16:47,096 INFO L273 TraceCheckUtils]: 94: Hoare triple {4533#false} assume !false; {4533#false} is VALID [2018-11-23 12:16:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 12:16:47,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:47,121 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 12:16:47,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:47,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:16:47,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:47,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:48,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {4532#true} call ULTIMATE.init(); {4532#true} is VALID [2018-11-23 12:16:48,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {4532#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4532#true} is VALID [2018-11-23 12:16:48,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {4532#true} assume true; {4532#true} is VALID [2018-11-23 12:16:48,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4532#true} {4532#true} #71#return; {4532#true} is VALID [2018-11-23 12:16:48,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {4532#true} call #t~ret14 := main(); {4532#true} is VALID [2018-11-23 12:16:48,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {4532#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4532#true} is VALID [2018-11-23 12:16:48,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:48,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:48,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:48,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:48,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:48,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:48,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:48,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:48,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {4532#true} assume !!(~i~1 < 5);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4532#true} is VALID [2018-11-23 12:16:48,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {4532#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4532#true} is VALID [2018-11-23 12:16:48,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {4532#true} assume !(~i~1 < 5); {4532#true} is VALID [2018-11-23 12:16:48,641 INFO L256 TraceCheckUtils]: 17: Hoare triple {4532#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {4532#true} is VALID [2018-11-23 12:16:48,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {4532#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:48,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {4534#(= sep_~ret~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:48,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {4534#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,660 INFO L273 TraceCheckUtils]: 24: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,661 INFO L273 TraceCheckUtils]: 25: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,661 INFO L273 TraceCheckUtils]: 26: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,662 INFO L273 TraceCheckUtils]: 27: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !(~i~0 < 5); {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:48,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {4540#(= |sep_#res| 5)} assume true; {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:48,671 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {4540#(= |sep_#res| 5)} {4532#true} #75#return; {4541#(and (<= 5 |main_#t~ret6|) (<= |main_#t~ret6| 5))} is VALID [2018-11-23 12:16:48,672 INFO L273 TraceCheckUtils]: 38: Hoare triple {4541#(and (<= 5 |main_#t~ret6|) (<= |main_#t~ret6| 5))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4542#(= main_~ret~1 5)} is VALID [2018-11-23 12:16:48,672 INFO L256 TraceCheckUtils]: 39: Hoare triple {4542#(= main_~ret~1 5)} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {4532#true} is VALID [2018-11-23 12:16:48,673 INFO L273 TraceCheckUtils]: 40: Hoare triple {4532#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:48,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {4534#(= sep_~ret~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:48,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {4534#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,675 INFO L273 TraceCheckUtils]: 43: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,675 INFO L273 TraceCheckUtils]: 44: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,676 INFO L273 TraceCheckUtils]: 45: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,677 INFO L273 TraceCheckUtils]: 46: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,678 INFO L273 TraceCheckUtils]: 47: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,679 INFO L273 TraceCheckUtils]: 48: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,680 INFO L273 TraceCheckUtils]: 49: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,680 INFO L273 TraceCheckUtils]: 50: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,682 INFO L273 TraceCheckUtils]: 51: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,682 INFO L273 TraceCheckUtils]: 52: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,683 INFO L273 TraceCheckUtils]: 53: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,684 INFO L273 TraceCheckUtils]: 54: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,685 INFO L273 TraceCheckUtils]: 55: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,685 INFO L273 TraceCheckUtils]: 56: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !(~i~0 < 5); {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,687 INFO L273 TraceCheckUtils]: 57: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:48,687 INFO L273 TraceCheckUtils]: 58: Hoare triple {4540#(= |sep_#res| 5)} assume true; {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:48,689 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {4540#(= |sep_#res| 5)} {4542#(= main_~ret~1 5)} #77#return; {4543#(and (= main_~ret~1 |main_#t~ret9|) (= main_~ret~1 5))} is VALID [2018-11-23 12:16:48,689 INFO L273 TraceCheckUtils]: 60: Hoare triple {4543#(and (= main_~ret~1 |main_#t~ret9|) (= main_~ret~1 5))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,691 INFO L273 TraceCheckUtils]: 62: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,692 INFO L273 TraceCheckUtils]: 63: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,693 INFO L273 TraceCheckUtils]: 64: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,693 INFO L273 TraceCheckUtils]: 65: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,694 INFO L273 TraceCheckUtils]: 66: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,695 INFO L273 TraceCheckUtils]: 67: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 4);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,696 INFO L273 TraceCheckUtils]: 68: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,696 INFO L273 TraceCheckUtils]: 69: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume !(~i~2 < 4); {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} call write~int(~temp~0, ~#x~0.base, 16 + ~#x~0.offset, 4); {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,697 INFO L256 TraceCheckUtils]: 71: Hoare triple {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {4532#true} is VALID [2018-11-23 12:16:48,698 INFO L273 TraceCheckUtils]: 72: Hoare triple {4532#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:48,698 INFO L273 TraceCheckUtils]: 73: Hoare triple {4534#(= sep_~ret~0 0)} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4534#(= sep_~ret~0 0)} is VALID [2018-11-23 12:16:48,699 INFO L273 TraceCheckUtils]: 74: Hoare triple {4534#(= sep_~ret~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,700 INFO L273 TraceCheckUtils]: 75: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,700 INFO L273 TraceCheckUtils]: 76: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:16:48,702 INFO L273 TraceCheckUtils]: 77: Hoare triple {4535#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,702 INFO L273 TraceCheckUtils]: 78: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,703 INFO L273 TraceCheckUtils]: 79: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:16:48,704 INFO L273 TraceCheckUtils]: 80: Hoare triple {4536#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,705 INFO L273 TraceCheckUtils]: 81: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,706 INFO L273 TraceCheckUtils]: 82: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:16:48,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {4537#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,707 INFO L273 TraceCheckUtils]: 84: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,708 INFO L273 TraceCheckUtils]: 85: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 5);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:16:48,727 INFO L273 TraceCheckUtils]: 86: Hoare triple {4538#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,736 INFO L273 TraceCheckUtils]: 87: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,737 INFO L273 TraceCheckUtils]: 88: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !(~i~0 < 5); {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:16:48,738 INFO L273 TraceCheckUtils]: 89: Hoare triple {4539#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:48,738 INFO L273 TraceCheckUtils]: 90: Hoare triple {4540#(= |sep_#res| 5)} assume true; {4540#(= |sep_#res| 5)} is VALID [2018-11-23 12:16:48,743 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {4540#(= |sep_#res| 5)} {4544#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} #79#return; {4823#(and (= |main_#t~ret13| 5) (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:16:48,744 INFO L273 TraceCheckUtils]: 92: Hoare triple {4823#(and (= |main_#t~ret13| 5) (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1))} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4827#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1) (= main_~ret5~0 5))} is VALID [2018-11-23 12:16:48,744 INFO L273 TraceCheckUtils]: 93: Hoare triple {4827#(and (= main_~ret~1 5) (= main_~ret2~0 main_~ret~1) (= main_~ret5~0 5))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4533#false} is VALID [2018-11-23 12:16:48,744 INFO L273 TraceCheckUtils]: 94: Hoare triple {4533#false} assume !false; {4533#false} is VALID [2018-11-23 12:16:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 12:16:48,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:48,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-11-23 12:16:48,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-11-23 12:16:48,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:48,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:16:48,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:48,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:16:48,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:16:48,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:16:48,828 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 17 states. [2018-11-23 12:16:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,283 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2018-11-23 12:16:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:16:51,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-11-23 12:16:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:16:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2018-11-23 12:16:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:16:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2018-11-23 12:16:51,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 136 transitions. [2018-11-23 12:16:51,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:51,520 INFO L225 Difference]: With dead ends: 151 [2018-11-23 12:16:51,520 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 12:16:51,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 91 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:16:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 12:16:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 112. [2018-11-23 12:16:51,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:51,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 112 states. [2018-11-23 12:16:51,634 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 112 states. [2018-11-23 12:16:51,634 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 112 states. [2018-11-23 12:16:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,642 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-11-23 12:16:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 205 transitions. [2018-11-23 12:16:51,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,644 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 147 states. [2018-11-23 12:16:51,644 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 147 states. [2018-11-23 12:16:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,652 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-11-23 12:16:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 205 transitions. [2018-11-23 12:16:51,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:51,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:16:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2018-11-23 12:16:51,658 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 95 [2018-11-23 12:16:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:51,658 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2018-11-23 12:16:51,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:16:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2018-11-23 12:16:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 12:16:51,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:51,661 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:51,661 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:51,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2023990017, now seen corresponding path program 1 times [2018-11-23 12:16:51,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:51,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:53,396 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:16:53,403 INFO L168 Benchmark]: Toolchain (without parser) took 23394.85 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -447.5 MB). Peak memory consumption was 638.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:53,405 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:16:53,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:53,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:16:53,407 INFO L168 Benchmark]: Boogie Preprocessor took 57.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:16:53,407 INFO L168 Benchmark]: RCFGBuilder took 1058.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:53,408 INFO L168 Benchmark]: TraceAbstraction took 21910.76 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 347.1 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 310.4 MB). Peak memory consumption was 657.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:53,411 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1058.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21910.76 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 347.1 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 310.4 MB). Peak memory consumption was 657.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...