java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label30_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:13:57,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:13:57,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:13:57,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:13:57,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:13:57,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:13:57,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:13:57,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:13:57,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:13:57,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:13:57,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:13:57,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:13:57,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:13:57,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:13:57,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:13:57,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:13:57,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:13:57,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:13:57,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:13:57,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:13:57,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:13:57,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:13:57,856 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:13:57,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:13:57,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:13:57,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:13:57,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:13:57,859 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:13:57,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:13:57,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:13:57,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:13:57,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:13:57,863 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:13:57,863 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:13:57,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:13:57,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:13:57,866 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:13:57,891 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:13:57,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:13:57,893 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:13:57,893 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:13:57,893 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:13:57,893 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:13:57,893 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:13:57,894 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:13:57,895 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:13:57,895 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:13:57,895 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:13:57,895 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:13:57,895 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:13:57,896 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:13:57,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:13:57,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:13:57,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:13:57,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:13:57,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:13:57,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:13:57,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:13:57,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:13:57,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:13:57,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:13:57,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:13:57,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:13:57,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:13:57,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:13:57,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:13:57,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:13:57,902 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:13:57,902 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:13:57,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:13:57,902 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:13:57,902 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:13:57,903 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:13:57,968 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:13:57,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:13:57,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:13:57,995 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:13:57,996 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:13:57,997 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label30_true-unreach-call.c [2018-10-25 00:13:58,062 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/62d2ffb30/e601df89c66f4af0a053a2ed39baf747/FLAG768cad3d5 [2018-10-25 00:13:58,772 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:13:58,774 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label30_true-unreach-call.c [2018-10-25 00:13:58,792 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/62d2ffb30/e601df89c66f4af0a053a2ed39baf747/FLAG768cad3d5 [2018-10-25 00:13:58,808 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/62d2ffb30/e601df89c66f4af0a053a2ed39baf747 [2018-10-25 00:13:58,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:13:58,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:13:58,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:13:58,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:13:58,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:13:58,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:13:58" (1/1) ... [2018-10-25 00:13:58,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650985ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:58, skipping insertion in model container [2018-10-25 00:13:58,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:13:58" (1/1) ... [2018-10-25 00:13:58,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:13:58,933 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:13:59,629 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:13:59,634 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:13:59,922 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:13:59,948 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:13:59,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59 WrapperNode [2018-10-25 00:13:59,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:13:59,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:13:59,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:13:59,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:13:59,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:14:00,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:14:00,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:14:00,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:14:00,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... [2018-10-25 00:14:00,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:14:00,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:14:00,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:14:00,394 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:14:00,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:14:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:14:00,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:14:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:14:00,470 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:14:00,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:14:00,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:14:00,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:14:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:14:06,562 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:14:06,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:14:06 BoogieIcfgContainer [2018-10-25 00:14:06,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:14:06,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:14:06,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:14:06,568 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:14:06,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:13:58" (1/3) ... [2018-10-25 00:14:06,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f1926a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:14:06, skipping insertion in model container [2018-10-25 00:14:06,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:59" (2/3) ... [2018-10-25 00:14:06,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f1926a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:14:06, skipping insertion in model container [2018-10-25 00:14:06,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:14:06" (3/3) ... [2018-10-25 00:14:06,575 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label30_true-unreach-call.c [2018-10-25 00:14:06,586 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:14:06,600 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:14:06,619 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:14:06,663 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:14:06,663 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:14:06,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:14:06,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:14:06,663 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:14:06,664 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:14:06,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:14:06,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:14:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-10-25 00:14:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-25 00:14:06,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:06,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:14:06,715 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:06,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2108174465, now seen corresponding path program 1 times [2018-10-25 00:14:06,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:06,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:06,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:06,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:06,776 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:07,666 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:14:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:14:07,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:07,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:14:07,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:07,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:14:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:14:07,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:14:07,949 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-10-25 00:14:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:09,855 INFO L93 Difference]: Finished difference Result 838 states and 1479 transitions. [2018-10-25 00:14:09,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:14:09,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-25 00:14:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:09,882 INFO L225 Difference]: With dead ends: 838 [2018-10-25 00:14:09,882 INFO L226 Difference]: Without dead ends: 524 [2018-10-25 00:14:09,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:14:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-25 00:14:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 522. [2018-10-25 00:14:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-25 00:14:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 890 transitions. [2018-10-25 00:14:09,990 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 890 transitions. Word has length 182 [2018-10-25 00:14:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:09,992 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 890 transitions. [2018-10-25 00:14:09,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:14:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 890 transitions. [2018-10-25 00:14:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-25 00:14:10,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:10,001 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:14:10,002 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:10,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1443247960, now seen corresponding path program 1 times [2018-10-25 00:14:10,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:10,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:10,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:10,009 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:10,392 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-25 00:14:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:14:10,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:10,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:14:10,854 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:10,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:14:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:14:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:14:10,857 INFO L87 Difference]: Start difference. First operand 522 states and 890 transitions. Second operand 6 states. [2018-10-25 00:14:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:14,097 INFO L93 Difference]: Finished difference Result 1581 states and 2759 transitions. [2018-10-25 00:14:14,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:14:14,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2018-10-25 00:14:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:14,123 INFO L225 Difference]: With dead ends: 1581 [2018-10-25 00:14:14,123 INFO L226 Difference]: Without dead ends: 1065 [2018-10-25 00:14:14,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:14:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-10-25 00:14:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1023. [2018-10-25 00:14:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-10-25 00:14:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1733 transitions. [2018-10-25 00:14:14,218 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1733 transitions. Word has length 192 [2018-10-25 00:14:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:14,219 INFO L481 AbstractCegarLoop]: Abstraction has 1023 states and 1733 transitions. [2018-10-25 00:14:14,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:14:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1733 transitions. [2018-10-25 00:14:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-25 00:14:14,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:14,229 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:14:14,229 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:14,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1778495237, now seen corresponding path program 1 times [2018-10-25 00:14:14,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:14,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:14:14,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:14,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:14:14,559 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:14,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:14:14,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:14:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:14:14,561 INFO L87 Difference]: Start difference. First operand 1023 states and 1733 transitions. Second operand 3 states. [2018-10-25 00:14:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:17,203 INFO L93 Difference]: Finished difference Result 2887 states and 5063 transitions. [2018-10-25 00:14:17,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:14:17,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-10-25 00:14:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:17,222 INFO L225 Difference]: With dead ends: 2887 [2018-10-25 00:14:17,222 INFO L226 Difference]: Without dead ends: 1870 [2018-10-25 00:14:17,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-25 00:14:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2018-10-25 00:14:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1865. [2018-10-25 00:14:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2018-10-25 00:14:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 3055 transitions. [2018-10-25 00:14:17,304 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 3055 transitions. Word has length 195 [2018-10-25 00:14:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:17,305 INFO L481 AbstractCegarLoop]: Abstraction has 1865 states and 3055 transitions. [2018-10-25 00:14:17,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:14:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 3055 transitions. [2018-10-25 00:14:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-25 00:14:17,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:17,315 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:14:17,315 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:17,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1213324138, now seen corresponding path program 1 times [2018-10-25 00:14:17,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:17,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:17,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:17,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:17,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:14:17,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:17,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:14:17,644 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:17,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:14:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:14:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:14:17,646 INFO L87 Difference]: Start difference. First operand 1865 states and 3055 transitions. Second operand 3 states. [2018-10-25 00:14:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:19,229 INFO L93 Difference]: Finished difference Result 5425 states and 9196 transitions. [2018-10-25 00:14:19,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:14:19,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-10-25 00:14:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:19,260 INFO L225 Difference]: With dead ends: 5425 [2018-10-25 00:14:19,261 INFO L226 Difference]: Without dead ends: 3566 [2018-10-25 00:14:19,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-25 00:14:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2018-10-25 00:14:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 3544. [2018-10-25 00:14:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3544 states. [2018-10-25 00:14:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 5788 transitions. [2018-10-25 00:14:19,398 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 5788 transitions. Word has length 215 [2018-10-25 00:14:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:19,400 INFO L481 AbstractCegarLoop]: Abstraction has 3544 states and 5788 transitions. [2018-10-25 00:14:19,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:14:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 5788 transitions. [2018-10-25 00:14:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-25 00:14:19,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:19,417 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:14:19,418 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:19,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash -647167813, now seen corresponding path program 1 times [2018-10-25 00:14:19,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:19,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:19,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:19,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:19,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:19,734 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:14:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:14:20,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:14:20,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:14:20,136 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:20,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:14:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:14:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:14:20,138 INFO L87 Difference]: Start difference. First operand 3544 states and 5788 transitions. Second operand 6 states. [2018-10-25 00:14:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:23,082 INFO L93 Difference]: Finished difference Result 7596 states and 12544 transitions. [2018-10-25 00:14:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:14:23,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2018-10-25 00:14:23,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:23,105 INFO L225 Difference]: With dead ends: 7596 [2018-10-25 00:14:23,105 INFO L226 Difference]: Without dead ends: 4058 [2018-10-25 00:14:23,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:14:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2018-10-25 00:14:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3727. [2018-10-25 00:14:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2018-10-25 00:14:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 5669 transitions. [2018-10-25 00:14:23,244 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 5669 transitions. Word has length 241 [2018-10-25 00:14:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:23,246 INFO L481 AbstractCegarLoop]: Abstraction has 3727 states and 5669 transitions. [2018-10-25 00:14:23,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:14:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 5669 transitions. [2018-10-25 00:14:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-25 00:14:23,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:23,261 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:14:23,261 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:23,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash 427925431, now seen corresponding path program 1 times [2018-10-25 00:14:23,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:23,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:23,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:23,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:23,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:14:23,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:14:23,760 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:14:23,761 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-10-25 00:14:23,763 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [28], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [917], [919], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:14:23,832 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:14:23,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:14:24,974 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:14:24,976 INFO L272 AbstractInterpreter]: Visited 183 different actions 183 times. Never merged. Never widened. Never found a fixpoint. Largest state had 88 variables. [2018-10-25 00:14:25,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:25,021 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:14:26,496 INFO L232 lantSequenceWeakener]: Weakened 245 states. On average, predicates are now at 72.32% of their original sizes. [2018-10-25 00:14:26,496 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:14:26,970 INFO L413 sIntCurrentIteration]: We have 253 unified AI predicates [2018-10-25 00:14:26,970 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:14:26,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:14:26,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-25 00:14:26,972 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:26,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:14:26,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:14:26,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:14:26,973 INFO L87 Difference]: Start difference. First operand 3727 states and 5669 transitions. Second operand 13 states. [2018-10-25 00:15:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:15:43,428 INFO L93 Difference]: Finished difference Result 7658 states and 11659 transitions. [2018-10-25 00:15:43,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:15:43,428 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 254 [2018-10-25 00:15:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:15:43,447 INFO L225 Difference]: With dead ends: 7658 [2018-10-25 00:15:43,448 INFO L226 Difference]: Without dead ends: 3937 [2018-10-25 00:15:43,457 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 254 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:15:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2018-10-25 00:15:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3935. [2018-10-25 00:15:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3935 states. [2018-10-25 00:15:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 5887 transitions. [2018-10-25 00:15:43,568 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 5887 transitions. Word has length 254 [2018-10-25 00:15:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:15:43,568 INFO L481 AbstractCegarLoop]: Abstraction has 3935 states and 5887 transitions. [2018-10-25 00:15:43,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:15:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 5887 transitions. [2018-10-25 00:15:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-25 00:15:43,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:15:43,586 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-25 00:15:43,586 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:15:43,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:15:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -837547636, now seen corresponding path program 1 times [2018-10-25 00:15:43,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:15:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:15:43,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:15:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:15:43,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:15:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:15:44,208 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:15:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:15:44,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:15:44,421 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:15:44,422 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-10-25 00:15:44,422 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [917], [919], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:15:44,433 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:15:44,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:15:46,907 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:15:46,908 INFO L272 AbstractInterpreter]: Visited 186 different actions 371 times. Merged at 7 different actions 10 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 88 variables. [2018-10-25 00:15:46,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:15:46,919 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:15:50,564 INFO L232 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 90.7% of their original sizes. [2018-10-25 00:15:50,564 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:15:58,170 INFO L413 sIntCurrentIteration]: We have 262 unified AI predicates [2018-10-25 00:15:58,170 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:15:58,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:15:58,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-25 00:15:58,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:15:58,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:15:58,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:15:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:15:58,172 INFO L87 Difference]: Start difference. First operand 3935 states and 5887 transitions. Second operand 11 states. [2018-10-25 00:17:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:17:04,962 INFO L93 Difference]: Finished difference Result 12103 states and 18759 transitions. [2018-10-25 00:17:04,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-25 00:17:04,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 263 [2018-10-25 00:17:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:17:05,005 INFO L225 Difference]: With dead ends: 12103 [2018-10-25 00:17:05,005 INFO L226 Difference]: Without dead ends: 8382 [2018-10-25 00:17:05,022 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 104 SyntacticMatches, 149 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:17:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8382 states. [2018-10-25 00:17:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8382 to 8369. [2018-10-25 00:17:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2018-10-25 00:17:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 12233 transitions. [2018-10-25 00:17:05,246 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 12233 transitions. Word has length 263 [2018-10-25 00:17:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:17:05,247 INFO L481 AbstractCegarLoop]: Abstraction has 8369 states and 12233 transitions. [2018-10-25 00:17:05,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:17:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 12233 transitions. [2018-10-25 00:17:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-25 00:17:05,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:17:05,277 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:17:05,277 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:17:05,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:17:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1683768024, now seen corresponding path program 1 times [2018-10-25 00:17:05,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:17:05,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:17:05,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:17:05,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:17:05,279 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:17:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:17:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 102 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:17:05,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:17:05,910 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:17:05,910 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-10-25 00:17:05,910 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [115], [116], [120], [124], [128], [132], [136], [139], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [917], [919], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:17:05,920 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:17:05,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:17:07,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:17:07,108 INFO L272 AbstractInterpreter]: Visited 187 different actions 368 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:17:07,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:17:07,112 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:17:08,291 INFO L232 lantSequenceWeakener]: Weakened 263 states. On average, predicates are now at 72.28% of their original sizes. [2018-10-25 00:17:08,291 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:17:08,682 INFO L413 sIntCurrentIteration]: We have 265 unified AI predicates [2018-10-25 00:17:08,682 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:17:08,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:17:08,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [10] total 29 [2018-10-25 00:17:08,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:17:08,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-25 00:17:08,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-25 00:17:08,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-10-25 00:17:08,684 INFO L87 Difference]: Start difference. First operand 8369 states and 12233 transitions. Second operand 21 states. Received shutdown request... [2018-10-25 00:18:02,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-25 00:18:02,199 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-25 00:18:02,204 WARN L205 ceAbstractionStarter]: Timeout [2018-10-25 00:18:02,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:18:02 BoogieIcfgContainer [2018-10-25 00:18:02,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:18:02,205 INFO L168 Benchmark]: Toolchain (without parser) took 243385.70 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 27.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-25 00:18:02,206 INFO L168 Benchmark]: CDTParser took 0.20 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-10-25 00:18:02,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1127.31 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: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2018-10-25 00:18:02,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 306.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -886.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:18:02,209 INFO L168 Benchmark]: Boogie Preprocessor took 136.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:18:02,210 INFO L168 Benchmark]: RCFGBuilder took 6169.99 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 256.0 MB). Peak memory consumption was 256.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:18:02,210 INFO L168 Benchmark]: TraceAbstraction took 235640.23 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.4 GB in the end (delta: 557.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:18:02,216 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 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 1127.31 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: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 306.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -886.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6169.99 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 256.0 MB). Peak memory consumption was 256.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 235640.23 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.4 GB in the end (delta: 557.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1560]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1560). Cancelled while BasicCegarLoop was constructing difference of abstraction (8369states) and FLOYD_HOARE automaton (currently 13 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (4264 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 235.5s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 209.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2283 SDtfs, 6487 SDslu, 1824 SDs, 0 SdLazy, 15132 SolverSat, 1229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 159.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 827 GetRequests, 604 SyntacticMatches, 153 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8369occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.9s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9990970979244502 AbsIntWeakeningRatio, 0.24358974358974358 AbsIntAvgWeakeningVarsNumRemoved, 20.453846153846154 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 7 MinimizatonAttempts, 417 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1808 NumberOfCodeBlocks, 1808 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1800 ConstructedInterpolants, 0 QuantifiedInterpolants, 1308328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 377/411 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown