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/Problem16_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:52:00,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:52:00,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:52:00,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:52:00,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:52:00,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:52:00,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:52:00,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:52:00,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:52:00,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:52:00,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:52:00,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:52:00,186 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:52:00,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:52:00,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:52:00,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:52:00,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:52:00,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:52:00,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:52:00,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:52:00,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:52:00,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:52:00,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:52:00,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:52:00,201 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:52:00,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:52:00,203 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:52:00,204 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:52:00,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:52:00,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:52:00,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:52:00,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:52:00,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:52:00,212 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:52:00,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:52:00,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:52:00,214 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 01:52:00,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:52:00,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:52:00,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:52:00,245 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:52:00,245 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:52:00,245 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:52:00,245 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:52:00,246 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:52:00,246 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:52:00,246 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:52:00,246 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:52:00,246 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:52:00,247 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:52:00,247 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:52:00,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:52:00,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:52:00,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:52:00,248 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:52:00,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:52:00,248 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:52:00,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:52:00,249 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:52:00,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:52:00,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:52:00,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:52:00,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:52:00,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:52:00,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:52:00,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:52:00,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:52:00,251 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:52:00,251 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:52:00,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:52:00,251 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:52:00,251 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:52:00,251 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:52:00,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:52:00,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:52:00,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:52:00,345 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:52:00,345 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:52:00,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label11_true-unreach-call.c [2018-10-25 01:52:00,410 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ea79fcb50/23a14d0bb2af4f7fbc6f10c78be499c0/FLAG20dd2a3f4 [2018-10-25 01:52:01,085 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:52:01,086 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label11_true-unreach-call.c [2018-10-25 01:52:01,106 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ea79fcb50/23a14d0bb2af4f7fbc6f10c78be499c0/FLAG20dd2a3f4 [2018-10-25 01:52:01,125 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ea79fcb50/23a14d0bb2af4f7fbc6f10c78be499c0 [2018-10-25 01:52:01,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:52:01,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:52:01,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:52:01,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:52:01,143 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:52:01,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:52:01" (1/1) ... [2018-10-25 01:52:01,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46dcfc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:01, skipping insertion in model container [2018-10-25 01:52:01,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:52:01" (1/1) ... [2018-10-25 01:52:01,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:52:01,249 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:52:01,999 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:52:02,004 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:52:02,277 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:52:02,297 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:52:02,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02 WrapperNode [2018-10-25 01:52:02,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:52:02,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:52:02,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:52:02,300 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:52:02,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:52:02,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:52:02,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:52:02,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:52:02,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (1/1) ... [2018-10-25 01:52:02,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:52:02,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:52:02,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:52:02,817 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:52:02,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (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 01:52:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:52:02,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:52:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:52:02,891 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:52:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:52:02,892 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:52:02,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:52:02,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:52:02,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:52:02,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:52:09,679 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:52:09,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:09 BoogieIcfgContainer [2018-10-25 01:52:09,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:52:09,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:52:09,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:52:09,685 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:52:09,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:52:01" (1/3) ... [2018-10-25 01:52:09,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23108a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:09, skipping insertion in model container [2018-10-25 01:52:09,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:52:02" (2/3) ... [2018-10-25 01:52:09,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23108a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:52:09, skipping insertion in model container [2018-10-25 01:52:09,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:52:09" (3/3) ... [2018-10-25 01:52:09,689 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label11_true-unreach-call.c [2018-10-25 01:52:09,698 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:52:09,706 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:52:09,725 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:52:09,767 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:52:09,767 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:52:09,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:52:09,767 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:52:09,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:52:09,768 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:52:09,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:52:09,768 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:52:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:52:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-25 01:52:09,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:09,814 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] [2018-10-25 01:52:09,816 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:09,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1469466684, now seen corresponding path program 1 times [2018-10-25 01:52:09,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:09,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:10,338 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:10,462 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 01:52:10,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:10,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:52:10,465 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:10,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:52:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:52:10,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:52:10,496 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-10-25 01:52:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:15,092 INFO L93 Difference]: Finished difference Result 1156 states and 2144 transitions. [2018-10-25 01:52:15,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:52:15,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-10-25 01:52:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:15,120 INFO L225 Difference]: With dead ends: 1156 [2018-10-25 01:52:15,121 INFO L226 Difference]: Without dead ends: 744 [2018-10-25 01:52:15,131 INFO L605 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-10-25 01:52:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-25 01:52:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-10-25 01:52:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:52:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1355 transitions. [2018-10-25 01:52:15,241 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1355 transitions. Word has length 62 [2018-10-25 01:52:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:15,242 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1355 transitions. [2018-10-25 01:52:15,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:52:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1355 transitions. [2018-10-25 01:52:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 01:52:15,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:15,251 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, 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 01:52:15,252 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:15,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2105085518, now seen corresponding path program 1 times [2018-10-25 01:52:15,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:15,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:15,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:15,577 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:52:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:15,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:15,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:52:15,729 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:15,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:52:15,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:52:15,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:52:15,732 INFO L87 Difference]: Start difference. First operand 744 states and 1355 transitions. Second operand 5 states. [2018-10-25 01:52:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:21,923 INFO L93 Difference]: Finished difference Result 2194 states and 4083 transitions. [2018-10-25 01:52:21,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:21,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-10-25 01:52:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:21,940 INFO L225 Difference]: With dead ends: 2194 [2018-10-25 01:52:21,940 INFO L226 Difference]: Without dead ends: 1456 [2018-10-25 01:52:21,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:52:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2018-10-25 01:52:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1436. [2018-10-25 01:52:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2018-10-25 01:52:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2550 transitions. [2018-10-25 01:52:22,012 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2550 transitions. Word has length 132 [2018-10-25 01:52:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:22,012 INFO L481 AbstractCegarLoop]: Abstraction has 1436 states and 2550 transitions. [2018-10-25 01:52:22,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:52:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2550 transitions. [2018-10-25 01:52:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-25 01:52:22,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:22,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:22,020 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:22,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1857215629, now seen corresponding path program 1 times [2018-10-25 01:52:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:22,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:22,023 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:22,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:22,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:22,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:22,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:22,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:22,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:22,276 INFO L87 Difference]: Start difference. First operand 1436 states and 2550 transitions. Second operand 6 states. [2018-10-25 01:52:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:27,124 INFO L93 Difference]: Finished difference Result 3936 states and 7024 transitions. [2018-10-25 01:52:27,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:27,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-10-25 01:52:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:27,146 INFO L225 Difference]: With dead ends: 3936 [2018-10-25 01:52:27,147 INFO L226 Difference]: Without dead ends: 2506 [2018-10-25 01:52:27,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-10-25 01:52:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2479. [2018-10-25 01:52:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2018-10-25 01:52:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3996 transitions. [2018-10-25 01:52:27,237 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3996 transitions. Word has length 161 [2018-10-25 01:52:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:27,238 INFO L481 AbstractCegarLoop]: Abstraction has 2479 states and 3996 transitions. [2018-10-25 01:52:27,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3996 transitions. [2018-10-25 01:52:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-25 01:52:27,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:27,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:52:27,244 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:27,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:27,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2100358191, now seen corresponding path program 1 times [2018-10-25 01:52:27,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:27,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:27,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:27,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:27,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:27,490 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:27,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:27,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:27,492 INFO L87 Difference]: Start difference. First operand 2479 states and 3996 transitions. Second operand 6 states. [2018-10-25 01:52:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:30,919 INFO L93 Difference]: Finished difference Result 6050 states and 9896 transitions. [2018-10-25 01:52:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:30,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2018-10-25 01:52:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:30,944 INFO L225 Difference]: With dead ends: 6050 [2018-10-25 01:52:30,945 INFO L226 Difference]: Without dead ends: 3577 [2018-10-25 01:52:30,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2018-10-25 01:52:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3545. [2018-10-25 01:52:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3545 states. [2018-10-25 01:52:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 4965 transitions. [2018-10-25 01:52:31,052 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 4965 transitions. Word has length 179 [2018-10-25 01:52:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:31,053 INFO L481 AbstractCegarLoop]: Abstraction has 3545 states and 4965 transitions. [2018-10-25 01:52:31,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 4965 transitions. [2018-10-25 01:52:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-25 01:52:31,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:31,058 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, 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] [2018-10-25 01:52:31,058 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:31,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:31,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2086748824, now seen corresponding path program 1 times [2018-10-25 01:52:31,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:31,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:31,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:31,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:31,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 122 proven. 53 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:52:31,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:52:31,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:52:31,297 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-10-25 01:52:31,300 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [575], [577], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [672], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:52:31,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:52:31,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:52:31,897 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:52:31,901 INFO L272 AbstractInterpreter]: Visited 135 different actions 135 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:52:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:31,958 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:52:32,678 INFO L232 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 78.1% of their original sizes. [2018-10-25 01:52:32,679 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:52:32,931 INFO L413 sIntCurrentIteration]: We have 261 unified AI predicates [2018-10-25 01:52:32,934 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:52:32,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:52:32,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:52:32,936 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:32,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:32,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:32,938 INFO L87 Difference]: Start difference. First operand 3545 states and 4965 transitions. Second operand 6 states. [2018-10-25 01:52:46,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:52:46,834 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:52:46,840 INFO L168 Benchmark]: Toolchain (without parser) took 45703.18 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -205.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:52:46,842 INFO L168 Benchmark]: CDTParser took 0.19 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 01:52:46,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1159.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:46,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 324.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -866.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:46,844 INFO L168 Benchmark]: Boogie Preprocessor took 191.35 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 01:52:46,846 INFO L168 Benchmark]: RCFGBuilder took 6863.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 259.2 MB). Peak memory consumption was 259.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:46,849 INFO L168 Benchmark]: TraceAbstraction took 37158.52 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 945.3 MB). Free memory was 1.9 GB in the beginning and 1.6 GB in the end (delta: 303.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:52:46,857 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1159.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 324.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -866.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.35 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 6863.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 259.2 MB). Peak memory consumption was 259.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37158.52 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 945.3 MB). Free memory was 1.9 GB in the beginning and 1.6 GB in the end (delta: 303.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...