./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product56.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_product56.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 3236d89cedc127e9d85364eeaf0ba1493a1eae64 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:25,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:25,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:25,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:25,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:25,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:25,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:25,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:25,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:25,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:25,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:25,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:25,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:25,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:25,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:25,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:25,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:25,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:25,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:25,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:25,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:25,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:25,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:25,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:25,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:25,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:25,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:25,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:25,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:25,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:25,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:25,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:25,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:25,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:25,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:25,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:25,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:25,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:25,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:25,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:25,338 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:25,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:25,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:25,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:25,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:25,360 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:25,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:25,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:25,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:25,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:25,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:25,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:25,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:25,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:25,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:25,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:25,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:25,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:25,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:25,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:25,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:25,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:25,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:25,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:25,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:25,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:25,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:25,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:25,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:25,367 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 -> 3236d89cedc127e9d85364eeaf0ba1493a1eae64 [2019-11-28 00:20:25,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:25,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:25,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:25,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:25,704 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:25,705 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c [2019-11-28 00:20:25,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecec44de0/273808baea2246f5832e01f09055410e/FLAGf70aa5b05 [2019-11-28 00:20:26,282 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:26,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product56.cil.c [2019-11-28 00:20:26,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecec44de0/273808baea2246f5832e01f09055410e/FLAGf70aa5b05 [2019-11-28 00:20:26,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecec44de0/273808baea2246f5832e01f09055410e [2019-11-28 00:20:26,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:26,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:26,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:26,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:26,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:26,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7539c191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26, skipping insertion in model container [2019-11-28 00:20:26,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:26,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:27,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:27,115 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:27,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:27,311 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:27,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:27 WrapperNode [2019-11-28 00:20:27,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:27,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:27,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:27,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:27,322 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:27" (1/1) ... [2019-11-28 00:20:27,341 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:27" (1/1) ... [2019-11-28 00:20:27,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:27,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:27,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:27,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:27,422 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:27" (1/1) ... [2019-11-28 00:20:27,422 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:27" (1/1) ... [2019-11-28 00:20:27,429 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:27" (1/1) ... [2019-11-28 00:20:27,430 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:27" (1/1) ... [2019-11-28 00:20:27,448 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:27" (1/1) ... [2019-11-28 00:20:27,467 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:27" (1/1) ... [2019-11-28 00:20:27,473 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:27" (1/1) ... [2019-11-28 00:20:27,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:27,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:27,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:27,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:27,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:27" (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:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:27,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:28,698 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:28,698 INFO L297 CfgBuilder]: Removed 282 assume(true) statements. [2019-11-28 00:20:28,700 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,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:28,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:28,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:28,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:28,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:26" (1/3) ... [2019-11-28 00:20:28,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287ace1c 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,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:27" (2/3) ... [2019-11-28 00:20:28,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287ace1c 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,707 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,708 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product56.cil.c [2019-11-28 00:20:28,718 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:28,726 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:28,737 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:28,771 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:28,771 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:28,771 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:28,772 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:28,772 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:28,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:28,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:28,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-11-28 00:20:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:28,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,814 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,814 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1937289636, now seen corresponding path program 1 times [2019-11-28 00:20:28,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654964576] [2019-11-28 00:20:28,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,110 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,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654964576] [2019-11-28 00:20:29,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:29,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568209351] [2019-11-28 00:20:29,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:29,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:29,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:29,134 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2019-11-28 00:20:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,182 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2019-11-28 00:20:29,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:29,183 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,197 INFO L225 Difference]: With dead ends: 376 [2019-11-28 00:20:29,197 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 00:20:29,202 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:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 00:20:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-11-28 00:20:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-28 00:20:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2019-11-28 00:20:29,257 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2019-11-28 00:20:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,258 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2019-11-28 00:20:29,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2019-11-28 00:20:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:29,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,260 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:29,260 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash 890532739, now seen corresponding path program 1 times [2019-11-28 00:20:29,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179215578] [2019-11-28 00:20:29,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,364 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,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179215578] [2019-11-28 00:20:29,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:29,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870883143] [2019-11-28 00:20:29,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:29,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:29,372 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2019-11-28 00:20:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,406 INFO L93 Difference]: Finished difference Result 187 states and 279 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 17 [2019-11-28 00:20:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,408 INFO L225 Difference]: With dead ends: 187 [2019-11-28 00:20:29,408 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 00:20:29,411 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:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 00:20:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 00:20:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 00:20:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2019-11-28 00:20:29,426 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2019-11-28 00:20:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,428 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2019-11-28 00:20:29,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2019-11-28 00:20:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:29,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,431 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:29,431 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1577730230, now seen corresponding path program 1 times [2019-11-28 00:20:29,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785364814] [2019-11-28 00:20:29,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,597 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,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785364814] [2019-11-28 00:20:29,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:29,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72776044] [2019-11-28 00:20:29,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:29,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:29,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:29,600 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2019-11-28 00:20:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,645 INFO L93 Difference]: Finished difference Result 207 states and 312 transitions. [2019-11-28 00:20:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:29,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:20:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,648 INFO L225 Difference]: With dead ends: 207 [2019-11-28 00:20:29,648 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 00:20:29,649 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:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 00:20:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2019-11-28 00:20:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 00:20:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2019-11-28 00:20:29,663 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 22 [2019-11-28 00:20:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,664 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2019-11-28 00:20:29,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2019-11-28 00:20:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:29,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,666 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,666 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,666 INFO L82 PathProgramCache]: Analyzing trace with hash 792163456, now seen corresponding path program 1 times [2019-11-28 00:20:29,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526079056] [2019-11-28 00:20:29,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,777 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,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526079056] [2019-11-28 00:20:29,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:29,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64081300] [2019-11-28 00:20:29,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:29,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:29,781 INFO L87 Difference]: Start difference. First operand 136 states and 205 transitions. Second operand 3 states. [2019-11-28 00:20:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,854 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2019-11-28 00:20:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:29,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:20:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,857 INFO L225 Difference]: With dead ends: 283 [2019-11-28 00:20:29,857 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 00:20:29,858 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,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 00:20:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-11-28 00:20:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-28 00:20:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2019-11-28 00:20:29,873 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 25 [2019-11-28 00:20:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,874 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2019-11-28 00:20:29,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2019-11-28 00:20:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:29,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,876 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,876 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1022954699, now seen corresponding path program 1 times [2019-11-28 00:20:29,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535000811] [2019-11-28 00:20:29,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,962 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,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535000811] [2019-11-28 00:20:29,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:29,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57024307] [2019-11-28 00:20:29,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:29,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:29,965 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 5 states. [2019-11-28 00:20:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,103 INFO L93 Difference]: Finished difference Result 763 states and 1120 transitions. [2019-11-28 00:20:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:30,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:20:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,108 INFO L225 Difference]: With dead ends: 763 [2019-11-28 00:20:30,108 INFO L226 Difference]: Without dead ends: 618 [2019-11-28 00:20:30,109 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,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-28 00:20:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 286. [2019-11-28 00:20:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-28 00:20:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 411 transitions. [2019-11-28 00:20:30,141 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 411 transitions. Word has length 25 [2019-11-28 00:20:30,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,141 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 411 transitions. [2019-11-28 00:20:30,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 411 transitions. [2019-11-28 00:20:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:20:30,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,144 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] [2019-11-28 00:20:30,144 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash 819147605, now seen corresponding path program 1 times [2019-11-28 00:20:30,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147274845] [2019-11-28 00:20:30,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,213 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,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147274845] [2019-11-28 00:20:30,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:30,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141831650] [2019-11-28 00:20:30,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:30,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:30,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:30,217 INFO L87 Difference]: Start difference. First operand 286 states and 411 transitions. Second operand 5 states. [2019-11-28 00:20:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,424 INFO L93 Difference]: Finished difference Result 832 states and 1198 transitions. [2019-11-28 00:20:30,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:30,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:20:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,430 INFO L225 Difference]: With dead ends: 832 [2019-11-28 00:20:30,430 INFO L226 Difference]: Without dead ends: 830 [2019-11-28 00:20:30,431 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,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-11-28 00:20:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 286. [2019-11-28 00:20:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-28 00:20:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 409 transitions. [2019-11-28 00:20:30,458 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 409 transitions. Word has length 26 [2019-11-28 00:20:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,459 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 409 transitions. [2019-11-28 00:20:30,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 409 transitions. [2019-11-28 00:20:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:30,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,461 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,462 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1010263109, now seen corresponding path program 1 times [2019-11-28 00:20:30,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119056732] [2019-11-28 00:20:30,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,523 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,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119056732] [2019-11-28 00:20:30,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:30,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902343693] [2019-11-28 00:20:30,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:30,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:30,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:30,526 INFO L87 Difference]: Start difference. First operand 286 states and 409 transitions. Second operand 5 states. [2019-11-28 00:20:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,644 INFO L93 Difference]: Finished difference Result 766 states and 1076 transitions. [2019-11-28 00:20:30,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:30,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:20:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,649 INFO L225 Difference]: With dead ends: 766 [2019-11-28 00:20:30,649 INFO L226 Difference]: Without dead ends: 486 [2019-11-28 00:20:30,650 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:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-11-28 00:20:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 322. [2019-11-28 00:20:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-28 00:20:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 445 transitions. [2019-11-28 00:20:30,677 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 445 transitions. Word has length 32 [2019-11-28 00:20:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,678 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 445 transitions. [2019-11-28 00:20:30,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 445 transitions. [2019-11-28 00:20:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:30,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,680 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,680 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1403290119, now seen corresponding path program 1 times [2019-11-28 00:20:30,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577479023] [2019-11-28 00:20:30,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,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:30,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577479023] [2019-11-28 00:20:30,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:30,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660798233] [2019-11-28 00:20:30,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:30,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:30,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:30,777 INFO L87 Difference]: Start difference. First operand 322 states and 445 transitions. Second operand 5 states. [2019-11-28 00:20:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,967 INFO L93 Difference]: Finished difference Result 882 states and 1193 transitions. [2019-11-28 00:20:30,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:30,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:20:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,971 INFO L225 Difference]: With dead ends: 882 [2019-11-28 00:20:30,971 INFO L226 Difference]: Without dead ends: 566 [2019-11-28 00:20:30,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-28 00:20:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 346. [2019-11-28 00:20:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-28 00:20:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 469 transitions. [2019-11-28 00:20:30,999 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 469 transitions. Word has length 32 [2019-11-28 00:20:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,999 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 469 transitions. [2019-11-28 00:20:30,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 469 transitions. [2019-11-28 00:20:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:31,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:31,000 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:31,001 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1145124681, now seen corresponding path program 1 times [2019-11-28 00:20:31,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:31,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213061067] [2019-11-28 00:20:31,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:31,047 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:31,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213061067] [2019-11-28 00:20:31,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:31,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:31,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567819516] [2019-11-28 00:20:31,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:31,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:31,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:31,049 INFO L87 Difference]: Start difference. First operand 346 states and 469 transitions. Second operand 3 states. [2019-11-28 00:20:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:31,107 INFO L93 Difference]: Finished difference Result 794 states and 1070 transitions. [2019-11-28 00:20:31,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:31,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 00:20:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:31,111 INFO L225 Difference]: With dead ends: 794 [2019-11-28 00:20:31,111 INFO L226 Difference]: Without dead ends: 454 [2019-11-28 00:20:31,112 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:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-28 00:20:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2019-11-28 00:20:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-11-28 00:20:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 599 transitions. [2019-11-28 00:20:31,146 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 599 transitions. Word has length 32 [2019-11-28 00:20:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:31,148 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 599 transitions. [2019-11-28 00:20:31,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 599 transitions. [2019-11-28 00:20:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:31,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:31,151 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:31,151 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:31,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2078796085, now seen corresponding path program 1 times [2019-11-28 00:20:31,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:31,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982942879] [2019-11-28 00:20:31,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:31,342 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:31,342 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:31,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:31 BoogieIcfgContainer [2019-11-28 00:20:31,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:31,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:31,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:31,464 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:31,465 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:31,467 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:31,568 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:31,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:31,571 INFO L168 Benchmark]: Toolchain (without parser) took 4964.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -126.5 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,571 INFO L168 Benchmark]: CDTParser took 0.26 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,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -152.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:31,573 INFO L168 Benchmark]: Boogie Preprocessor took 73.67 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,573 INFO L168 Benchmark]: RCFGBuilder took 1208.50 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: 82.6 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,574 INFO L168 Benchmark]: TraceAbstraction took 2762.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -78.6 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,574 INFO L168 Benchmark]: Witness Printer took 103.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,578 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.26 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 705.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -152.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.67 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1208.50 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: 82.6 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2762.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -78.6 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Witness Printer took 103.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 806]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L490] int pumpRunning = 0; [L491] int systemActive = 1; [L811] int cleanupTimeShifts = 4; [L908] int waterLevel = 1; [L909] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L884] int retValue_acc ; [L885] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L766] int retValue_acc ; [L769] retValue_acc = 1 [L770] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L891] tmp = valid_product() [L893] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L413] int splverifierCounter ; [L414] int tmp ; [L415] int tmp___0 ; [L416] int tmp___1 ; [L417] int tmp___2 ; [L420] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L424] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L430] tmp = __VERIFIER_nondet_int() [L432] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L926] COND TRUE waterLevel < 2 [L927] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L440] tmp___0 = __VERIFIER_nondet_int() [L442] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L938] COND FALSE !(\read(methaneLevelCritical)) [L941] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L450] tmp___2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp___2) [L732] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L498] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L505] COND TRUE \read(systemActive) [L579] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L582] COND FALSE !(\read(pumpRunning)) [L553] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L556] COND FALSE !(\read(pumpRunning)) [L527] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L530] COND TRUE ! pumpRunning [L676] int retValue_acc ; [L677] int tmp ; [L678] int tmp___0 ; [L988] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L991] COND FALSE !(waterLevel < 2) [L995] retValue_acc = 0 [L996] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L682] tmp = isHighWaterSensorDry() [L684] COND FALSE !(\read(tmp)) [L687] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L689] retValue_acc = tmp___0 [L690] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L532] tmp = isHighWaterLevel() [L534] COND TRUE \read(tmp) [L607] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L777] int tmp ; [L778] int tmp___0 ; [L947] int retValue_acc ; [L950] retValue_acc = methaneLevelCritical [L951] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L782] tmp = isMethaneLevelCritical() [L784] COND TRUE \read(tmp) [L631] int retValue_acc ; [L634] retValue_acc = pumpRunning [L635] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L786] tmp___0 = isPumpRunning() [L788] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L806] __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, 191 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1184 SDtfs, 1469 SDslu, 1535 SDs, 0 SdLazy, 215 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=454occurred 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, 1266 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 10538 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...