./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product37_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec1_product37_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4cdc62a5b5efdfba89a3280823bf73bd08d347a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:45:52,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:45:52,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:45:52,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:45:52,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:45:52,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:45:52,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:45:52,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:45:52,818 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:45:52,819 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:45:52,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:45:52,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:45:52,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:45:52,823 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:45:52,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:45:52,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:45:52,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:45:52,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:45:52,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:45:52,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:45:52,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:45:52,835 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:45:52,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:45:52,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:45:52,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:45:52,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:45:52,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:45:52,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:45:52,843 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:45:52,844 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:45:52,844 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:45:52,845 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:45:52,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:45:52,846 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:45:52,847 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:45:52,848 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:45:52,848 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:45:52,864 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:45:52,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:45:52,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:45:52,866 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:45:52,866 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:45:52,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:45:52,867 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:45:52,867 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:45:52,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:45:52,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:45:52,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:45:52,867 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:45:52,868 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:45:52,868 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:45:52,868 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:45:52,868 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:45:52,868 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:45:52,868 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:45:52,869 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:45:52,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:45:52,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:45:52,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:45:52,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:45:52,871 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:45:52,871 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:45:52,871 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:45:52,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:45:52,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:45:52,873 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4cdc62a5b5efdfba89a3280823bf73bd08d347a [2019-01-12 14:45:52,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:45:52,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:45:52,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:45:52,936 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:45:52,937 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:45:52,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product37_false-unreach-call_false-termination.cil.c [2019-01-12 14:45:52,999 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec467e8d/2fcc3a0ccb384cbaa39ed00480db0385/FLAG57b97fcec [2019-01-12 14:45:53,482 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:45:53,482 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product37_false-unreach-call_false-termination.cil.c [2019-01-12 14:45:53,502 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec467e8d/2fcc3a0ccb384cbaa39ed00480db0385/FLAG57b97fcec [2019-01-12 14:45:53,769 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec467e8d/2fcc3a0ccb384cbaa39ed00480db0385 [2019-01-12 14:45:53,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:45:53,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:45:53,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:45:53,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:45:53,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:45:53,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:45:53" (1/1) ... [2019-01-12 14:45:53,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d680728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:53, skipping insertion in model container [2019-01-12 14:45:53,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:45:53" (1/1) ... [2019-01-12 14:45:53,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:45:53,851 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:45:54,248 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:45:54,262 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:45:54,512 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:45:54,555 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:45:54,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54 WrapperNode [2019-01-12 14:45:54,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:45:54,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:45:54,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:45:54,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:45:54,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:45:54,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:45:54,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:45:54,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:45:54,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (1/1) ... [2019-01-12 14:45:54,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:45:54,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:45:54,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:45:54,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:45:54,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (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-01-12 14:45:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:45:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:45:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:45:54,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:45:56,064 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:45:56,065 INFO L286 CfgBuilder]: Removed 156 assue(true) statements. [2019-01-12 14:45:56,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:45:56 BoogieIcfgContainer [2019-01-12 14:45:56,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:45:56,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:45:56,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:45:56,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:45:56,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:45:53" (1/3) ... [2019-01-12 14:45:56,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd631a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:45:56, skipping insertion in model container [2019-01-12 14:45:56,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:45:54" (2/3) ... [2019-01-12 14:45:56,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd631a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:45:56, skipping insertion in model container [2019-01-12 14:45:56,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:45:56" (3/3) ... [2019-01-12 14:45:56,074 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product37_false-unreach-call_false-termination.cil.c [2019-01-12 14:45:56,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:45:56,092 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:45:56,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:45:56,143 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:45:56,144 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:45:56,144 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:45:56,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:45:56,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:45:56,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:45:56,145 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:45:56,145 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:45:56,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:45:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-01-12 14:45:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:45:56,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:56,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:45:56,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2109695399, now seen corresponding path program 1 times [2019-01-12 14:45:56,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:56,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:56,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:56,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:56,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:56,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:56,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:45:56,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:45:56,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:45:56,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:45:56,495 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-01-12 14:45:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:56,529 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-01-12 14:45:56,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:45:56,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:45:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:56,544 INFO L225 Difference]: With dead ends: 216 [2019-01-12 14:45:56,545 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 14:45:56,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:45:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 14:45:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-12 14:45:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-12 14:45:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-01-12 14:45:56,596 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-01-12 14:45:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:56,596 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-01-12 14:45:56,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:45:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-01-12 14:45:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:45:56,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:56,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:45:56,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1093063509, now seen corresponding path program 1 times [2019-01-12 14:45:56,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:56,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:56,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:45:56,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:45:56,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:45:56,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:45:56,755 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-01-12 14:45:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:56,781 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-01-12 14:45:56,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:45:56,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:45:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:56,783 INFO L225 Difference]: With dead ends: 107 [2019-01-12 14:45:56,783 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 14:45:56,784 INFO L631 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-01-12 14:45:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 14:45:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 14:45:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:45:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-01-12 14:45:56,791 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-01-12 14:45:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:56,791 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-01-12 14:45:56,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:45:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-01-12 14:45:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:45:56,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:56,793 INFO L402 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] [2019-01-12 14:45:56,793 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash -720159228, now seen corresponding path program 1 times [2019-01-12 14:45:56,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:56,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:56,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:56,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:56,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:45:56,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:45:56,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:45:56,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:45:56,929 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 3 states. [2019-01-12 14:45:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:56,954 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-01-12 14:45:56,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:45:56,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 14:45:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:56,958 INFO L225 Difference]: With dead ends: 84 [2019-01-12 14:45:56,959 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 14:45:56,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-12 14:45:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 14:45:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 14:45:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:45:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-01-12 14:45:56,969 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-01-12 14:45:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:56,970 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-01-12 14:45:56,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:45:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-01-12 14:45:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:45:56,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:56,971 INFO L402 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] [2019-01-12 14:45:56,971 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2091202829, now seen corresponding path program 1 times [2019-01-12 14:45:56,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:56,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:56,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:57,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:57,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:45:57,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:45:57,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:45:57,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:45:57,122 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-01-12 14:45:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:57,257 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-01-12 14:45:57,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:45:57,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:45:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:57,259 INFO L225 Difference]: With dead ends: 105 [2019-01-12 14:45:57,259 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 14:45:57,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-12 14:45:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 14:45:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-01-12 14:45:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-12 14:45:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-01-12 14:45:57,269 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-01-12 14:45:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:57,269 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-01-12 14:45:57,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:45:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-01-12 14:45:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:45:57,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:57,272 INFO L402 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] [2019-01-12 14:45:57,272 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1013899842, now seen corresponding path program 1 times [2019-01-12 14:45:57,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:57,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:57,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:57,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:57,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:57,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:45:57,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:45:57,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:45:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:45:57,574 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-01-12 14:45:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:57,978 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-01-12 14:45:57,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:45:57,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:45:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:57,981 INFO L225 Difference]: With dead ends: 171 [2019-01-12 14:45:57,981 INFO L226 Difference]: Without dead ends: 113 [2019-01-12 14:45:57,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:45:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-12 14:45:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-01-12 14:45:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 14:45:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-01-12 14:45:57,993 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-01-12 14:45:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:57,994 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-01-12 14:45:57,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:45:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-01-12 14:45:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:45:57,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:57,996 INFO L402 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] [2019-01-12 14:45:57,996 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1648611201, now seen corresponding path program 1 times [2019-01-12 14:45:57,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:57,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:58,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:58,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:58,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:58,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:45:58,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:45:58,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:45:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:45:58,180 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-01-12 14:45:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:58,874 INFO L93 Difference]: Finished difference Result 344 states and 483 transitions. [2019-01-12 14:45:58,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:45:58,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:45:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:58,882 INFO L225 Difference]: With dead ends: 344 [2019-01-12 14:45:58,883 INFO L226 Difference]: Without dead ends: 280 [2019-01-12 14:45:58,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:45:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-12 14:45:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 128. [2019-01-12 14:45:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-12 14:45:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2019-01-12 14:45:58,928 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 30 [2019-01-12 14:45:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:58,928 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2019-01-12 14:45:58,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:45:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2019-01-12 14:45:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:45:58,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:58,935 INFO L402 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] [2019-01-12 14:45:58,938 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1974587593, now seen corresponding path program 1 times [2019-01-12 14:45:58,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:58,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:58,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:58,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:45:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:45:59,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:45:59,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:45:59,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:45:59,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:45:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:45:59,245 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand 5 states. [2019-01-12 14:45:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:45:59,823 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2019-01-12 14:45:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:45:59,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:45:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:45:59,828 INFO L225 Difference]: With dead ends: 366 [2019-01-12 14:45:59,828 INFO L226 Difference]: Without dead ends: 364 [2019-01-12 14:45:59,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:45:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-12 14:45:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 128. [2019-01-12 14:45:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-12 14:45:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2019-01-12 14:45:59,851 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 31 [2019-01-12 14:45:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:45:59,851 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2019-01-12 14:45:59,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:45:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2019-01-12 14:45:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:45:59,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:45:59,855 INFO L402 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] [2019-01-12 14:45:59,855 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:45:59,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:45:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash -735158350, now seen corresponding path program 1 times [2019-01-12 14:45:59,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:45:59,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:45:59,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:59,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:45:59,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:45:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:00,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-01-12 14:46:00,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:00,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:00,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:46:00,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:46:00,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:46:00,004 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand 4 states. [2019-01-12 14:46:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:00,249 INFO L93 Difference]: Finished difference Result 308 states and 416 transitions. [2019-01-12 14:46:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:46:00,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-12 14:46:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:00,252 INFO L225 Difference]: With dead ends: 308 [2019-01-12 14:46:00,252 INFO L226 Difference]: Without dead ends: 186 [2019-01-12 14:46:00,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-12 14:46:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2019-01-12 14:46:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-12 14:46:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2019-01-12 14:46:00,273 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 31 [2019-01-12 14:46:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:00,275 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2019-01-12 14:46:00,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:46:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2019-01-12 14:46:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:00,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:00,276 INFO L402 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] [2019-01-12 14:46:00,278 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash -476992912, now seen corresponding path program 1 times [2019-01-12 14:46:00,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:00,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:00,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:00,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:46:00,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:00,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:00,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:00,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:00,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:00,378 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2019-01-12 14:46:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:00,559 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2019-01-12 14:46:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:00,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-12 14:46:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:00,562 INFO L225 Difference]: With dead ends: 316 [2019-01-12 14:46:00,563 INFO L226 Difference]: Without dead ends: 186 [2019-01-12 14:46:00,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-12 14:46:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-12 14:46:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-01-12 14:46:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-12 14:46:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2019-01-12 14:46:00,594 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 31 [2019-01-12 14:46:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:00,595 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2019-01-12 14:46:00,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2019-01-12 14:46:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:46:00,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:00,598 INFO L402 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] [2019-01-12 14:46:00,598 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:00,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:00,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1705214514, now seen corresponding path program 1 times [2019-01-12 14:46:00,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:00,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:00,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:00,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:01,501 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:01,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:01 BoogieIcfgContainer [2019-01-12 14:46:01,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:01,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:01,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:01,636 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:01,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:45:56" (3/4) ... [2019-01-12 14:46:01,643 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:01,779 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:01,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:01,780 INFO L168 Benchmark]: Toolchain (without parser) took 8006.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -128.8 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:01,783 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:01,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:01,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:01,786 INFO L168 Benchmark]: Boogie Preprocessor took 63.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:01,786 INFO L168 Benchmark]: RCFGBuilder took 1371.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:01,789 INFO L168 Benchmark]: TraceAbstraction took 5568.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -46.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:01,795 INFO L168 Benchmark]: Witness Printer took 143.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:01,799 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 779.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1371.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5568.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -46.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Witness Printer took 143.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 543]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L406] int cleanupTimeShifts = 4; [L588] int pumpRunning = 0; [L589] int systemActive = 1; [L832] int waterLevel = 1; [L833] int methaneLevelCritical = 0; [L487] int retValue_acc ; [L488] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L574] int retValue_acc ; [L577] retValue_acc = 1 [L578] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L494] tmp = valid_product() [L496] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L767] int splverifierCounter ; [L768] int tmp ; [L769] int tmp___0 ; [L770] int tmp___1 ; [L771] int tmp___2 ; [L774] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L784] tmp = __VERIFIER_nondet_int() [L786] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L850] COND TRUE waterLevel < 2 [L851] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L794] tmp___0 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L862] COND FALSE !(\read(methaneLevelCritical)) [L865] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] tmp___2 = __VERIFIER_nondet_int() [L806] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L595] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L602] COND TRUE \read(systemActive) [L650] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L653] COND FALSE !(\read(pumpRunning)) [L624] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L627] COND TRUE ! pumpRunning [L747] int retValue_acc ; [L748] int tmp ; [L749] int tmp___0 ; [L912] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L915] COND FALSE !(waterLevel < 2) [L919] retValue_acc = 0 [L920] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L753] tmp = isHighWaterSensorDry() [L755] COND FALSE !(\read(tmp)) [L758] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L760] retValue_acc = tmp___0 [L761] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L629] tmp = isHighWaterLevel() [L631] COND TRUE \read(tmp) [L678] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L514] int tmp ; [L515] int tmp___0 ; [L871] int retValue_acc ; [L874] retValue_acc = methaneLevelCritical [L875] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L519] tmp = isMethaneLevelCritical() [L521] COND TRUE \read(tmp) [L702] int retValue_acc ; [L705] retValue_acc = pumpRunning [L706] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L523] tmp___0 = isPumpRunning() [L525] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L543] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 3 error locations. UNSAFE Result, 5.4s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 787 SDtfs, 819 SDslu, 960 SDs, 0 SdLazy, 146 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=9, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 483 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 11991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...