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_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:53:53,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:53:53,295 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:53:53,311 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:53:53,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:53:53,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:53:53,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:53:53,316 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:53:53,317 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:53:53,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:53:53,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:53:53,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:53:53,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:53:53,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:53:53,323 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:53:53,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:53:53,324 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:53:53,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:53:53,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:53:53,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:53:53,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:53:53,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:53:53,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:53:53,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:53:53,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:53:53,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:53:53,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:53:53,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:53:53,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:53:53,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:53:53,344 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:53:53,345 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:53:53,345 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:53:53,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:53:53,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:53:53,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:53:53,351 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:53:53,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:53:53,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:53:53,369 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:53:53,369 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:53:53,370 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:53:53,370 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:53:53,370 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:53:53,370 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:53:53,371 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:53:53,371 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:53:53,371 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:53:53,371 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:53:53,371 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:53:53,371 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:53:53,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:53:53,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:53:53,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:53:53,373 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:53:53,373 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:53:53,373 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:53:53,373 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:53:53,374 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:53:53,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:53:53,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:53:53,374 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:53:53,375 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:53:53,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:53:53,375 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:53:53,375 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:53:53,375 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:53:53,376 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:53:53,376 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:53:53,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:53:53,376 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:53:53,376 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:53:53,377 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:53:53,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:53:53,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:53:53,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:53:53,452 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:53:53,452 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:53:53,453 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label49_true-unreach-call.c [2018-10-25 01:53:53,510 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fef2ece2/d52c5a59d681467198317ff565fe30b7/FLAG5986e7f97 [2018-10-25 01:53:54,173 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:53:54,174 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label49_true-unreach-call.c [2018-10-25 01:53:54,195 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fef2ece2/d52c5a59d681467198317ff565fe30b7/FLAG5986e7f97 [2018-10-25 01:53:54,210 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1fef2ece2/d52c5a59d681467198317ff565fe30b7 [2018-10-25 01:53:54,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:53:54,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:53:54,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:53:54,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:53:54,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:53:54,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:53:54" (1/1) ... [2018-10-25 01:53:54,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f32220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:54, skipping insertion in model container [2018-10-25 01:53:54,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:53:54" (1/1) ... [2018-10-25 01:53:54,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:53:54,330 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:53:55,118 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:53:55,123 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:53:55,418 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:53:55,441 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:53:55,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55 WrapperNode [2018-10-25 01:53:55,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:53:55,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:53:55,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:53:55,444 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:53:55,454 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:53:55" (1/1) ... [2018-10-25 01:53:55,506 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:53:55" (1/1) ... [2018-10-25 01:53:55,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:53:55,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:53:55,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:53:55,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:53:55,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (1/1) ... [2018-10-25 01:53:55,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (1/1) ... [2018-10-25 01:53:55,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (1/1) ... [2018-10-25 01:53:55,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (1/1) ... [2018-10-25 01:53:55,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (1/1) ... [2018-10-25 01:53:55,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (1/1) ... [2018-10-25 01:53:55,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (1/1) ... [2018-10-25 01:53:55,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:53:55,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:53:55,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:53:55,935 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:53:55,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (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:53:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:53:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:53:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:53:56,013 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:53:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:53:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:53:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:53:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:53:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:53:56,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:54:04,189 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:54:04,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:54:04 BoogieIcfgContainer [2018-10-25 01:54:04,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:54:04,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:54:04,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:54:04,195 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:54:04,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:53:54" (1/3) ... [2018-10-25 01:54:04,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a3e47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:54:04, skipping insertion in model container [2018-10-25 01:54:04,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:53:55" (2/3) ... [2018-10-25 01:54:04,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a3e47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:54:04, skipping insertion in model container [2018-10-25 01:54:04,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:54:04" (3/3) ... [2018-10-25 01:54:04,200 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label49_true-unreach-call.c [2018-10-25 01:54:04,211 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:54:04,222 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:54:04,242 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:54:04,291 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:54:04,292 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:54:04,292 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:54:04,292 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:54:04,292 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:54:04,293 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:54:04,293 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:54:04,293 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:54:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:54:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-25 01:54:04,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:04,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:04,368 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:04,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash -854858477, now seen corresponding path program 1 times [2018-10-25 01:54:04,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:04,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:04,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:04,884 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:54:04,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:04,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:54:04,887 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:04,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:54:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:54:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:54:04,914 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-10-25 01:54:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:12,697 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-10-25 01:54:12,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:54:12,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-25 01:54:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:12,729 INFO L225 Difference]: With dead ends: 1513 [2018-10-25 01:54:12,729 INFO L226 Difference]: Without dead ends: 1097 [2018-10-25 01:54:12,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-25 01:54:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-25 01:54:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-10-25 01:54:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:54:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1301 transitions. [2018-10-25 01:54:12,875 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1301 transitions. Word has length 67 [2018-10-25 01:54:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:12,876 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1301 transitions. [2018-10-25 01:54:12,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:54:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1301 transitions. [2018-10-25 01:54:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-25 01:54:12,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:12,891 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:12,891 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:12,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1317509741, now seen corresponding path program 1 times [2018-10-25 01:54:12,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:12,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:12,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:12,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:13,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:13,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:13,201 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:13,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:13,203 INFO L87 Difference]: Start difference. First operand 744 states and 1301 transitions. Second operand 6 states. [2018-10-25 01:54:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:18,330 INFO L93 Difference]: Finished difference Result 2196 states and 3924 transitions. [2018-10-25 01:54:18,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:18,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-10-25 01:54:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:18,354 INFO L225 Difference]: With dead ends: 2196 [2018-10-25 01:54:18,354 INFO L226 Difference]: Without dead ends: 1458 [2018-10-25 01:54:18,359 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:54:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-25 01:54:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-10-25 01:54:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-25 01:54:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2463 transitions. [2018-10-25 01:54:18,447 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2463 transitions. Word has length 138 [2018-10-25 01:54:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:18,447 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 2463 transitions. [2018-10-25 01:54:18,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2463 transitions. [2018-10-25 01:54:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 01:54:18,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:18,458 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, 2, 2, 2, 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:54:18,462 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:18,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1542259272, now seen corresponding path program 1 times [2018-10-25 01:54:18,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:18,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:18,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:18,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:54:18,686 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:18,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:54:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:54:18,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:54:18,688 INFO L87 Difference]: Start difference. First operand 1438 states and 2463 transitions. Second operand 5 states. [2018-10-25 01:54:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:23,450 INFO L93 Difference]: Finished difference Result 3597 states and 6200 transitions. [2018-10-25 01:54:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:23,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-10-25 01:54:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:23,476 INFO L225 Difference]: With dead ends: 3597 [2018-10-25 01:54:23,476 INFO L226 Difference]: Without dead ends: 2165 [2018-10-25 01:54:23,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:54:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2018-10-25 01:54:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2145. [2018-10-25 01:54:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2018-10-25 01:54:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3126 transitions. [2018-10-25 01:54:23,566 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3126 transitions. Word has length 139 [2018-10-25 01:54:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:23,567 INFO L481 AbstractCegarLoop]: Abstraction has 2145 states and 3126 transitions. [2018-10-25 01:54:23,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:54:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3126 transitions. [2018-10-25 01:54:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-25 01:54:23,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:23,573 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:23,573 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:23,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash -353980736, now seen corresponding path program 1 times [2018-10-25 01:54:23,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:23,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:23,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:23,577 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:23,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:23,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:23,911 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:23,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:23,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:23,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:23,913 INFO L87 Difference]: Start difference. First operand 2145 states and 3126 transitions. Second operand 6 states. [2018-10-25 01:54:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:28,268 INFO L93 Difference]: Finished difference Result 7058 states and 10436 transitions. [2018-10-25 01:54:28,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:28,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2018-10-25 01:54:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:28,300 INFO L225 Difference]: With dead ends: 7058 [2018-10-25 01:54:28,300 INFO L226 Difference]: Without dead ends: 4919 [2018-10-25 01:54:28,320 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:54:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2018-10-25 01:54:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 4879. [2018-10-25 01:54:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2018-10-25 01:54:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 6857 transitions. [2018-10-25 01:54:28,455 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 6857 transitions. Word has length 231 [2018-10-25 01:54:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:28,456 INFO L481 AbstractCegarLoop]: Abstraction has 4879 states and 6857 transitions. [2018-10-25 01:54:28,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 6857 transitions. [2018-10-25 01:54:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-25 01:54:28,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:28,461 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:54:28,461 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:28,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1524621864, now seen corresponding path program 1 times [2018-10-25 01:54:28,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:28,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:28,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:28,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:28,813 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:54:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:29,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:54:29,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:54:29,351 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:29,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:29,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:29,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:29,355 INFO L87 Difference]: Start difference. First operand 4879 states and 6857 transitions. Second operand 6 states. [2018-10-25 01:54:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:54:33,858 INFO L93 Difference]: Finished difference Result 12216 states and 17406 transitions. [2018-10-25 01:54:33,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:54:33,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 251 [2018-10-25 01:54:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:54:33,895 INFO L225 Difference]: With dead ends: 12216 [2018-10-25 01:54:33,895 INFO L226 Difference]: Without dead ends: 7343 [2018-10-25 01:54:33,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:54:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2018-10-25 01:54:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 7306. [2018-10-25 01:54:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7306 states. [2018-10-25 01:54:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7306 states to 7306 states and 9825 transitions. [2018-10-25 01:54:34,114 INFO L78 Accepts]: Start accepts. Automaton has 7306 states and 9825 transitions. Word has length 251 [2018-10-25 01:54:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:54:34,115 INFO L481 AbstractCegarLoop]: Abstraction has 7306 states and 9825 transitions. [2018-10-25 01:54:34,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:54:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9825 transitions. [2018-10-25 01:54:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-25 01:54:34,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:54:34,121 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, 3, 3, 3, 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] [2018-10-25 01:54:34,122 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:54:34,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 331280388, now seen corresponding path program 1 times [2018-10-25 01:54:34,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:54:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:34,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:54:34,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:54:34,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:54:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:54:34,696 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 01:54:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 179 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:54:34,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:54:34,881 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:54:34,882 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 269 with the following transitions: [2018-10-25 01:54:34,884 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], [579], [587], [595], [603], [611], [615], [617], [620], [628], [636], [644], [652], [660], [668], [673], [676], [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:54:34,934 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:54:34,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:54:35,496 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:54:35,502 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:54:35,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:54:35,536 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:54:36,202 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 78.16% of their original sizes. [2018-10-25 01:54:36,203 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:54:36,443 INFO L413 sIntCurrentIteration]: We have 267 unified AI predicates [2018-10-25 01:54:36,443 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:54:36,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:54:36,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2018-10-25 01:54:36,446 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:54:36,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:54:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:54:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:54:36,447 INFO L87 Difference]: Start difference. First operand 7306 states and 9825 transitions. Second operand 6 states. [2018-10-25 01:54:51,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:54:51,093 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:54:51,098 INFO L168 Benchmark]: Toolchain (without parser) took 56876.78 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:54:51,099 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:54:51,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1219.10 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:54:51,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 317.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -862.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:51,102 INFO L168 Benchmark]: Boogie Preprocessor took 173.56 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.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:51,103 INFO L168 Benchmark]: RCFGBuilder took 8255.34 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: 269.8 MB). Peak memory consumption was 269.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:51,104 INFO L168 Benchmark]: TraceAbstraction took 46906.20 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 1.9 GB in the beginning and 2.2 GB in the end (delta: -300.5 MB). Peak memory consumption was 841.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:54:51,110 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 1219.10 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 317.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -862.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.56 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.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8255.34 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: 269.8 MB). Peak memory consumption was 269.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46906.20 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 1.9 GB in the beginning and 2.2 GB in the end (delta: -300.5 MB). Peak memory consumption was 841.9 MB. 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...