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/Problem13_label35_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:36:09,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:36:09,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:36:09,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:36:09,827 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:36:09,828 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:36:09,829 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:36:09,831 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:36:09,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:36:09,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:36:09,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:36:09,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:36:09,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:36:09,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:36:09,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:36:09,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:36:09,839 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:36:09,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:36:09,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:36:09,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:36:09,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:36:09,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:36:09,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:36:09,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:36:09,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:36:09,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:36:09,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:36:09,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:36:09,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:36:09,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:36:09,855 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:36:09,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:36:09,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:36:09,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:36:09,857 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:36:09,858 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:36:09,858 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-24 23:36:09,888 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:36:09,888 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:36:09,892 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:36:09,892 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:36:09,892 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:36:09,893 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:36:09,893 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:36:09,893 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:36:09,893 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:36:09,893 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:36:09,894 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:36:09,894 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:36:09,894 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:36:09,894 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:36:09,895 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:36:09,895 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:36:09,895 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:36:09,895 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:36:09,896 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:36:09,896 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:36:09,896 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:36:09,896 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:36:09,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:36:09,897 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:36:09,897 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:36:09,897 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:36:09,897 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:36:09,897 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:36:09,898 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:36:09,898 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:36:09,898 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:36:09,898 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:36:09,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:36:09,899 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:36:09,899 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:36:09,899 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:36:09,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:36:09,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:36:09,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:36:09,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:36:09,961 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:36:09,962 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label35_false-unreach-call.c [2018-10-24 23:36:10,019 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/29cc47bdc/4fbc813ca2bf4daf90db2286b89f9486/FLAGae710a385 [2018-10-24 23:36:10,740 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:36:10,741 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label35_false-unreach-call.c [2018-10-24 23:36:10,776 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/29cc47bdc/4fbc813ca2bf4daf90db2286b89f9486/FLAGae710a385 [2018-10-24 23:36:10,791 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/29cc47bdc/4fbc813ca2bf4daf90db2286b89f9486 [2018-10-24 23:36:10,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:36:10,806 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:36:10,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:10,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:36:10,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:36:10,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:10" (1/1) ... [2018-10-24 23:36:10,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe49bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:10, skipping insertion in model container [2018-10-24 23:36:10,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:10" (1/1) ... [2018-10-24 23:36:10,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:36:11,013 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:36:12,412 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:36:12,417 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:36:13,112 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:36:13,151 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:36:13,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13 WrapperNode [2018-10-24 23:36:13,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:13,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:36:13,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:36:13,154 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:36:13,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:13,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:13,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:36:13,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:36:13,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:36:13,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:36:13,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:13,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:13,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:13,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:13,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:13,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:14,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (1/1) ... [2018-10-24 23:36:14,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:36:14,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:36:14,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:36:14,127 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:36:14,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (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-24 23:36:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:36:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:36:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:36:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:36:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:36:14,202 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:36:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:36:14,202 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:36:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:36:14,202 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:36:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:36:14,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:36:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:36:14,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:36:26,840 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:36:26,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:36:26 BoogieIcfgContainer [2018-10-24 23:36:26,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:36:26,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:36:26,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:36:26,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:36:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:36:10" (1/3) ... [2018-10-24 23:36:26,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727fa81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:36:26, skipping insertion in model container [2018-10-24 23:36:26,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:13" (2/3) ... [2018-10-24 23:36:26,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727fa81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:36:26, skipping insertion in model container [2018-10-24 23:36:26,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:36:26" (3/3) ... [2018-10-24 23:36:26,849 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label35_false-unreach-call.c [2018-10-24 23:36:26,859 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:36:26,870 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:36:26,888 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:36:26,936 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:36:26,937 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:36:26,937 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:36:26,937 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:36:26,937 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:36:26,937 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:36:26,937 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:36:26,938 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:36:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-24 23:36:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-24 23:36:26,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:27,001 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:36:27,003 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:27,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1619537211, now seen corresponding path program 1 times [2018-10-24 23:36:27,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:27,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:27,070 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:27,427 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-24 23:36:27,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:27,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:36:27,435 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:27,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:36:27,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:36:27,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:36:27,481 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-24 23:36:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:42,400 INFO L93 Difference]: Finished difference Result 3968 states and 7392 transitions. [2018-10-24 23:36:42,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:36:42,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-24 23:36:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:42,455 INFO L225 Difference]: With dead ends: 3968 [2018-10-24 23:36:42,456 INFO L226 Difference]: Without dead ends: 2842 [2018-10-24 23:36:42,469 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-24 23:36:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-10-24 23:36:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1981. [2018-10-24 23:36:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2018-10-24 23:36:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3456 transitions. [2018-10-24 23:36:42,683 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3456 transitions. Word has length 17 [2018-10-24 23:36:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:42,683 INFO L481 AbstractCegarLoop]: Abstraction has 1981 states and 3456 transitions. [2018-10-24 23:36:42,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:36:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3456 transitions. [2018-10-24 23:36:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-24 23:36:42,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:42,692 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:36:42,692 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:42,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash 958659262, now seen corresponding path program 1 times [2018-10-24 23:36:42,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:42,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:42,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:42,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:42,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:43,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:43,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:36:43,111 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:43,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:36:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:36:43,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:36:43,114 INFO L87 Difference]: Start difference. First operand 1981 states and 3456 transitions. Second operand 5 states. [2018-10-24 23:36:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:36:57,070 INFO L93 Difference]: Finished difference Result 5673 states and 10081 transitions. [2018-10-24 23:36:57,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:36:57,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-10-24 23:36:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:36:57,096 INFO L225 Difference]: With dead ends: 5673 [2018-10-24 23:36:57,096 INFO L226 Difference]: Without dead ends: 3698 [2018-10-24 23:36:57,104 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-24 23:36:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2018-10-24 23:36:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3687. [2018-10-24 23:36:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-10-24 23:36:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 5870 transitions. [2018-10-24 23:36:57,223 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 5870 transitions. Word has length 87 [2018-10-24 23:36:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:36:57,224 INFO L481 AbstractCegarLoop]: Abstraction has 3687 states and 5870 transitions. [2018-10-24 23:36:57,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:36:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 5870 transitions. [2018-10-24 23:36:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-24 23:36:57,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:36:57,231 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:36:57,231 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:36:57,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:36:57,232 INFO L82 PathProgramCache]: Analyzing trace with hash -103892254, now seen corresponding path program 1 times [2018-10-24 23:36:57,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:36:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:57,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:36:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:36:57,235 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:36:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:36:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:36:57,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:36:57,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:36:57,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:36:57,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:36:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:36:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:36:57,455 INFO L87 Difference]: Start difference. First operand 3687 states and 5870 transitions. Second operand 5 states. [2018-10-24 23:37:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:10,793 INFO L93 Difference]: Finished difference Result 10963 states and 17865 transitions. [2018-10-24 23:37:10,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:37:10,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-10-24 23:37:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:10,827 INFO L225 Difference]: With dead ends: 10963 [2018-10-24 23:37:10,828 INFO L226 Difference]: Without dead ends: 7282 [2018-10-24 23:37:10,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:37:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2018-10-24 23:37:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7175. [2018-10-24 23:37:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7175 states. [2018-10-24 23:37:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 10520 transitions. [2018-10-24 23:37:11,018 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 10520 transitions. Word has length 89 [2018-10-24 23:37:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:11,019 INFO L481 AbstractCegarLoop]: Abstraction has 7175 states and 10520 transitions. [2018-10-24 23:37:11,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:37:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10520 transitions. [2018-10-24 23:37:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-24 23:37:11,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:11,024 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:37:11,024 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:11,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash 223981530, now seen corresponding path program 1 times [2018-10-24 23:37:11,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:11,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:11,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:11,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:37:11,176 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:11,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:37:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:37:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:37:11,178 INFO L87 Difference]: Start difference. First operand 7175 states and 10520 transitions. Second operand 3 states. [2018-10-24 23:37:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:20,141 INFO L93 Difference]: Finished difference Result 21004 states and 31912 transitions. [2018-10-24 23:37:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:37:20,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-10-24 23:37:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:20,202 INFO L225 Difference]: With dead ends: 21004 [2018-10-24 23:37:20,202 INFO L226 Difference]: Without dead ends: 13835 [2018-10-24 23:37:20,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:37:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2018-10-24 23:37:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 13812. [2018-10-24 23:37:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2018-10-24 23:37:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 18586 transitions. [2018-10-24 23:37:20,576 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 18586 transitions. Word has length 133 [2018-10-24 23:37:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:20,577 INFO L481 AbstractCegarLoop]: Abstraction has 13812 states and 18586 transitions. [2018-10-24 23:37:20,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:37:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 18586 transitions. [2018-10-24 23:37:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-24 23:37:20,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:20,585 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:37:20,585 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:20,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1813117700, now seen corresponding path program 1 times [2018-10-24 23:37:20,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:20,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:20,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:20,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:20,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:37:20,739 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:20,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:37:20,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:37:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:37:20,741 INFO L87 Difference]: Start difference. First operand 13812 states and 18586 transitions. Second operand 3 states. [2018-10-24 23:37:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:29,267 INFO L93 Difference]: Finished difference Result 34306 states and 48857 transitions. [2018-10-24 23:37:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:37:29,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-24 23:37:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:29,354 INFO L225 Difference]: With dead ends: 34306 [2018-10-24 23:37:29,354 INFO L226 Difference]: Without dead ends: 20500 [2018-10-24 23:37:29,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:37:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20500 states. [2018-10-24 23:37:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20500 to 20470. [2018-10-24 23:37:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20470 states. [2018-10-24 23:37:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20470 states to 20470 states and 27161 transitions. [2018-10-24 23:37:30,130 INFO L78 Accepts]: Start accepts. Automaton has 20470 states and 27161 transitions. Word has length 138 [2018-10-24 23:37:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:30,131 INFO L481 AbstractCegarLoop]: Abstraction has 20470 states and 27161 transitions. [2018-10-24 23:37:30,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:37:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 20470 states and 27161 transitions. [2018-10-24 23:37:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-24 23:37:30,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:30,139 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:37:30,139 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:30,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash -599345729, now seen corresponding path program 1 times [2018-10-24 23:37:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:30,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:30,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:30,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:30,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:30,464 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:37:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:30,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:37:30,834 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:37:30,835 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-10-24 23:37:30,837 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2663], [2665], [2668], [2676], [2684], [2692], [2700], [2708], [2716], [2724], [2732], [2740], [2748], [2756], [2764], [2772], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3120], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3363], [3365], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-24 23:37:30,905 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:37:30,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:37:31,839 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:37:31,842 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:37:31,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:31,856 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:37:32,635 INFO L232 lantSequenceWeakener]: Weakened 197 states. On average, predicates are now at 70.68% of their original sizes. [2018-10-24 23:37:32,636 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:37:32,784 INFO L413 sIntCurrentIteration]: We have 207 unified AI predicates [2018-10-24 23:37:32,784 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:37:32,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:37:32,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:37:32,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:32,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:37:32,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:37:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:37:32,787 INFO L87 Difference]: Start difference. First operand 20470 states and 27161 transitions. Second operand 6 states. [2018-10-24 23:37:37,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:37:37,354 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: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: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.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.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) 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-24 23:37:37,359 INFO L168 Benchmark]: Toolchain (without parser) took 86554.72 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -602.8 MB). Peak memory consumption was 912.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:37,361 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-24 23:37:37,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2345.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:37,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 582.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:37,363 INFO L168 Benchmark]: Boogie Preprocessor took 390.54 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:37,364 INFO L168 Benchmark]: RCFGBuilder took 12714.18 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 209.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -41.8 MB). Peak memory consumption was 680.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:37,365 INFO L168 Benchmark]: TraceAbstraction took 70516.23 ms. Allocated memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: 500.7 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 216.7 MB). Peak memory consumption was 717.4 MB. Max. memory is 7.1 GB. [2018-10-24 23:37:37,371 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 2345.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 582.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.3 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 390.54 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: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12714.18 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 209.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -41.8 MB). Peak memory consumption was 680.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70516.23 ms. Allocated memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: 500.7 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 216.7 MB). Peak memory consumption was 717.4 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...