java -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.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label36_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 18:49:30,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 18:49:30,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 18:49:30,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 18:49:30,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 18:49:30,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 18:49:30,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 18:49:30,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 18:49:30,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 18:49:30,138 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 18:49:30,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 18:49:30,139 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 18:49:30,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 18:49:30,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 18:49:30,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 18:49:30,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 18:49:30,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 18:49:30,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 18:49:30,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 18:49:30,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 18:49:30,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 18:49:30,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 18:49:30,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 18:49:30,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 18:49:30,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 18:49:30,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 18:49:30,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 18:49:30,156 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 18:49:30,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 18:49:30,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 18:49:30,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 18:49:30,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 18:49:30,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 18:49:30,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 18:49:30,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 18:49:30,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 18:49:30,161 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 18:49:30,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 18:49:30,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 18:49:30,178 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 18:49:30,178 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 18:49:30,178 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 18:49:30,178 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 18:49:30,179 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 18:49:30,179 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 18:49:30,179 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 18:49:30,179 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 18:49:30,179 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 18:49:30,179 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 18:49:30,180 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 18:49:30,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 18:49:30,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 18:49:30,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 18:49:30,183 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 18:49:30,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 18:49:30,183 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 18:49:30,183 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 18:49:30,184 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 18:49:30,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 18:49:30,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 18:49:30,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 18:49:30,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 18:49:30,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 18:49:30,185 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 18:49:30,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 18:49:30,186 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 18:49:30,186 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 18:49:30,186 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 18:49:30,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 18:49:30,186 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 18:49:30,186 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 18:49:30,187 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 18:49:30,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 18:49:30,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 18:49:30,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 18:49:30,254 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 18:49:30,255 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 18:49:30,255 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label36_true-unreach-call.c [2018-11-12 18:49:30,322 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d011a3d41/afb3b3963f5e4d27b4a40daf9d5dd547/FLAG4e4858cd2 [2018-11-12 18:49:31,132 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 18:49:31,133 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label36_true-unreach-call.c [2018-11-12 18:49:31,168 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d011a3d41/afb3b3963f5e4d27b4a40daf9d5dd547/FLAG4e4858cd2 [2018-11-12 18:49:31,190 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d011a3d41/afb3b3963f5e4d27b4a40daf9d5dd547 [2018-11-12 18:49:31,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 18:49:31,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 18:49:31,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 18:49:31,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 18:49:31,212 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 18:49:31,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:49:31" (1/1) ... [2018-11-12 18:49:31,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26cc130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:31, skipping insertion in model container [2018-11-12 18:49:31,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:49:31" (1/1) ... [2018-11-12 18:49:31,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 18:49:31,377 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 18:49:32,703 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:49:32,708 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 18:49:33,277 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 18:49:33,315 INFO L193 MainTranslator]: Completed translation [2018-11-12 18:49:33,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33 WrapperNode [2018-11-12 18:49:33,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 18:49:33,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 18:49:33,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 18:49:33,318 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 18:49:33,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 18:49:33,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 18:49:33,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 18:49:33,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 18:49:33,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (1/1) ... [2018-11-12 18:49:33,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 18:49:33,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 18:49:33,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 18:49:33,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 18:49:33,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (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-12 18:49:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 18:49:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 18:49:33,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 18:49:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-12 18:49:33,935 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-12 18:49:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-12 18:49:33,935 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-12 18:49:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-12 18:49:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-12 18:49:33,936 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 18:49:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 18:49:33,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 18:49:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 18:49:33,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 18:49:33,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 18:49:42,669 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 18:49:42,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:49:42 BoogieIcfgContainer [2018-11-12 18:49:42,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 18:49:42,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 18:49:42,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 18:49:42,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 18:49:42,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:49:31" (1/3) ... [2018-11-12 18:49:42,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a247c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:49:42, skipping insertion in model container [2018-11-12 18:49:42,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:49:33" (2/3) ... [2018-11-12 18:49:42,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a247c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:49:42, skipping insertion in model container [2018-11-12 18:49:42,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:49:42" (3/3) ... [2018-11-12 18:49:42,678 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label36_true-unreach-call.c [2018-11-12 18:49:42,688 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 18:49:42,699 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 18:49:42,717 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 18:49:42,775 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 18:49:42,775 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 18:49:42,776 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 18:49:42,776 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 18:49:42,776 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 18:49:42,776 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 18:49:42,776 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 18:49:42,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 18:49:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-11-12 18:49:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-12 18:49:42,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:49:42,843 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] [2018-11-12 18:49:42,845 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:49:42,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:49:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash -21070164, now seen corresponding path program 1 times [2018-11-12 18:49:42,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:49:43,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:49:43,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:49:43,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:49:43,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:49:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:49:43,513 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:49:43,638 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-12 18:49:43,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:49:43,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 18:49:43,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:49:43,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:49:43,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:49:43,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:49:43,668 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-11-12 18:49:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:49:50,984 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-11-12 18:49:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:49:50,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-12 18:49:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:49:51,045 INFO L225 Difference]: With dead ends: 2446 [2018-11-12 18:49:51,046 INFO L226 Difference]: Without dead ends: 1604 [2018-11-12 18:49:51,061 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 18:49:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-11-12 18:49:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-11-12 18:49:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-11-12 18:49:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2861 transitions. [2018-11-12 18:49:51,246 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2861 transitions. Word has length 64 [2018-11-12 18:49:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:49:51,247 INFO L480 AbstractCegarLoop]: Abstraction has 1604 states and 2861 transitions. [2018-11-12 18:49:51,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:49:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2861 transitions. [2018-11-12 18:49:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-12 18:49:51,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:49:51,256 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:49:51,257 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:49:51,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:49:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash -131464626, now seen corresponding path program 1 times [2018-11-12 18:49:51,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:49:51,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:49:51,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:49:51,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:49:51,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:49:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:49:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 50 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:49:51,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:49:51,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:49:51,893 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-12 18:49:51,895 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2279], [2281], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-12 18:49:51,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:49:51,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:49:52,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:49:52,777 INFO L272 AbstractInterpreter]: Visited 84 different actions 160 times. Merged at 4 different actions 4 times. Never widened. Performed 1606 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1606 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-12 18:49:52,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:49:52,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:49:52,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:49:52,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:49:52,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:49:52,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:49:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:49:52,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:49:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:49:53,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:49:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:49:53,549 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:49:53,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-11-12 18:49:53,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:49:53,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 18:49:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 18:49:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:49:53,552 INFO L87 Difference]: Start difference. First operand 1604 states and 2861 transitions. Second operand 3 states. [2018-11-12 18:50:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:50:01,634 INFO L93 Difference]: Finished difference Result 4738 states and 8562 transitions. [2018-11-12 18:50:01,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 18:50:01,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-11-12 18:50:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:50:01,661 INFO L225 Difference]: With dead ends: 4738 [2018-11-12 18:50:01,662 INFO L226 Difference]: Without dead ends: 3140 [2018-11-12 18:50:01,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-12 18:50:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2018-11-12 18:50:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3140. [2018-11-12 18:50:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2018-11-12 18:50:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 5269 transitions. [2018-11-12 18:50:01,756 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 5269 transitions. Word has length 140 [2018-11-12 18:50:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:50:01,756 INFO L480 AbstractCegarLoop]: Abstraction has 3140 states and 5269 transitions. [2018-11-12 18:50:01,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 18:50:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 5269 transitions. [2018-11-12 18:50:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-12 18:50:01,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:50:01,764 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:50:01,764 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:50:01,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:50:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1817766790, now seen corresponding path program 1 times [2018-11-12 18:50:01,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:50:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:01,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:50:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:01,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:50:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:50:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:50:01,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:50:01,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 18:50:01,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:50:01,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 18:50:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 18:50:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-12 18:50:01,957 INFO L87 Difference]: Start difference. First operand 3140 states and 5269 transitions. Second operand 5 states. [2018-11-12 18:50:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:50:11,570 INFO L93 Difference]: Finished difference Result 9545 states and 16221 transitions. [2018-11-12 18:50:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 18:50:11,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-11-12 18:50:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:50:11,613 INFO L225 Difference]: With dead ends: 9545 [2018-11-12 18:50:11,613 INFO L226 Difference]: Without dead ends: 6411 [2018-11-12 18:50:11,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:50:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2018-11-12 18:50:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 6350. [2018-11-12 18:50:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2018-11-12 18:50:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 9814 transitions. [2018-11-12 18:50:11,826 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 9814 transitions. Word has length 144 [2018-11-12 18:50:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:50:11,826 INFO L480 AbstractCegarLoop]: Abstraction has 6350 states and 9814 transitions. [2018-11-12 18:50:11,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 18:50:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 9814 transitions. [2018-11-12 18:50:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-12 18:50:11,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:50:11,831 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, 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] [2018-11-12 18:50:11,831 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:50:11,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:50:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash 841617251, now seen corresponding path program 1 times [2018-11-12 18:50:11,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:50:11,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:11,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:50:11,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:11,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:50:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:50:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:50:12,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:50:12,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:50:12,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:50:12,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:50:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:50:12,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:50:12,368 INFO L87 Difference]: Start difference. First operand 6350 states and 9814 transitions. Second operand 6 states. [2018-11-12 18:50:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:50:25,156 INFO L93 Difference]: Finished difference Result 25488 states and 42008 transitions. [2018-11-12 18:50:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:50:25,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-11-12 18:50:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:50:25,294 INFO L225 Difference]: With dead ends: 25488 [2018-11-12 18:50:25,294 INFO L226 Difference]: Without dead ends: 19144 [2018-11-12 18:50:25,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-12 18:50:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19144 states. [2018-11-12 18:50:25,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19144 to 19100. [2018-11-12 18:50:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19100 states. [2018-11-12 18:50:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19100 states to 19100 states and 28653 transitions. [2018-11-12 18:50:26,058 INFO L78 Accepts]: Start accepts. Automaton has 19100 states and 28653 transitions. Word has length 155 [2018-11-12 18:50:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:50:26,058 INFO L480 AbstractCegarLoop]: Abstraction has 19100 states and 28653 transitions. [2018-11-12 18:50:26,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:50:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 19100 states and 28653 transitions. [2018-11-12 18:50:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-12 18:50:26,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:50:26,064 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, 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] [2018-11-12 18:50:26,064 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:50:26,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:50:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash -483818014, now seen corresponding path program 1 times [2018-11-12 18:50:26,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:50:26,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:26,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:50:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:26,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:50:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:50:26,333 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:50:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:50:26,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:50:26,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 18:50:26,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:50:26,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 18:50:26,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 18:50:26,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 18:50:26,732 INFO L87 Difference]: Start difference. First operand 19100 states and 28653 transitions. Second operand 6 states. [2018-11-12 18:50:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:50:34,860 INFO L93 Difference]: Finished difference Result 51434 states and 82675 transitions. [2018-11-12 18:50:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 18:50:34,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-11-12 18:50:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:50:35,024 INFO L225 Difference]: With dead ends: 51434 [2018-11-12 18:50:35,025 INFO L226 Difference]: Without dead ends: 32340 [2018-11-12 18:50:35,082 INFO L604 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-11-12 18:50:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32340 states. [2018-11-12 18:50:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32340 to 32105. [2018-11-12 18:50:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32105 states. [2018-11-12 18:50:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32105 states to 32105 states and 48218 transitions. [2018-11-12 18:50:35,852 INFO L78 Accepts]: Start accepts. Automaton has 32105 states and 48218 transitions. Word has length 178 [2018-11-12 18:50:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:50:35,852 INFO L480 AbstractCegarLoop]: Abstraction has 32105 states and 48218 transitions. [2018-11-12 18:50:35,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 18:50:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 32105 states and 48218 transitions. [2018-11-12 18:50:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-12 18:50:35,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:50:35,859 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, 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] [2018-11-12 18:50:35,859 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:50:35,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:50:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 141226831, now seen corresponding path program 1 times [2018-11-12 18:50:35,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:50:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:35,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:50:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:35,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:50:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:50:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 18:50:36,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 18:50:36,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 18:50:36,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:50:36,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 18:50:36,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 18:50:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:50:36,123 INFO L87 Difference]: Start difference. First operand 32105 states and 48218 transitions. Second operand 4 states. [2018-11-12 18:50:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:50:45,060 INFO L93 Difference]: Finished difference Result 82858 states and 128330 transitions. [2018-11-12 18:50:45,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 18:50:45,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-12 18:50:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:50:45,279 INFO L225 Difference]: With dead ends: 82858 [2018-11-12 18:50:45,280 INFO L226 Difference]: Without dead ends: 50759 [2018-11-12 18:50:45,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 18:50:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50759 states. [2018-11-12 18:50:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50759 to 50759. [2018-11-12 18:50:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50759 states. [2018-11-12 18:50:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50759 states to 50759 states and 69836 transitions. [2018-11-12 18:50:46,525 INFO L78 Accepts]: Start accepts. Automaton has 50759 states and 69836 transitions. Word has length 213 [2018-11-12 18:50:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:50:46,526 INFO L480 AbstractCegarLoop]: Abstraction has 50759 states and 69836 transitions. [2018-11-12 18:50:46,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 18:50:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50759 states and 69836 transitions. [2018-11-12 18:50:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-12 18:50:46,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:50:46,561 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-12 18:50:46,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:50:46,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:50:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1519873088, now seen corresponding path program 1 times [2018-11-12 18:50:46,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:50:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:46,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:50:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:50:46,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:50:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:50:46,941 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:50:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 114 proven. 106 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 18:50:47,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:50:47,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:50:47,087 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 329 with the following transitions: [2018-11-12 18:50:47,088 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2279], [2281], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2524], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2665], [2669], [2673], [2677], [2681], [2685], [2689], [2692], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-12 18:50:47,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:50:47,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:50:47,376 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:50:47,376 INFO L272 AbstractInterpreter]: Visited 158 different actions 158 times. Never merged. Never widened. Performed 1701 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1701 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 26 variables. [2018-11-12 18:50:47,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:50:47,404 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:50:48,127 INFO L227 lantSequenceWeakener]: Weakened 319 states. On average, predicates are now at 75.55% of their original sizes. [2018-11-12 18:50:48,128 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:50:49,369 INFO L415 sIntCurrentIteration]: We unified 327 AI predicates to 327 [2018-11-12 18:50:49,369 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:50:49,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:50:49,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-12 18:50:49,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:50:49,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 18:50:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 18:50:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-12 18:50:49,371 INFO L87 Difference]: Start difference. First operand 50759 states and 69836 transitions. Second operand 9 states. [2018-11-12 18:50:55,698 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:51:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:51:35,789 INFO L93 Difference]: Finished difference Result 102282 states and 140584 transitions. [2018-11-12 18:51:35,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 18:51:35,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 328 [2018-11-12 18:51:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:51:35,998 INFO L225 Difference]: With dead ends: 102282 [2018-11-12 18:51:35,998 INFO L226 Difference]: Without dead ends: 51529 [2018-11-12 18:51:36,114 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 330 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-12 18:51:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51529 states. [2018-11-12 18:51:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51529 to 51527. [2018-11-12 18:51:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51527 states. [2018-11-12 18:51:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51527 states to 51527 states and 70616 transitions. [2018-11-12 18:51:37,121 INFO L78 Accepts]: Start accepts. Automaton has 51527 states and 70616 transitions. Word has length 328 [2018-11-12 18:51:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:51:37,121 INFO L480 AbstractCegarLoop]: Abstraction has 51527 states and 70616 transitions. [2018-11-12 18:51:37,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 18:51:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 51527 states and 70616 transitions. [2018-11-12 18:51:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-12 18:51:37,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:51:37,148 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 18:51:37,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:51:37,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:51:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash -486287778, now seen corresponding path program 1 times [2018-11-12 18:51:37,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:51:37,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:51:37,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:51:37,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:51:37,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:51:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:51:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 250 proven. 102 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-12 18:51:37,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:51:37,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:51:37,582 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 355 with the following transitions: [2018-11-12 18:51:37,583 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2279], [2281], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2492], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2524], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-12 18:51:37,589 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:51:37,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:51:37,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 18:51:37,878 INFO L272 AbstractInterpreter]: Visited 121 different actions 237 times. Merged at 5 different actions 7 times. Never widened. Performed 3646 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3646 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-12 18:51:37,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:51:37,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 18:51:37,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:51:37,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 18:51:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:51:37,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 18:51:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:51:37,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 18:51:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-12 18:51:38,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 18:51:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 250 proven. 102 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-12 18:51:39,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 18:51:39,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-12 18:51:39,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 18:51:39,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 18:51:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 18:51:39,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-12 18:51:39,041 INFO L87 Difference]: Start difference. First operand 51527 states and 70616 transitions. Second operand 9 states. [2018-11-12 18:51:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:51:52,563 INFO L93 Difference]: Finished difference Result 135151 states and 222908 transitions. [2018-11-12 18:51:52,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 18:51:52,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 354 [2018-11-12 18:51:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:51:53,024 INFO L225 Difference]: With dead ends: 135151 [2018-11-12 18:51:53,024 INFO L226 Difference]: Without dead ends: 74666 [2018-11-12 18:51:53,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 709 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-11-12 18:51:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74666 states. [2018-11-12 18:51:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74666 to 72670. [2018-11-12 18:51:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72670 states. [2018-11-12 18:51:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72670 states to 72670 states and 103394 transitions. [2018-11-12 18:51:55,493 INFO L78 Accepts]: Start accepts. Automaton has 72670 states and 103394 transitions. Word has length 354 [2018-11-12 18:51:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:51:55,493 INFO L480 AbstractCegarLoop]: Abstraction has 72670 states and 103394 transitions. [2018-11-12 18:51:55,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 18:51:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 72670 states and 103394 transitions. [2018-11-12 18:51:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-11-12 18:51:55,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:51:55,519 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-12 18:51:55,519 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:51:55,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:51:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash 229476098, now seen corresponding path program 1 times [2018-11-12 18:51:55,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:51:55,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:51:55,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:51:55,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:51:55,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:51:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:51:55,873 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 18:51:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 177 proven. 189 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-12 18:51:56,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 18:51:56,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 18:51:56,268 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 401 with the following transitions: [2018-11-12 18:51:56,269 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2279], [2281], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2396], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2524], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2585], [2589], [2593], [2597], [2601], [2605], [2609], [2613], [2617], [2621], [2625], [2629], [2633], [2637], [2641], [2645], [2649], [2653], [2657], [2661], [2664], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-11-12 18:51:56,273 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 18:51:56,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 18:51:56,520 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 18:51:57,099 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 18:51:57,099 INFO L272 AbstractInterpreter]: Visited 155 different actions 306 times. Merged at 5 different actions 7 times. Never widened. Performed 5556 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-12 18:51:57,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:51:57,130 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 18:51:57,842 INFO L227 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 77.32% of their original sizes. [2018-11-12 18:51:57,842 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 18:51:58,399 INFO L415 sIntCurrentIteration]: We unified 399 AI predicates to 399 [2018-11-12 18:51:58,399 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 18:51:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 18:51:58,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-12 18:51:58,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 18:51:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 18:51:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 18:51:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-12 18:51:58,401 INFO L87 Difference]: Start difference. First operand 72670 states and 103394 transitions. Second operand 21 states. [2018-11-12 18:52:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 18:52:53,781 INFO L93 Difference]: Finished difference Result 145636 states and 207519 transitions. [2018-11-12 18:52:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 18:52:53,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 400 [2018-11-12 18:52:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 18:52:54,084 INFO L225 Difference]: With dead ends: 145636 [2018-11-12 18:52:54,084 INFO L226 Difference]: Without dead ends: 73740 [2018-11-12 18:52:54,262 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 418 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 18:52:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73740 states. [2018-11-12 18:52:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73740 to 73735. [2018-11-12 18:52:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73735 states. [2018-11-12 18:52:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73735 states to 73735 states and 104498 transitions. [2018-11-12 18:52:57,196 INFO L78 Accepts]: Start accepts. Automaton has 73735 states and 104498 transitions. Word has length 400 [2018-11-12 18:52:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 18:52:57,196 INFO L480 AbstractCegarLoop]: Abstraction has 73735 states and 104498 transitions. [2018-11-12 18:52:57,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 18:52:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 73735 states and 104498 transitions. [2018-11-12 18:52:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-11-12 18:52:57,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 18:52:57,238 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 18:52:57,239 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 18:52:57,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 18:52:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1021349739, now seen corresponding path program 1 times [2018-11-12 18:52:57,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 18:52:57,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:52:57,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 18:52:57,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 18:52:57,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 18:52:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 18:52:58,156 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 19 Received shutdown request... [2018-11-12 18:52:58,273 WARN L187 SmtUtils]: Removed 2 from assertion stack [2018-11-12 18:52:58,274 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 18:52:58,279 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 18:52:58,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:52:58 BoogieIcfgContainer [2018-11-12 18:52:58,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 18:52:58,280 INFO L168 Benchmark]: Toolchain (without parser) took 207077.03 ms. Allocated memory was 1.5 GB in the beginning and 4.5 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-12 18:52:58,282 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-12 18:52:58,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2109.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. [2018-11-12 18:52:58,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 314.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:52:58,284 INFO L168 Benchmark]: Boogie Preprocessor took 226.79 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2018-11-12 18:52:58,287 INFO L168 Benchmark]: RCFGBuilder took 8810.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 643.9 MB). Peak memory consumption was 643.9 MB. Max. memory is 7.1 GB. [2018-11-12 18:52:58,288 INFO L168 Benchmark]: TraceAbstraction took 195608.67 ms. Allocated memory was 2.3 GB in the beginning and 4.5 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -999.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-12 18:52:58,296 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.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 2109.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 203.5 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 314.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.7 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 226.79 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8810.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 643.9 MB). Peak memory consumption was 643.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195608.67 ms. Allocated memory was 2.3 GB in the beginning and 4.5 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -999.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 183]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 183). Cancelled while BasicCegarLoop was analyzing trace of length 496 with TraceHistMax 5,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 30. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 840 locations, 1 error locations. TIMEOUT Result, 195.5s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 172.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5345 SDtfs, 26204 SDslu, 1414 SDs, 0 SdLazy, 45063 SolverSat, 8321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 88.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1797 GetRequests, 1701 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73735occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9980270545919127 AbsIntWeakeningRatio, 0.08264462809917356 AbsIntAvgWeakeningVarsNumRemoved, 19.334710743801654 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 2343 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2470 NumberOfCodeBlocks, 2470 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2951 ConstructedInterpolants, 0 QuantifiedInterpolants, 2139610 SizeOfPredicates, 2 NumberOfNonLiveVariables, 920 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 1834/2342 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown