./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product52_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_product52_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 eb59a6e6bbeea05d6faf844d6f750609a5360ad9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:46:40,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:46:40,917 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:46:40,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:46:40,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:46:40,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:46:40,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:46:40,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:46:40,939 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:46:40,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:46:40,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:46:40,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:46:40,943 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:46:40,944 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:46:40,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:46:40,946 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:46:40,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:46:40,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:46:40,951 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:46:40,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:46:40,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:46:40,955 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:46:40,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:46:40,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:46:40,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:46:40,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:46:40,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:46:40,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:46:40,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:46:40,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:46:40,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:46:40,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:46:40,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:46:40,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:46:40,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:46:40,967 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:46:40,967 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:46:40,982 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:46:40,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:46:40,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:46:40,984 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:46:40,984 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:46:40,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:46:40,984 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:46:40,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:46:40,985 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:46:40,985 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:46:40,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:46:40,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:46:40,986 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:46:40,986 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:46:40,986 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:46:40,986 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:46:40,986 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:46:40,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:46:40,987 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:46:40,987 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:46:40,987 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:46:40,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:40,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:46:40,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:46:40,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:46:40,990 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:46:40,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:46:40,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:46:40,990 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 -> eb59a6e6bbeea05d6faf844d6f750609a5360ad9 [2019-01-12 14:46:41,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:46:41,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:46:41,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:46:41,066 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:46:41,067 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:46:41,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product52_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:41,121 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3bb884/fe4f26f93962498a91c93ec335ba333a/FLAG48e94c51c [2019-01-12 14:46:41,674 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:46:41,676 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product52_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:41,693 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3bb884/fe4f26f93962498a91c93ec335ba333a/FLAG48e94c51c [2019-01-12 14:46:41,929 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3bb884/fe4f26f93962498a91c93ec335ba333a [2019-01-12 14:46:41,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:41,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:41,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:41,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:41,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:41,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545f91c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:41, skipping insertion in model container [2019-01-12 14:46:41,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:41" (1/1) ... [2019-01-12 14:46:41,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:42,017 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:42,379 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:42,399 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:42,544 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:42,595 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:42,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42 WrapperNode [2019-01-12 14:46:42,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:42,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:42,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:42,597 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:42,605 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:46:42" (1/1) ... [2019-01-12 14:46:42,625 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:46:42" (1/1) ... [2019-01-12 14:46:42,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:42,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:42,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:42,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:42,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (1/1) ... [2019-01-12 14:46:42,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (1/1) ... [2019-01-12 14:46:42,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (1/1) ... [2019-01-12 14:46:42,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (1/1) ... [2019-01-12 14:46:42,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (1/1) ... [2019-01-12 14:46:42,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (1/1) ... [2019-01-12 14:46:42,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (1/1) ... [2019-01-12 14:46:42,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:42,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:42,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:42,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:42,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (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:46:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:44,277 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:44,278 INFO L286 CfgBuilder]: Removed 162 assue(true) statements. [2019-01-12 14:46:44,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:44 BoogieIcfgContainer [2019-01-12 14:46:44,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:44,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:44,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:44,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:44,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:41" (1/3) ... [2019-01-12 14:46:44,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24929efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:44, skipping insertion in model container [2019-01-12 14:46:44,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:42" (2/3) ... [2019-01-12 14:46:44,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24929efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:44, skipping insertion in model container [2019-01-12 14:46:44,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:44" (3/3) ... [2019-01-12 14:46:44,287 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product52_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:44,297 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:44,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:44,323 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:44,351 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:44,352 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:44,352 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:44,352 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:44,352 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:44,352 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:44,352 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:44,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:44,353 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-01-12 14:46:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:46:44,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:44,377 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:46:44,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1794729554, now seen corresponding path program 1 times [2019-01-12 14:46:44,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:44,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:44,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:44,664 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:44,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:44,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:44,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:44,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:44,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:44,691 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2019-01-12 14:46:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:44,728 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2019-01-12 14:46:44,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:44,730 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:46:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:44,745 INFO L225 Difference]: With dead ends: 232 [2019-01-12 14:46:44,745 INFO L226 Difference]: Without dead ends: 115 [2019-01-12 14:46:44,750 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:46:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-12 14:46:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-12 14:46:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-12 14:46:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-01-12 14:46:44,800 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2019-01-12 14:46:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:44,801 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-01-12 14:46:44,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-01-12 14:46:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:46:44,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:44,803 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:46:44,803 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash 529368141, now seen corresponding path program 1 times [2019-01-12 14:46:44,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:44,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:44,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:44,976 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:44,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:44,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:46:44,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:44,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:44,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:44,979 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-01-12 14:46:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:45,000 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2019-01-12 14:46:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:45,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:46:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:45,003 INFO L225 Difference]: With dead ends: 115 [2019-01-12 14:46:45,004 INFO L226 Difference]: Without dead ends: 49 [2019-01-12 14:46:45,005 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:46:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-12 14:46:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-12 14:46:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-12 14:46:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2019-01-12 14:46:45,013 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2019-01-12 14:46:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:45,014 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2019-01-12 14:46:45,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2019-01-12 14:46:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:46:45,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:45,015 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:46:45,017 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:45,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2061312917, now seen corresponding path program 1 times [2019-01-12 14:46:45,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:45,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:45,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:45,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:45,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:45,217 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:45,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:45,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:45,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:45,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:45,219 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 5 states. [2019-01-12 14:46:45,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:45,462 INFO L93 Difference]: Finished difference Result 115 states and 170 transitions. [2019-01-12 14:46:45,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:45,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 14:46:45,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:45,464 INFO L225 Difference]: With dead ends: 115 [2019-01-12 14:46:45,465 INFO L226 Difference]: Without dead ends: 72 [2019-01-12 14:46:45,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:46:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-12 14:46:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-01-12 14:46:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 14:46:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2019-01-12 14:46:45,491 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 22 [2019-01-12 14:46:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:45,492 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2019-01-12 14:46:45,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2019-01-12 14:46:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:46:45,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:45,494 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:46:45,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1499976397, now seen corresponding path program 1 times [2019-01-12 14:46:45,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:45,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:45,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:45,575 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:45,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:45,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:45,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:45,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:45,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:45,578 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2019-01-12 14:46:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:45,714 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2019-01-12 14:46:45,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:45,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:46:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:45,716 INFO L225 Difference]: With dead ends: 151 [2019-01-12 14:46:45,716 INFO L226 Difference]: Without dead ends: 89 [2019-01-12 14:46:45,717 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:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-12 14:46:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-12 14:46:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-12 14:46:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-01-12 14:46:45,738 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 24 [2019-01-12 14:46:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:45,740 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-01-12 14:46:45,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-01-12 14:46:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:46:45,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:45,742 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] [2019-01-12 14:46:45,742 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:45,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1678878848, now seen corresponding path program 1 times [2019-01-12 14:46:45,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:45,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:45,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:45,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:45,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:45,952 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:45,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:45,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:45,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:45,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:45,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:45,954 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 5 states. [2019-01-12 14:46:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:46,198 INFO L93 Difference]: Finished difference Result 445 states and 650 transitions. [2019-01-12 14:46:46,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:46:46,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:46:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:46,206 INFO L225 Difference]: With dead ends: 445 [2019-01-12 14:46:46,207 INFO L226 Difference]: Without dead ends: 364 [2019-01-12 14:46:46,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-12 14:46:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 160. [2019-01-12 14:46:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 14:46:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 226 transitions. [2019-01-12 14:46:46,247 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 226 transitions. Word has length 25 [2019-01-12 14:46:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:46,248 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 226 transitions. [2019-01-12 14:46:46,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 226 transitions. [2019-01-12 14:46:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:46:46,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:46,249 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] [2019-01-12 14:46:46,250 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1475071754, now seen corresponding path program 1 times [2019-01-12 14:46:46,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:46,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:46,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:46,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:46,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:46,406 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:46,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:46,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:46,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:46,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:46,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:46,408 INFO L87 Difference]: Start difference. First operand 160 states and 226 transitions. Second operand 5 states. [2019-01-12 14:46:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:47,173 INFO L93 Difference]: Finished difference Result 448 states and 637 transitions. [2019-01-12 14:46:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:47,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:46:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:47,176 INFO L225 Difference]: With dead ends: 448 [2019-01-12 14:46:47,177 INFO L226 Difference]: Without dead ends: 446 [2019-01-12 14:46:47,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 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:46:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-01-12 14:46:47,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 160. [2019-01-12 14:46:47,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 14:46:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 224 transitions. [2019-01-12 14:46:47,205 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 224 transitions. Word has length 26 [2019-01-12 14:46:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:47,206 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 224 transitions. [2019-01-12 14:46:47,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2019-01-12 14:46:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:47,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:47,208 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:47,208 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash 317568404, now seen corresponding path program 1 times [2019-01-12 14:46:47,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:47,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:47,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:47,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:47,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:47,446 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:47,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:47,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:47,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:47,447 INFO L87 Difference]: Start difference. First operand 160 states and 224 transitions. Second operand 5 states. [2019-01-12 14:46:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:47,742 INFO L93 Difference]: Finished difference Result 476 states and 660 transitions. [2019-01-12 14:46:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:47,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:46:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:47,745 INFO L225 Difference]: With dead ends: 476 [2019-01-12 14:46:47,745 INFO L226 Difference]: Without dead ends: 322 [2019-01-12 14:46:47,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:46:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-12 14:46:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 172. [2019-01-12 14:46:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-12 14:46:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 236 transitions. [2019-01-12 14:46:47,775 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 236 transitions. Word has length 31 [2019-01-12 14:46:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:47,775 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 236 transitions. [2019-01-12 14:46:47,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 236 transitions. [2019-01-12 14:46:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:47,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:47,777 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:47,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:47,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:47,778 INFO L82 PathProgramCache]: Analyzing trace with hash -75458606, now seen corresponding path program 1 times [2019-01-12 14:46:47,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:47,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:47,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:47,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:47,927 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:47,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:47,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:47,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:46:47,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:46:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:46:47,929 INFO L87 Difference]: Start difference. First operand 172 states and 236 transitions. Second operand 4 states. [2019-01-12 14:46:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:48,368 INFO L93 Difference]: Finished difference Result 434 states and 592 transitions. [2019-01-12 14:46:48,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:46:48,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-12 14:46:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:48,374 INFO L225 Difference]: With dead ends: 434 [2019-01-12 14:46:48,375 INFO L226 Difference]: Without dead ends: 268 [2019-01-12 14:46:48,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-12 14:46:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 180. [2019-01-12 14:46:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-12 14:46:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 244 transitions. [2019-01-12 14:46:48,428 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 244 transitions. Word has length 31 [2019-01-12 14:46:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:48,428 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 244 transitions. [2019-01-12 14:46:48,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:46:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 244 transitions. [2019-01-12 14:46:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:46:48,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:48,439 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:48,439 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:48,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:48,439 INFO L82 PathProgramCache]: Analyzing trace with hash 182706832, now seen corresponding path program 1 times [2019-01-12 14:46:48,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:48,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:48,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:48,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:48,542 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:48,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:48,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:48,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:48,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:48,545 INFO L87 Difference]: Start difference. First operand 180 states and 244 transitions. Second operand 3 states. [2019-01-12 14:46:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:48,750 INFO L93 Difference]: Finished difference Result 442 states and 598 transitions. [2019-01-12 14:46:48,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:48,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-12 14:46:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:48,755 INFO L225 Difference]: With dead ends: 442 [2019-01-12 14:46:48,755 INFO L226 Difference]: Without dead ends: 268 [2019-01-12 14:46:48,756 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:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-12 14:46:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-01-12 14:46:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-01-12 14:46:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2019-01-12 14:46:48,804 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 31 [2019-01-12 14:46:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:48,807 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2019-01-12 14:46:48,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2019-01-12 14:46:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:46:48,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:48,812 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:48,812 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1930053038, now seen corresponding path program 1 times [2019-01-12 14:46:48,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:48,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:48,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:49,542 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:49,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:49 BoogieIcfgContainer [2019-01-12 14:46:49,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:49,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:49,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:49,700 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:49,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:44" (3/4) ... [2019-01-12 14:46:49,705 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:49,863 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:49,864 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:49,864 INFO L168 Benchmark]: Toolchain (without parser) took 7930.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -54.9 MB). Peak memory consumption was 138.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,866 INFO L168 Benchmark]: CDTParser took 0.18 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:49,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:49,868 INFO L168 Benchmark]: Boogie Preprocessor took 50.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,870 INFO L168 Benchmark]: RCFGBuilder took 1555.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,871 INFO L168 Benchmark]: TraceAbstraction took 5418.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -3.0 MB). Peak memory consumption was 77.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,878 INFO L168 Benchmark]: Witness Printer took 164.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:49,880 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.18 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 659.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1555.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5418.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -3.0 MB). Peak memory consumption was 77.7 MB. Max. memory is 11.5 GB. * Witness Printer took 164.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 383]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L158] int pumpRunning = 0; [L159] int systemActive = 1; [L458] int cleanupTimeShifts = 4; [L752] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L534] int retValue_acc ; [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L975] int retValue_acc ; [L978] retValue_acc = 1 [L979] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L541] tmp = valid_product() [L543] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L390] int splverifierCounter ; [L391] int tmp ; [L392] int tmp___0 ; [L393] int tmp___1 ; [L394] int tmp___2 ; [L397] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L399] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L401] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L407] tmp = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L66] COND TRUE waterLevel < 2 [L67] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L417] tmp___0 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L78] COND FALSE !(\read(methaneLevelCritical)) [L81] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L427] tmp___2 = __VERIFIER_nondet_int() [L429] COND TRUE \read(tmp___2) [L374] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L166] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND TRUE \read(systemActive) [L221] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L224] COND FALSE !(\read(pumpRunning)) [L195] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L198] COND TRUE ! pumpRunning [L318] int retValue_acc ; [L319] int tmp ; [L320] int tmp___0 ; [L128] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L131] COND FALSE !(waterLevel < 2) [L135] retValue_acc = 0 [L136] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L324] tmp = isHighWaterSensorDry() [L326] COND FALSE !(\read(tmp)) [L329] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L331] retValue_acc = tmp___0 [L332] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L200] tmp = isHighWaterLevel() [L202] COND TRUE \read(tmp) [L249] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L558] int tmp ; [L559] int tmp___0 ; [L87] int retValue_acc ; [L90] retValue_acc = methaneLevelCritical [L91] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L563] tmp = isMethaneLevelCritical() [L565] COND TRUE \read(tmp) [L273] int retValue_acc ; [L276] retValue_acc = pumpRunning [L277] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L567] tmp___0 = isPumpRunning() [L569] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L383] __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, 119 locations, 3 error locations. UNSAFE Result, 5.3s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 875 SDtfs, 1177 SDslu, 1132 SDs, 0 SdLazy, 149 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 734 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10056 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...