./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product53.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec1_product53.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 c24c1e7ee4ec00cdeabebf427b1fca35e12bb483 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-30f4e4a [2019-11-28 00:20:24,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:24,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:24,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:24,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:24,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:24,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:24,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:24,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:24,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:24,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:24,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:24,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:24,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:24,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:24,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:24,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:24,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:24,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:24,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:24,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:24,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:24,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:24,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:24,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:24,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:24,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:24,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:24,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:24,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:24,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:24,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:24,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:24,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:24,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:24,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:24,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:24,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:24,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:24,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:24,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:24,605 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:20:24,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:24,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:24,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:24,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:24,623 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:24,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:24,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:24,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:24,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:24,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:24,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:24,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:24,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:24,625 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:24,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:24,626 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:24,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:24,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:24,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:24,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:24,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:24,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:24,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:24,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:24,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:24,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:24,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:24,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:24,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> c24c1e7ee4ec00cdeabebf427b1fca35e12bb483 [2019-11-28 00:20:24,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:24,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:24,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:24,979 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:24,980 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:24,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product53.cil.c [2019-11-28 00:20:25,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c7b7acc/af685293adbb4c91b1d583bac18ce8ba/FLAG9ca57d179 [2019-11-28 00:20:25,561 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:25,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product53.cil.c [2019-11-28 00:20:25,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c7b7acc/af685293adbb4c91b1d583bac18ce8ba/FLAG9ca57d179 [2019-11-28 00:20:25,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c7b7acc/af685293adbb4c91b1d583bac18ce8ba [2019-11-28 00:20:25,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:25,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:25,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:25,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:25,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:25,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:25, skipping insertion in model container [2019-11-28 00:20:25,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:25" (1/1) ... [2019-11-28 00:20:25,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:25,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:26,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:26,399 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:26,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:26,540 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:26,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26 WrapperNode [2019-11-28 00:20:26,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:26,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:26,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:26,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:26,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:26,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:26,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:26,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:26,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:26,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:26,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:26,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:26,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (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-11-28 00:20:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:26,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:28,045 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:28,045 INFO L297 CfgBuilder]: Removed 276 assume(true) statements. [2019-11-28 00:20:28,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:28 BoogieIcfgContainer [2019-11-28 00:20:28,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:28,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:28,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:28,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:28,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:25" (1/3) ... [2019-11-28 00:20:28,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4480b8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:28, skipping insertion in model container [2019-11-28 00:20:28,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (2/3) ... [2019-11-28 00:20:28,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4480b8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:28, skipping insertion in model container [2019-11-28 00:20:28,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:28" (3/3) ... [2019-11-28 00:20:28,065 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product53.cil.c [2019-11-28 00:20:28,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:28,085 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:28,099 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:28,137 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:28,137 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:28,137 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:28,137 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:28,137 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:28,138 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:28,138 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:28,138 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2019-11-28 00:20:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:28,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:28,170 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2002794138, now seen corresponding path program 1 times [2019-11-28 00:20:28,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396677200] [2019-11-28 00:20:28,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:28,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396677200] [2019-11-28 00:20:28,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:28,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390103538] [2019-11-28 00:20:28,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:28,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:28,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:28,480 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 2 states. [2019-11-28 00:20:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,539 INFO L93 Difference]: Finished difference Result 372 states and 569 transitions. [2019-11-28 00:20:28,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:28,542 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,558 INFO L225 Difference]: With dead ends: 372 [2019-11-28 00:20:28,558 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 00:20:28,562 INFO L630 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-11-28 00:20:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 00:20:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-11-28 00:20:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-28 00:20:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 276 transitions. [2019-11-28 00:20:28,616 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 276 transitions. Word has length 16 [2019-11-28 00:20:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,617 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 276 transitions. [2019-11-28 00:20:28,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2019-11-28 00:20:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:28,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:28,620 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,621 INFO L82 PathProgramCache]: Analyzing trace with hash 956037241, now seen corresponding path program 1 times [2019-11-28 00:20:28,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405095986] [2019-11-28 00:20:28,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:28,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405095986] [2019-11-28 00:20:28,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:28,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772029332] [2019-11-28 00:20:28,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:28,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:28,785 INFO L87 Difference]: Start difference. First operand 185 states and 276 transitions. Second operand 3 states. [2019-11-28 00:20:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,824 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2019-11-28 00:20:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:28,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,831 INFO L225 Difference]: With dead ends: 185 [2019-11-28 00:20:28,831 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:20:28,833 INFO L630 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-11-28 00:20:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:20:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:20:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:20:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2019-11-28 00:20:28,851 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 17 [2019-11-28 00:20:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,853 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2019-11-28 00:20:28,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2019-11-28 00:20:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:28,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,857 INFO L410 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-11-28 00:20:28,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash 748559286, now seen corresponding path program 1 times [2019-11-28 00:20:28,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083494281] [2019-11-28 00:20:28,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083494281] [2019-11-28 00:20:29,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:29,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278045361] [2019-11-28 00:20:29,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:29,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:29,054 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand 6 states. [2019-11-28 00:20:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,174 INFO L93 Difference]: Finished difference Result 136 states and 204 transitions. [2019-11-28 00:20:29,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:20:29,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 00:20:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,177 INFO L225 Difference]: With dead ends: 136 [2019-11-28 00:20:29,177 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:20:29,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:20:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:20:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:20:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:20:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2019-11-28 00:20:29,193 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 22 [2019-11-28 00:20:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,195 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2019-11-28 00:20:29,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2019-11-28 00:20:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:29,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,197 INFO L410 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-11-28 00:20:29,198 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,198 INFO L82 PathProgramCache]: Analyzing trace with hash -682519882, now seen corresponding path program 1 times [2019-11-28 00:20:29,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955012770] [2019-11-28 00:20:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955012770] [2019-11-28 00:20:29,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:29,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697009308] [2019-11-28 00:20:29,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:29,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:29,342 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2019-11-28 00:20:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,405 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2019-11-28 00:20:29,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:29,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:20:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,408 INFO L225 Difference]: With dead ends: 145 [2019-11-28 00:20:29,408 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:20:29,409 INFO L630 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-11-28 00:20:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:20:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-28 00:20:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 00:20:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2019-11-28 00:20:29,429 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 25 [2019-11-28 00:20:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,430 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2019-11-28 00:20:29,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2019-11-28 00:20:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:29,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,434 INFO L410 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-11-28 00:20:29,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1459548505, now seen corresponding path program 1 times [2019-11-28 00:20:29,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70932817] [2019-11-28 00:20:29,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70932817] [2019-11-28 00:20:29,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:29,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160669868] [2019-11-28 00:20:29,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:29,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:29,538 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand 5 states. [2019-11-28 00:20:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,649 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2019-11-28 00:20:29,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:29,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,653 INFO L225 Difference]: With dead ends: 204 [2019-11-28 00:20:29,653 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 00:20:29,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:20:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 00:20:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2019-11-28 00:20:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 00:20:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2019-11-28 00:20:29,665 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 31 [2019-11-28 00:20:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,666 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2019-11-28 00:20:29,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2019-11-28 00:20:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:29,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,668 INFO L410 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-11-28 00:20:29,668 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1202962538, now seen corresponding path program 1 times [2019-11-28 00:20:29,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012143775] [2019-11-28 00:20:29,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012143775] [2019-11-28 00:20:29,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:29,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368415381] [2019-11-28 00:20:29,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:29,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:29,747 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 5 states. [2019-11-28 00:20:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,865 INFO L93 Difference]: Finished difference Result 431 states and 600 transitions. [2019-11-28 00:20:29,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:29,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,868 INFO L225 Difference]: With dead ends: 431 [2019-11-28 00:20:29,868 INFO L226 Difference]: Without dead ends: 350 [2019-11-28 00:20:29,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-28 00:20:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 162. [2019-11-28 00:20:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-28 00:20:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 221 transitions. [2019-11-28 00:20:29,906 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 221 transitions. Word has length 31 [2019-11-28 00:20:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,907 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 221 transitions. [2019-11-28 00:20:29,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 221 transitions. [2019-11-28 00:20:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:29,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,914 INFO L410 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-11-28 00:20:29,917 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash 552949620, now seen corresponding path program 1 times [2019-11-28 00:20:29,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686916579] [2019-11-28 00:20:29,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686916579] [2019-11-28 00:20:29,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:30,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095240555] [2019-11-28 00:20:30,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:30,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:30,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:30,001 INFO L87 Difference]: Start difference. First operand 162 states and 221 transitions. Second operand 5 states. [2019-11-28 00:20:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,168 INFO L93 Difference]: Finished difference Result 470 states and 642 transitions. [2019-11-28 00:20:30,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:30,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:20:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,172 INFO L225 Difference]: With dead ends: 470 [2019-11-28 00:20:30,172 INFO L226 Difference]: Without dead ends: 468 [2019-11-28 00:20:30,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-28 00:20:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 162. [2019-11-28 00:20:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-28 00:20:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 220 transitions. [2019-11-28 00:20:30,190 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 220 transitions. Word has length 32 [2019-11-28 00:20:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,191 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 220 transitions. [2019-11-28 00:20:30,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 220 transitions. [2019-11-28 00:20:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:30,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,193 INFO L410 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-11-28 00:20:30,193 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1792378863, now seen corresponding path program 1 times [2019-11-28 00:20:30,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988844108] [2019-11-28 00:20:30,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:30,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988844108] [2019-11-28 00:20:30,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:20:30,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407825685] [2019-11-28 00:20:30,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:30,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:30,257 INFO L87 Difference]: Start difference. First operand 162 states and 220 transitions. Second operand 6 states. [2019-11-28 00:20:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,393 INFO L93 Difference]: Finished difference Result 428 states and 574 transitions. [2019-11-28 00:20:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:20:30,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 00:20:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,395 INFO L225 Difference]: With dead ends: 428 [2019-11-28 00:20:30,395 INFO L226 Difference]: Without dead ends: 272 [2019-11-28 00:20:30,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:20:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-28 00:20:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 174. [2019-11-28 00:20:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-28 00:20:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2019-11-28 00:20:30,442 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 32 [2019-11-28 00:20:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,442 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2019-11-28 00:20:30,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2019-11-28 00:20:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:30,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,443 INFO L410 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-11-28 00:20:30,444 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2050544301, now seen corresponding path program 1 times [2019-11-28 00:20:30,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027230320] [2019-11-28 00:20:30,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:30,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027230320] [2019-11-28 00:20:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344711332] [2019-11-28 00:20:30,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:30,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:30,491 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand 3 states. [2019-11-28 00:20:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,529 INFO L93 Difference]: Finished difference Result 394 states and 524 transitions. [2019-11-28 00:20:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:30,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 00:20:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,531 INFO L225 Difference]: With dead ends: 394 [2019-11-28 00:20:30,531 INFO L226 Difference]: Without dead ends: 226 [2019-11-28 00:20:30,531 INFO L630 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-11-28 00:20:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-28 00:20:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-11-28 00:20:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-28 00:20:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2019-11-28 00:20:30,550 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 32 [2019-11-28 00:20:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,551 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2019-11-28 00:20:30,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2019-11-28 00:20:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:30,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:30,552 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash 979497771, now seen corresponding path program 1 times [2019-11-28 00:20:30,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346871015] [2019-11-28 00:20:30,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:30,790 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:30,791 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:30,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:30 BoogieIcfgContainer [2019-11-28 00:20:30,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:30,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:30,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:30,950 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:30,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:28" (3/4) ... [2019-11-28 00:20:30,954 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:31,081 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:31,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:31,084 INFO L168 Benchmark]: Toolchain (without parser) took 5233.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,085 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:31,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 689.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.57 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-11-28 00:20:31,086 INFO L168 Benchmark]: Boogie Preprocessor took 65.76 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,087 INFO L168 Benchmark]: RCFGBuilder took 1344.80 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: 79.4 MB). Peak memory consumption was 79.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,088 INFO L168 Benchmark]: TraceAbstraction took 2898.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -127.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:31,088 INFO L168 Benchmark]: Witness Printer took 131.72 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.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,091 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 689.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.57 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 65.76 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1344.80 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: 79.4 MB). Peak memory consumption was 79.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2898.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -127.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 131.72 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.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 73]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L247] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L444] int cleanupTimeShifts = 4; [L554] int pumpRunning = 0; [L555] int systemActive = 1; [L878] int waterLevel = 1; [L879] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L525] int retValue_acc ; [L526] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L868] int retValue_acc ; [L871] retValue_acc = 1 [L872] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L532] tmp = valid_product() [L534] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] int splverifierCounter ; [L779] int tmp ; [L780] int tmp___0 ; [L781] int tmp___1 ; [L782] int tmp___2 ; [L785] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L787] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L789] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L795] tmp = __VERIFIER_nondet_int() [L797] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L896] COND TRUE waterLevel < 2 [L897] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L805] tmp___0 = __VERIFIER_nondet_int() [L807] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L908] COND FALSE !(\read(methaneLevelCritical)) [L911] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L815] tmp___2 = __VERIFIER_nondet_int() [L817] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L561] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L568] COND TRUE \read(systemActive) [L642] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L645] COND FALSE !(\read(pumpRunning)) [L616] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L619] COND FALSE !(\read(pumpRunning)) [L590] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L593] COND TRUE ! pumpRunning [L739] int retValue_acc ; [L740] int tmp ; [L741] int tmp___0 ; [L958] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L961] COND FALSE !(waterLevel < 2) [L965] retValue_acc = 0 [L966] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L745] tmp = isHighWaterSensorDry() [L747] COND FALSE !(\read(tmp)) [L750] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L752] retValue_acc = tmp___0 [L753] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L595] tmp = isHighWaterLevel() [L597] COND TRUE \read(tmp) [L670] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L917] int retValue_acc ; [L920] retValue_acc = methaneLevelCritical [L921] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = isMethaneLevelCritical() [L51] COND TRUE \read(tmp) [L694] int retValue_acc ; [L697] retValue_acc = pumpRunning [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L73] __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, 189 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1135 SDtfs, 1663 SDslu, 1257 SDs, 0 SdLazy, 203 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 639 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 13180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...