java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/filter1.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:31:22,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:31:22,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:31:22,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:31:22,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:31:22,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:31:22,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:31:22,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:31:22,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:31:22,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:31:22,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:31:22,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:31:22,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:31:22,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:31:22,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:31:22,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:31:22,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:31:22,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:31:22,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:31:22,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:31:22,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:31:22,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:31:22,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:31:22,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:31:22,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:31:22,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:31:22,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:31:22,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:31:22,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:31:22,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:31:22,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:31:22,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:31:22,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:31:22,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:31:22,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:31:22,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:31:22,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:31:22,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:31:22,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:31:22,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:31:22,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:31:22,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:31:22,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:31:22,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:31:22,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:31:22,842 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:31:22,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:31:22,843 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:31:22,843 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:31:22,844 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:31:22,844 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:31:22,844 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:31:22,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:31:22,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:31:22,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:31:22,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:31:22,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:31:22,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:31:22,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:31:22,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:31:22,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:31:22,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:31:22,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:31:22,847 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:31:22,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:31:22,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:31:22,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:31:22,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:31:22,848 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:31:22,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:31:22,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:31:22,848 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:31:22,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:31:22,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:31:22,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:31:22,895 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:31:22,895 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:31:22,896 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter1.c.v+nlh-reducer.c [2019-09-10 01:31:22,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d4b7749/0948f1fbf80b4286a04bb7963a0f2050/FLAGed32df7ad [2019-09-10 01:31:23,395 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:31:23,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c.v+nlh-reducer.c [2019-09-10 01:31:23,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d4b7749/0948f1fbf80b4286a04bb7963a0f2050/FLAGed32df7ad [2019-09-10 01:31:23,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d4b7749/0948f1fbf80b4286a04bb7963a0f2050 [2019-09-10 01:31:23,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:31:23,772 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:31:23,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:31:23,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:31:23,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:31:23,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:31:23" (1/1) ... [2019-09-10 01:31:23,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b21cfd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:23, skipping insertion in model container [2019-09-10 01:31:23,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:31:23" (1/1) ... [2019-09-10 01:31:23,791 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:31:23,826 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:31:24,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:31:24,030 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:31:24,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:31:24,154 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:31:24,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24 WrapperNode [2019-09-10 01:31:24,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:31:24,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:31:24,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:31:24,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:31:24,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (1/1) ... [2019-09-10 01:31:24,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (1/1) ... [2019-09-10 01:31:24,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (1/1) ... [2019-09-10 01:31:24,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (1/1) ... [2019-09-10 01:31:24,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (1/1) ... [2019-09-10 01:31:24,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (1/1) ... [2019-09-10 01:31:24,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (1/1) ... [2019-09-10 01:31:24,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:31:24,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:31:24,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:31:24,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:31:24,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:31:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:31:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:31:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:31:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:31:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 01:31:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-09-10 01:31:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:31:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:31:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:31:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:31:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:31:24,547 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:31:24,547 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:31:24,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:31:24 BoogieIcfgContainer [2019-09-10 01:31:24,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:31:24,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:31:24,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:31:24,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:31:24,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:31:23" (1/3) ... [2019-09-10 01:31:24,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e61cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:31:24, skipping insertion in model container [2019-09-10 01:31:24,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:24" (2/3) ... [2019-09-10 01:31:24,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e61cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:31:24, skipping insertion in model container [2019-09-10 01:31:24,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:31:24" (3/3) ... [2019-09-10 01:31:24,557 INFO L109 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2019-09-10 01:31:24,564 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:31:24,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 01:31:24,582 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 01:31:24,608 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:31:24,608 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:31:24,608 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:31:24,608 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:31:24,609 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:31:24,609 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:31:24,609 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:31:24,609 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:31:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-09-10 01:31:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:24,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:24,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:24,634 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:24,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1787958460, now seen corresponding path program 1 times [2019-09-10 01:31:24,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:24,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:24,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:24,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:24,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:31:24,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:24,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:31:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:31:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:31:24,832 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2019-09-10 01:31:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:24,898 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2019-09-10 01:31:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:31:24,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-10 01:31:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:24,909 INFO L225 Difference]: With dead ends: 60 [2019-09-10 01:31:24,910 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 01:31:24,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 01:31:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2019-09-10 01:31:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 01:31:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-09-10 01:31:24,950 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2019-09-10 01:31:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:24,950 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-09-10 01:31:24,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:31:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-09-10 01:31:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:24,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:24,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:24,952 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1722328887, now seen corresponding path program 1 times [2019-09-10 01:31:24,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:24,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:24,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:24,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:24,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:25,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:25,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:31:25,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:25,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:31:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:31:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:25,035 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 5 states. [2019-09-10 01:31:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:25,180 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-09-10 01:31:25,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:31:25,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 01:31:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:25,182 INFO L225 Difference]: With dead ends: 58 [2019-09-10 01:31:25,182 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 01:31:25,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:31:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 01:31:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2019-09-10 01:31:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 01:31:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-09-10 01:31:25,191 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-09-10 01:31:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:25,191 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-09-10 01:31:25,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:31:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-09-10 01:31:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:31:25,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:25,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:25,193 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:25,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash 466965052, now seen corresponding path program 1 times [2019-09-10 01:31:25,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:25,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:25,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:31:25,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:25,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:31:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:31:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:25,261 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 5 states. [2019-09-10 01:31:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:25,373 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-09-10 01:31:25,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:31:25,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 01:31:25,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:25,376 INFO L225 Difference]: With dead ends: 52 [2019-09-10 01:31:25,376 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 01:31:25,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:31:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 01:31:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-09-10 01:31:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 01:31:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-09-10 01:31:25,387 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2019-09-10 01:31:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:25,389 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-09-10 01:31:25,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:31:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-09-10 01:31:25,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:31:25,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:25,391 INFO L399 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] [2019-09-10 01:31:25,391 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:25,392 INFO L82 PathProgramCache]: Analyzing trace with hash 308813387, now seen corresponding path program 1 times [2019-09-10 01:31:25,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:25,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:25,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:25,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:25,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:31:25,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:25,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:31:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:31:25,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:25,482 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2019-09-10 01:31:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:25,494 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-09-10 01:31:25,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:31:25,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-10 01:31:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:25,496 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:31:25,496 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 01:31:25,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 01:31:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 01:31:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 01:31:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-10 01:31:25,506 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2019-09-10 01:31:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:25,507 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-10 01:31:25,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:31:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-10 01:31:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:31:25,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:25,511 INFO L399 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] [2019-09-10 01:31:25,511 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 132752368, now seen corresponding path program 1 times [2019-09-10 01:31:25,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:25,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:25,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:25,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:31:25,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:25,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:31:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:31:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:31:25,607 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-09-10 01:31:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:25,641 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-09-10 01:31:25,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:31:25,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-09-10 01:31:25,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:25,643 INFO L225 Difference]: With dead ends: 58 [2019-09-10 01:31:25,643 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 01:31:25,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 01:31:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2019-09-10 01:31:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:31:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-10 01:31:25,649 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2019-09-10 01:31:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:25,649 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-10 01:31:25,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:31:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-10 01:31:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:31:25,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:25,651 INFO L399 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] [2019-09-10 01:31:25,651 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:25,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:25,651 INFO L82 PathProgramCache]: Analyzing trace with hash -25938419, now seen corresponding path program 1 times [2019-09-10 01:31:25,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:25,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:25,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:25,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:25,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 01:31:25,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:25,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:31:25,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:31:25,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:31:25,747 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-09-10 01:31:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:25,884 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-10 01:31:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:31:25,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-10 01:31:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:25,885 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:31:25,885 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 01:31:25,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:31:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 01:31:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 01:31:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:31:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-10 01:31:25,891 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2019-09-10 01:31:25,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:25,891 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-10 01:31:25,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:31:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-10 01:31:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 01:31:25,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:25,895 INFO L399 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] [2019-09-10 01:31:25,895 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:25,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:25,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1292338534, now seen corresponding path program 1 times [2019-09-10 01:31:25,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:25,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:25,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:25,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:26,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:26,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 01:31:26,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:26,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:31:26,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:31:26,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:31:26,005 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 7 states. [2019-09-10 01:31:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:26,112 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-10 01:31:26,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:31:26,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-09-10 01:31:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:26,114 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:31:26,114 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:31:26,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:31:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:31:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:31:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:31:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:31:26,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-10 01:31:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:26,116 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:31:26,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:31:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:31:26,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:31:26,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:31:26 BoogieIcfgContainer [2019-09-10 01:31:26,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:31:26,126 INFO L168 Benchmark]: Toolchain (without parser) took 2353.59 ms. Allocated memory was 133.2 MB in the beginning and 224.9 MB in the end (delta: 91.8 MB). Free memory was 89.2 MB in the beginning and 149.9 MB in the end (delta: -60.6 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:26,127 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:31:26,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.86 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 89.0 MB in the beginning and 177.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:26,131 INFO L168 Benchmark]: Boogie Preprocessor took 27.94 ms. Allocated memory is still 199.8 MB. Free memory was 177.3 MB in the beginning and 175.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:26,132 INFO L168 Benchmark]: RCFGBuilder took 365.26 ms. Allocated memory is still 199.8 MB. Free memory was 175.0 MB in the beginning and 157.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:26,134 INFO L168 Benchmark]: TraceAbstraction took 1573.82 ms. Allocated memory was 199.8 MB in the beginning and 224.9 MB in the end (delta: 25.2 MB). Free memory was 157.9 MB in the beginning and 149.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:26,141 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 380.86 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 89.0 MB in the beginning and 177.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.94 ms. Allocated memory is still 199.8 MB. Free memory was 177.3 MB in the beginning and 175.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 365.26 ms. Allocated memory is still 199.8 MB. Free memory was 175.0 MB in the beginning and 157.9 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1573.82 ms. Allocated memory was 199.8 MB in the beginning and 224.9 MB in the end (delta: 25.2 MB). Free memory was 157.9 MB in the beginning and 149.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 2 error locations. SAFE Result, 1.5s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 240 SDtfs, 315 SDslu, 370 SDs, 0 SdLazy, 153 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 77 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 11191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...