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/loop-industry-pattern/mod3_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:15:02,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:15:02,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:15:02,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:15:02,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:15:02,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:15:02,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:15:02,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:15:02,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:15:02,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:15:02,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:15:02,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:15:02,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:15:02,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:15:02,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:15:02,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:15:02,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:15:02,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:15:02,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:15:02,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:15:02,313 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:15:02,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:15:02,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:15:02,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:15:02,325 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:15:02,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:15:02,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:15:02,330 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:15:02,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:15:02,333 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:15:02,333 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:15:02,334 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:15:02,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:15:02,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:15:02,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:15:02,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:15:02,339 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 13:15:02,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:15:02,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:15:02,371 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:15:02,371 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:15:02,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:15:02,372 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:15:02,372 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:15:02,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:15:02,374 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:15:02,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:15:02,374 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:15:02,374 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:15:02,374 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:15:02,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:15:02,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:15:02,375 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:15:02,375 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:15:02,376 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:15:02,377 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:15:02,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:15:02,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:15:02,377 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:15:02,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:15:02,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:15:02,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:15:02,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:15:02,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:15:02,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:15:02,379 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:15:02,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:15:02,380 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:15:02,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:15:02,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:15:02,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:15:02,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:15:02,468 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:15:02,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c [2018-11-23 13:15:02,538 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c0f3829/da753bea7d724f57881aa1ca54030582/FLAG25a41024c [2018-11-23 13:15:03,013 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:15:03,014 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c [2018-11-23 13:15:03,020 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c0f3829/da753bea7d724f57881aa1ca54030582/FLAG25a41024c [2018-11-23 13:15:03,382 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c0f3829/da753bea7d724f57881aa1ca54030582 [2018-11-23 13:15:03,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:15:03,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:15:03,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:15:03,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:15:03,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:15:03,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f612feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03, skipping insertion in model container [2018-11-23 13:15:03,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:15:03,441 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:15:03,686 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:15:03,691 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:15:03,720 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:15:03,739 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:15:03,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03 WrapperNode [2018-11-23 13:15:03,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:15:03,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:15:03,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:15:03,741 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:15:03,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:15:03,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:15:03,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:15:03,769 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:15:03,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 13:15:03,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:15:03,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:15:03,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:15:03,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:15:03,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (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 13:15:03,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:15:03,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:15:03,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:15:03,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:15:03,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:15:03,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:15:03,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:15:03,948 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:15:04,457 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:15:04,458 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:15:04,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:04 BoogieIcfgContainer [2018-11-23 13:15:04,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:15:04,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:15:04,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:15:04,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:15:04,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:15:03" (1/3) ... [2018-11-23 13:15:04,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768b4cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:15:04, skipping insertion in model container [2018-11-23 13:15:04,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (2/3) ... [2018-11-23 13:15:04,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768b4cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:15:04, skipping insertion in model container [2018-11-23 13:15:04,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:04" (3/3) ... [2018-11-23 13:15:04,467 INFO L112 eAbstractionObserver]: Analyzing ICFG mod3_true-unreach-call.c [2018-11-23 13:15:04,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:15:04,488 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:15:04,506 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:15:04,540 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:15:04,541 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:15:04,541 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:15:04,541 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:15:04,542 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:15:04,542 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:15:04,542 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:15:04,542 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:15:04,543 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:15:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 13:15:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:15:04,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:04,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:04,579 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:04,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash 271538127, now seen corresponding path program 1 times [2018-11-23 13:15:04,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:04,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:04,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:04,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 13:15:04,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 13:15:04,734 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2018-11-23 13:15:04,735 INFO L256 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret2 := main(); {26#true} is VALID [2018-11-23 13:15:04,735 INFO L273 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~x~0;~y~0 := 1; {26#true} is VALID [2018-11-23 13:15:04,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 13:15:04,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#false} assume 0 == ~y~0 % 4294967296; {27#false} is VALID [2018-11-23 13:15:04,740 INFO L256 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {27#false} is VALID [2018-11-23 13:15:04,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 13:15:04,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2018-11-23 13:15:04,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 13:15:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:04,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:15:04,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:15:04,751 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:15:04,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:04,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:15:04,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:04,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:15:04,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:15:04,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:15:04,826 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 13:15:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:04,975 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-23 13:15:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:15:04,975 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:15:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:15:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-23 13:15:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:15:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-23 13:15:04,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 44 transitions. [2018-11-23 13:15:05,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:05,370 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:15:05,370 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:15:05,373 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 13:15:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:15:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:15:05,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:05,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:15:05,433 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:15:05,433 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:15:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:05,437 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-23 13:15:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-11-23 13:15:05,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:05,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:05,438 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:15:05,438 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:15:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:05,441 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-23 13:15:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-11-23 13:15:05,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:05,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:05,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:05,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:15:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-23 13:15:05,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2018-11-23 13:15:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:05,447 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 13:15:05,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:15:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-11-23 13:15:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:15:05,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:05,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:05,449 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:05,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash 183026044, now seen corresponding path program 1 times [2018-11-23 13:15:05,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:05,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:05,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:05,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {130#true} call ULTIMATE.init(); {130#true} is VALID [2018-11-23 13:15:05,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {130#true} assume true; {130#true} is VALID [2018-11-23 13:15:05,622 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {130#true} {130#true} #55#return; {130#true} is VALID [2018-11-23 13:15:05,622 INFO L256 TraceCheckUtils]: 3: Hoare triple {130#true} call #t~ret2 := main(); {130#true} is VALID [2018-11-23 13:15:05,623 INFO L273 TraceCheckUtils]: 4: Hoare triple {130#true} havoc ~x~0;~y~0 := 1; {132#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} is VALID [2018-11-23 13:15:05,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {132#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} is VALID [2018-11-23 13:15:05,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} assume !(0 != #t~nondet0);havoc #t~nondet0; {132#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} is VALID [2018-11-23 13:15:05,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {132#(and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))} assume 0 == ~y~0 % 4294967296; {131#false} is VALID [2018-11-23 13:15:05,630 INFO L256 TraceCheckUtils]: 8: Hoare triple {131#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {131#false} is VALID [2018-11-23 13:15:05,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {131#false} ~cond := #in~cond; {131#false} is VALID [2018-11-23 13:15:05,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {131#false} assume 0 == ~cond; {131#false} is VALID [2018-11-23 13:15:05,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {131#false} assume !false; {131#false} is VALID [2018-11-23 13:15:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:15:05,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:15:05,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:15:05,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:05,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:15:05,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:05,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:15:05,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:15:05,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:15:05,695 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 3 states. [2018-11-23 13:15:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:05,921 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 13:15:05,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:15:05,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:15:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-23 13:15:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:15:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-11-23 13:15:05,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2018-11-23 13:15:05,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:05,996 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:15:05,996 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:15:05,997 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 13:15:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:15:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-11-23 13:15:06,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:06,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 18 states. [2018-11-23 13:15:06,012 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 18 states. [2018-11-23 13:15:06,012 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 18 states. [2018-11-23 13:15:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:06,015 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-11-23 13:15:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-11-23 13:15:06,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:06,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:06,016 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 21 states. [2018-11-23 13:15:06,016 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 21 states. [2018-11-23 13:15:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:06,019 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2018-11-23 13:15:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-11-23 13:15:06,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:06,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:06,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:06,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:15:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-23 13:15:06,023 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2018-11-23 13:15:06,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:06,023 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 13:15:06,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:15:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 13:15:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:15:06,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:06,024 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:06,025 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:06,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1587594336, now seen corresponding path program 1 times [2018-11-23 13:15:06,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:06,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:06,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:06,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {240#true} is VALID [2018-11-23 13:15:06,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2018-11-23 13:15:06,630 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} #55#return; {240#true} is VALID [2018-11-23 13:15:06,630 INFO L256 TraceCheckUtils]: 3: Hoare triple {240#true} call #t~ret2 := main(); {240#true} is VALID [2018-11-23 13:15:06,630 INFO L273 TraceCheckUtils]: 4: Hoare triple {240#true} havoc ~x~0;~y~0 := 1; {240#true} is VALID [2018-11-23 13:15:06,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {240#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {240#true} is VALID [2018-11-23 13:15:06,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {240#true} assume !!(0 != #t~nondet0);havoc #t~nondet0; {240#true} is VALID [2018-11-23 13:15:08,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {240#true} assume 1 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296;~x~0 := 2 + ~x~0;~y~0 := 0; {242#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is UNKNOWN [2018-11-23 13:15:08,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {242#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {242#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-23 13:15:08,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {242#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume !(0 != #t~nondet0);havoc #t~nondet0; {242#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-23 13:15:08,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {242#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume 0 == ~y~0 % 4294967296; {242#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-23 13:15:08,668 INFO L256 TraceCheckUtils]: 11: Hoare triple {242#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {243#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:08,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {243#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {244#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:15:08,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {244#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {241#false} is VALID [2018-11-23 13:15:08,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {241#false} assume !false; {241#false} is VALID [2018-11-23 13:15:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:08,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:15:08,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:15:08,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 13:15:08,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:08,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:15:09,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:09,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:15:09,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:15:09,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:15:09,466 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2018-11-23 13:15:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:13,437 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-11-23 13:15:13,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:15:13,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 13:15:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:15:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 13:15:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:15:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 13:15:13,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 13:15:13,588 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 13:15:13,589 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:15:13,590 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:15:13,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:15:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:15:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 13:15:13,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:13,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-11-23 13:15:13,607 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-11-23 13:15:13,608 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-11-23 13:15:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:13,611 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:15:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 13:15:13,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:13,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:13,612 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-11-23 13:15:13,612 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-11-23 13:15:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:13,614 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:15:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 13:15:13,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:13,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:13,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:13,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:15:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 13:15:13,619 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2018-11-23 13:15:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:13,619 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 13:15:13,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:15:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 13:15:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:15:13,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:13,620 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:13,621 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:13,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:13,621 INFO L82 PathProgramCache]: Analyzing trace with hash 816455220, now seen corresponding path program 1 times [2018-11-23 13:15:13,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:13,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:13,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:13,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:15:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:14,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-23 13:15:14,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-23 13:15:14,092 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #55#return; {381#true} is VALID [2018-11-23 13:15:14,092 INFO L256 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret2 := main(); {381#true} is VALID [2018-11-23 13:15:14,093 INFO L273 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~x~0;~y~0 := 1; {381#true} is VALID [2018-11-23 13:15:14,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {381#true} is VALID [2018-11-23 13:15:14,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {381#true} assume !!(0 != #t~nondet0);havoc #t~nondet0; {381#true} is VALID [2018-11-23 13:15:14,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {381#true} assume !(1 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296); {381#true} is VALID [2018-11-23 13:15:16,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {381#true} assume 2 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296;~x~0 := 1 + ~x~0;~y~0 := 0; {383#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is UNKNOWN [2018-11-23 13:15:16,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {383#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {383#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-23 13:15:16,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {383#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume !(0 != #t~nondet0);havoc #t~nondet0; {383#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-23 13:15:16,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {383#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} assume 0 == ~y~0 % 4294967296; {383#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} is VALID [2018-11-23 13:15:16,240 INFO L256 TraceCheckUtils]: 12: Hoare triple {383#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* 3 (div (+ main_~x~0 (* (- 4294967296) (div main_~x~0 4294967296))) 3))))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {384#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:16,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {384#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {385#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:15:16,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {385#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {382#false} is VALID [2018-11-23 13:15:16,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-23 13:15:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:15:16,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:15:16,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:15:16,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 13:15:16,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:16,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:15:18,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:18,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:15:18,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:15:18,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:15:18,312 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2018-11-23 13:15:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:20,281 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-11-23 13:15:20,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:15:20,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 13:15:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:15:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:15:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 13:15:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:15:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 13:15:20,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2018-11-23 13:15:20,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:20,484 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:15:20,484 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:15:20,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:15:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:15:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:15:20,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:20,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:15:20,487 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:15:20,487 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:15:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:20,488 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:15:20,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:15:20,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:20,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:20,488 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:15:20,488 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:15:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:20,489 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:15:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:15:20,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:20,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:20,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:20,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:15:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:15:20,490 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-11-23 13:15:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:20,490 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:15:20,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:15:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:15:20,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:20,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:15:20,575 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:15:20,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:15:20,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:15:20,576 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:15:20,576 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:15:20,576 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:15:20,576 INFO L444 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (<= main_~x~0 (let ((.cse0 (div main_~x~0 4294967296))) (+ (* 4294967296 .cse0) (* 3 (div (+ main_~x~0 (* (- 4294967296) .cse0)) 3))))) [2018-11-23 13:15:20,577 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 12 33) no Hoare annotation was computed. [2018-11-23 13:15:20,577 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 26) no Hoare annotation was computed. [2018-11-23 13:15:20,577 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 16 29) the Hoare annotation is: (or (<= main_~x~0 (let ((.cse0 (div main_~x~0 4294967296))) (+ (* 4294967296 .cse0) (* 3 (div (+ main_~x~0 (* (- 4294967296) .cse0)) 3))))) (and (<= (div main_~y~0 4294967296) 0) (<= 1 main_~y~0))) [2018-11-23 13:15:20,577 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 28) no Hoare annotation was computed. [2018-11-23 13:15:20,577 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 12 33) no Hoare annotation was computed. [2018-11-23 13:15:20,577 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-23 13:15:20,578 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 12 33) the Hoare annotation is: true [2018-11-23 13:15:20,578 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 27) no Hoare annotation was computed. [2018-11-23 13:15:20,578 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 29) no Hoare annotation was computed. [2018-11-23 13:15:20,578 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 12 33) no Hoare annotation was computed. [2018-11-23 13:15:20,578 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 6 10) the Hoare annotation is: true [2018-11-23 13:15:20,578 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2018-11-23 13:15:20,578 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 6 10) no Hoare annotation was computed. [2018-11-23 13:15:20,578 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-23 13:15:20,579 INFO L448 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2018-11-23 13:15:20,579 INFO L448 ceAbstractionStarter]: For program point L7-2(lines 6 10) no Hoare annotation was computed. [2018-11-23 13:15:20,580 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:15:20,582 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2018-11-23 13:15:20,582 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:15:20,582 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:15:20,582 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 13:15:20,582 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 13:15:20,582 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2018-11-23 13:15:20,582 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2018-11-23 13:15:20,583 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:15:20,584 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 13:15:20,585 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:15:20,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:15:20 BoogieIcfgContainer [2018-11-23 13:15:20,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:15:20,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:15:20,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:15:20,598 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:15:20,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:04" (3/4) ... [2018-11-23 13:15:20,603 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:15:20,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:15:20,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:15:20,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:15:20,614 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:15:20,615 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:15:20,615 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:15:20,664 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-industry-pattern/mod3_true-unreach-call.c-witness.graphml [2018-11-23 13:15:20,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:15:20,665 INFO L168 Benchmark]: Toolchain (without parser) took 17267.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -542.6 MB). Peak memory consumption was 164.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:15:20,667 INFO L168 Benchmark]: CDTParser took 0.19 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 13:15:20,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.96 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 13:15:20,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.82 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 13:15:20,669 INFO L168 Benchmark]: Boogie Preprocessor took 39.24 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 13:15:20,669 INFO L168 Benchmark]: RCFGBuilder took 650.22 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -743.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:15:20,670 INFO L168 Benchmark]: TraceAbstraction took 16137.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 190.6 MB). Peak memory consumption was 190.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:15:20,671 INFO L168 Benchmark]: Witness Printer took 66.70 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:15:20,675 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.96 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 27.82 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 39.24 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 650.22 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -743.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16137.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 190.6 MB). Peak memory consumption was 190.6 MB. Max. memory is 7.1 GB. * Witness Printer took 66.70 ms. Allocated memory is still 2.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: x <= 4294967296 * (x / 4294967296) + 3 * ((x + -4294967296 * (x / 4294967296)) / 3) || (y / 4294967296 <= 0 && 1 <= y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 16.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 84 SDtfs, 11 SDslu, 104 SDs, 0 SdLazy, 49 SolverSat, 9 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 15 NumberOfFragments, 53 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 3110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...