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_label07_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:51:46,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:51:46,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:51:46,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:51:46,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:51:46,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:51:46,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:51:46,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:51:46,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:51:46,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:51:46,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:51:46,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:51:46,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:51:46,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:51:46,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:51:46,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:51:46,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:51:46,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:51:46,834 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:51:46,836 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:51:46,839 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:51:46,840 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:51:46,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:51:46,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:51:46,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:51:46,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:51:46,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:51:46,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:51:46,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:51:46,854 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:51:46,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:51:46,857 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:51:46,857 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:51:46,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:51:46,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:51:46,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:51:46,862 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:51:46,893 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:51:46,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:51:46,894 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:51:46,895 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:51:46,895 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:51:46,895 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:51:46,895 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:51:46,895 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:51:46,896 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:51:46,896 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:51:46,896 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:51:46,896 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:51:46,896 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:51:46,896 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:51:46,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:51:46,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:51:46,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:51:46,899 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:51:46,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:51:46,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:51:46,900 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:51:46,900 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:51:46,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:51:46,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:51:46,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:51:46,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:51:46,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:51:46,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:51:46,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:51:46,902 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:51:46,902 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:51:46,903 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:51:46,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:51:46,903 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:51:46,903 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:51:46,903 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:51:46,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:51:46,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:51:46,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:51:46,988 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:51:46,989 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:51:46,989 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label07_true-unreach-call.c [2018-10-25 01:51:47,045 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e4d0b3ca6/050e07dc06ee45f3b914bb43b0fe6373/FLAG0a2f1c7e1 [2018-10-25 01:51:47,737 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:51:47,737 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label07_true-unreach-call.c [2018-10-25 01:51:47,761 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e4d0b3ca6/050e07dc06ee45f3b914bb43b0fe6373/FLAG0a2f1c7e1 [2018-10-25 01:51:47,776 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e4d0b3ca6/050e07dc06ee45f3b914bb43b0fe6373 [2018-10-25 01:51:47,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:51:47,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:51:47,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:51:47,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:51:47,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:51:47,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:51:47" (1/1) ... [2018-10-25 01:51:47,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217f5456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:47, skipping insertion in model container [2018-10-25 01:51:47,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:51:47" (1/1) ... [2018-10-25 01:51:47,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:51:47,907 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:51:48,600 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:51:48,605 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:51:48,873 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:51:48,892 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:51:48,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48 WrapperNode [2018-10-25 01:51:48,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:51:48,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:51:48,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:51:48,894 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:51:48,904 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:51:48" (1/1) ... [2018-10-25 01:51:48,939 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:51:48" (1/1) ... [2018-10-25 01:51:49,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:51:49,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:51:49,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:51:49,205 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:51:49,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (1/1) ... [2018-10-25 01:51:49,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (1/1) ... [2018-10-25 01:51:49,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (1/1) ... [2018-10-25 01:51:49,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (1/1) ... [2018-10-25 01:51:49,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (1/1) ... [2018-10-25 01:51:49,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (1/1) ... [2018-10-25 01:51:49,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (1/1) ... [2018-10-25 01:51:49,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:51:49,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:51:49,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:51:49,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:51:49,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (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:51:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:51:49,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:51:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:51:49,469 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:51:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:51:49,470 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:51:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:51:49,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:51:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:51:49,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:51:56,725 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:51:56,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:51:56 BoogieIcfgContainer [2018-10-25 01:51:56,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:51:56,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:51:56,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:51:56,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:51:56,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:51:47" (1/3) ... [2018-10-25 01:51:56,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5323518a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:51:56, skipping insertion in model container [2018-10-25 01:51:56,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:51:48" (2/3) ... [2018-10-25 01:51:56,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5323518a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:51:56, skipping insertion in model container [2018-10-25 01:51:56,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:51:56" (3/3) ... [2018-10-25 01:51:56,744 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label07_true-unreach-call.c [2018-10-25 01:51:56,754 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:51:56,770 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:51:56,788 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:51:56,839 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:51:56,839 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:51:56,839 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:51:56,839 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:51:56,839 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:51:56,840 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:51:56,840 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:51:56,840 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:51:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-10-25 01:51:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-25 01:51:56,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:51:56,890 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] [2018-10-25 01:51:56,893 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:51:56,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:51:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1432875621, now seen corresponding path program 1 times [2018-10-25 01:51:56,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:51:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:56,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:51:56,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:51:56,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:51:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:51:57,417 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:51:57,523 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:51:57,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:51:57,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:51:57,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:51:57,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:51:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:51:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:51:57,562 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2018-10-25 01:52:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:01,302 INFO L93 Difference]: Finished difference Result 1156 states and 2144 transitions. [2018-10-25 01:52:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:52:01,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-10-25 01:52:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:01,330 INFO L225 Difference]: With dead ends: 1156 [2018-10-25 01:52:01,330 INFO L226 Difference]: Without dead ends: 744 [2018-10-25 01:52:01,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:52:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-25 01:52:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2018-10-25 01:52:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-25 01:52:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1317 transitions. [2018-10-25 01:52:01,450 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1317 transitions. Word has length 61 [2018-10-25 01:52:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:01,452 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1317 transitions. [2018-10-25 01:52:01,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:52:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1317 transitions. [2018-10-25 01:52:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-25 01:52:01,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:01,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:52:01,466 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:01,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:01,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1517109448, now seen corresponding path program 1 times [2018-10-25 01:52:01,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:01,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:01,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:01,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:01,470 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:01,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:01,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:01,877 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:01,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:01,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:01,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:01,880 INFO L87 Difference]: Start difference. First operand 744 states and 1317 transitions. Second operand 6 states. [2018-10-25 01:52:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:14,264 INFO L93 Difference]: Finished difference Result 2959 states and 5492 transitions. [2018-10-25 01:52:14,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:52:14,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-10-25 01:52:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:14,291 INFO L225 Difference]: With dead ends: 2959 [2018-10-25 01:52:14,292 INFO L226 Difference]: Without dead ends: 2221 [2018-10-25 01:52:14,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:52:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2018-10-25 01:52:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2170. [2018-10-25 01:52:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2018-10-25 01:52:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3670 transitions. [2018-10-25 01:52:14,406 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3670 transitions. Word has length 137 [2018-10-25 01:52:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:14,407 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 3670 transitions. [2018-10-25 01:52:14,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3670 transitions. [2018-10-25 01:52:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 01:52:14,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:14,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:52:14,413 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:14,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash -726077568, now seen corresponding path program 1 times [2018-10-25 01:52:14,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:14,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:14,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:14,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:14,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:14,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:14,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:14,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:14,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:14,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:14,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:14,657 INFO L87 Difference]: Start difference. First operand 2170 states and 3670 transitions. Second operand 6 states. [2018-10-25 01:52:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:20,761 INFO L93 Difference]: Finished difference Result 8031 states and 14213 transitions. [2018-10-25 01:52:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:20,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-10-25 01:52:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:20,802 INFO L225 Difference]: With dead ends: 8031 [2018-10-25 01:52:20,802 INFO L226 Difference]: Without dead ends: 5867 [2018-10-25 01:52:20,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2018-10-25 01:52:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 5813. [2018-10-25 01:52:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5813 states. [2018-10-25 01:52:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5813 states to 5813 states and 8926 transitions. [2018-10-25 01:52:21,018 INFO L78 Accepts]: Start accepts. Automaton has 5813 states and 8926 transitions. Word has length 141 [2018-10-25 01:52:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:21,018 INFO L481 AbstractCegarLoop]: Abstraction has 5813 states and 8926 transitions. [2018-10-25 01:52:21,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5813 states and 8926 transitions. [2018-10-25 01:52:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-25 01:52:21,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:21,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:52:21,025 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:21,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash 664486408, now seen corresponding path program 1 times [2018-10-25 01:52:21,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:21,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:21,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:52:21,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:52:21,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:52:21,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:21,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:21,301 INFO L87 Difference]: Start difference. First operand 5813 states and 8926 transitions. Second operand 6 states. [2018-10-25 01:52:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:52:24,562 INFO L93 Difference]: Finished difference Result 13508 states and 21994 transitions. [2018-10-25 01:52:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:52:24,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2018-10-25 01:52:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:52:24,619 INFO L225 Difference]: With dead ends: 13508 [2018-10-25 01:52:24,620 INFO L226 Difference]: Without dead ends: 7701 [2018-10-25 01:52:24,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:52:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7701 states. [2018-10-25 01:52:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7701 to 7634. [2018-10-25 01:52:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7634 states. [2018-10-25 01:52:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7634 states to 7634 states and 11481 transitions. [2018-10-25 01:52:24,947 INFO L78 Accepts]: Start accepts. Automaton has 7634 states and 11481 transitions. Word has length 177 [2018-10-25 01:52:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:52:24,948 INFO L481 AbstractCegarLoop]: Abstraction has 7634 states and 11481 transitions. [2018-10-25 01:52:24,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:52:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 7634 states and 11481 transitions. [2018-10-25 01:52:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-25 01:52:24,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:52:24,958 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, 2, 2, 2, 2, 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] [2018-10-25 01:52:24,958 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:52:24,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1642365103, now seen corresponding path program 1 times [2018-10-25 01:52:24,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:52:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:24,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:52:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:52:24,960 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:52:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:52:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 108 proven. 77 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:52:25,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:52:25,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:52:25,236 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 228 with the following transitions: [2018-10-25 01:52:25,238 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], [567], [569], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [720], [721], [725], [728], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-10-25 01:52:25,288 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:52:25,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:52:25,770 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:52:25,772 INFO L272 AbstractInterpreter]: Visited 89 different actions 89 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:52:25,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:52:25,807 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:52:26,254 INFO L232 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 78.21% of their original sizes. [2018-10-25 01:52:26,254 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:52:26,419 INFO L413 sIntCurrentIteration]: We have 226 unified AI predicates [2018-10-25 01:52:26,420 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:52:26,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:52:26,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:52:26,424 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:52:26,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:52:26,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:52:26,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:52:26,425 INFO L87 Difference]: Start difference. First operand 7634 states and 11481 transitions. Second operand 6 states. [2018-10-25 01:53:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:53:15,595 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:53:15,605 INFO L168 Benchmark]: Toolchain (without parser) took 87817.97 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 942.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:15,607 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:53:15,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1104.26 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:53:15,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 310.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -856.5 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:15,610 INFO L168 Benchmark]: Boogie Preprocessor took 188.59 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:15,611 INFO L168 Benchmark]: RCFGBuilder took 7333.21 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: 267.2 MB). Peak memory consumption was 267.2 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:15,616 INFO L168 Benchmark]: TraceAbstraction took 78873.24 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 676.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:53:15,626 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 1104.26 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 310.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -856.5 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 188.59 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7333.21 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: 267.2 MB). Peak memory consumption was 267.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78873.24 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 676.1 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...