./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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_product34.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 45e9be5ff3d2c5f3e04037cd81f89ba3fcf7e541 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 17:24:20,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:20,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:20,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:20,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:20,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:20,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:20,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:20,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:20,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:20,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:20,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:20,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:20,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:20,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:20,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:20,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:20,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:20,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:20,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:20,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:20,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:20,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:20,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:20,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:20,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:20,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:20,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:20,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:20,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:20,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:20,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:20,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:20,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:20,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:20,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:20,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:20,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:20,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:20,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:20,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:20,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:24:20,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:20,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:20,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:20,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:20,241 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:20,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:20,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:20,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:20,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:20,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:20,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:20,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:20,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:20,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:20,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:20,244 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:20,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:20,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:20,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:20,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:20,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:20,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:20,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:20,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:20,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:20,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:20,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:20,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:20,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:20,247 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 -> 45e9be5ff3d2c5f3e04037cd81f89ba3fcf7e541 [2019-11-28 17:24:20,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:20,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:20,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:20,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:20,589 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:20,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c [2019-11-28 17:24:20,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b5780b9/77f1bddf84ba4aab9572bf3fa494a1f4/FLAG7d372bc35 [2019-11-28 17:24:21,124 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:21,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c [2019-11-28 17:24:21,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b5780b9/77f1bddf84ba4aab9572bf3fa494a1f4/FLAG7d372bc35 [2019-11-28 17:24:21,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b5780b9/77f1bddf84ba4aab9572bf3fa494a1f4 [2019-11-28 17:24:21,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:21,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:21,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:21,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:21,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:21,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:21" (1/1) ... [2019-11-28 17:24:21,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a736f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:21, skipping insertion in model container [2019-11-28 17:24:21,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:21" (1/1) ... [2019-11-28 17:24:21,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:21,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:22,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:22,029 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:22,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:22,177 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:22,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22 WrapperNode [2019-11-28 17:24:22,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:22,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:22,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:22,179 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:22,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:22,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:22,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:22,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:22,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (1/1) ... [2019-11-28 17:24:22,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:22,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:22,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:22,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:22,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (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 17:24:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:22,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:23,120 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:23,120 INFO L287 CfgBuilder]: Removed 98 assume(true) statements. [2019-11-28 17:24:23,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:23 BoogieIcfgContainer [2019-11-28 17:24:23,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:23,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:23,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:23,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:23,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:21" (1/3) ... [2019-11-28 17:24:23,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660224d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:23, skipping insertion in model container [2019-11-28 17:24:23,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:22" (2/3) ... [2019-11-28 17:24:23,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660224d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:23, skipping insertion in model container [2019-11-28 17:24:23,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:23" (3/3) ... [2019-11-28 17:24:23,131 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product34.cil.c [2019-11-28 17:24:23,142 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:23,150 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:23,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:23,186 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:23,186 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:23,186 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:23,186 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:23,187 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:23,187 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:23,187 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:23,187 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-28 17:24:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:23,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:23,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:23,212 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1424204181, now seen corresponding path program 1 times [2019-11-28 17:24:23,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:23,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116799824] [2019-11-28 17:24:23,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:23,513 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 17:24:23,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116799824] [2019-11-28 17:24:23,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:23,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:23,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082747624] [2019-11-28 17:24:23,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:23,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:23,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:23,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:23,543 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-28 17:24:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:23,576 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-11-28 17:24:23,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:23,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:23,590 INFO L225 Difference]: With dead ends: 150 [2019-11-28 17:24:23,591 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 17:24:23,595 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 17:24:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 17:24:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 17:24:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 17:24:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-11-28 17:24:23,643 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-11-28 17:24:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:23,643 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-11-28 17:24:23,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-11-28 17:24:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:23,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:23,646 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 17:24:23,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:23,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:23,647 INFO L82 PathProgramCache]: Analyzing trace with hash -631654862, now seen corresponding path program 1 times [2019-11-28 17:24:23,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:23,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849796112] [2019-11-28 17:24:23,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:23,781 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 17:24:23,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849796112] [2019-11-28 17:24:23,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:23,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:23,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062796361] [2019-11-28 17:24:23,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:23,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:23,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:23,786 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-11-28 17:24:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:23,798 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-11-28 17:24:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:23,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:23,801 INFO L225 Difference]: With dead ends: 74 [2019-11-28 17:24:23,801 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 17:24:23,802 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 17:24:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 17:24:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 17:24:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:24:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-11-28 17:24:23,809 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-11-28 17:24:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:23,809 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-28 17:24:23,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-11-28 17:24:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:23,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:23,811 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 17:24:23,811 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -964945646, now seen corresponding path program 1 times [2019-11-28 17:24:23,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:23,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030866885] [2019-11-28 17:24:23,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:23,960 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 17:24:23,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030866885] [2019-11-28 17:24:23,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:23,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:23,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297711669] [2019-11-28 17:24:23,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:23,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:23,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:23,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:23,964 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2019-11-28 17:24:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,052 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-11-28 17:24:24,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:24:24,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 17:24:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,055 INFO L225 Difference]: With dead ends: 62 [2019-11-28 17:24:24,055 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 17:24:24,056 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 17:24:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 17:24:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 17:24:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:24:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-11-28 17:24:24,065 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-11-28 17:24:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:24,068 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-28 17:24:24,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-11-28 17:24:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:24:24,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:24,070 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] [2019-11-28 17:24:24,071 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash -952202930, now seen corresponding path program 1 times [2019-11-28 17:24:24,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:24,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550169573] [2019-11-28 17:24:24,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,163 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 17:24:24,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550169573] [2019-11-28 17:24:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:24,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874334839] [2019-11-28 17:24:24,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:24,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:24,166 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-11-28 17:24:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,192 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-11-28 17:24:24,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:24,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 17:24:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,194 INFO L225 Difference]: With dead ends: 83 [2019-11-28 17:24:24,194 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 17:24:24,195 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 17:24:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 17:24:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-28 17:24:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 17:24:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-11-28 17:24:24,205 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-11-28 17:24:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:24,205 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-11-28 17:24:24,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-11-28 17:24:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 17:24:24,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:24,207 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] [2019-11-28 17:24:24,207 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:24,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:24,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2049720417, now seen corresponding path program 1 times [2019-11-28 17:24:24,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:24,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309759479] [2019-11-28 17:24:24,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,302 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 17:24:24,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309759479] [2019-11-28 17:24:24,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:24,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793174016] [2019-11-28 17:24:24,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:24,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:24,305 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-11-28 17:24:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,390 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-11-28 17:24:24,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:24,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 17:24:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,394 INFO L225 Difference]: With dead ends: 139 [2019-11-28 17:24:24,395 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 17:24:24,399 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 17:24:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 17:24:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-11-28 17:24:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 17:24:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-11-28 17:24:24,416 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-11-28 17:24:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:24,418 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-11-28 17:24:24,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-11-28 17:24:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 17:24:24,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:24,421 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] [2019-11-28 17:24:24,421 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:24,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash 612790626, now seen corresponding path program 1 times [2019-11-28 17:24:24,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:24,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252002804] [2019-11-28 17:24:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,530 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 17:24:24,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252002804] [2019-11-28 17:24:24,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:24,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808213181] [2019-11-28 17:24:24,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:24,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:24,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:24,534 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2019-11-28 17:24:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,638 INFO L93 Difference]: Finished difference Result 270 states and 384 transitions. [2019-11-28 17:24:24,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:24,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 17:24:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,642 INFO L225 Difference]: With dead ends: 270 [2019-11-28 17:24:24,642 INFO L226 Difference]: Without dead ends: 220 [2019-11-28 17:24:24,643 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 17:24:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-28 17:24:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 100. [2019-11-28 17:24:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 17:24:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2019-11-28 17:24:24,662 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 29 [2019-11-28 17:24:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:24,663 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2019-11-28 17:24:24,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2019-11-28 17:24:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:24,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:24,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, 1, 1, 1, 1, 1] [2019-11-28 17:24:24,666 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:24,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1166654740, now seen corresponding path program 1 times [2019-11-28 17:24:24,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:24,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345870481] [2019-11-28 17:24:24,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,728 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 17:24:24,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345870481] [2019-11-28 17:24:24,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:24,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3818853] [2019-11-28 17:24:24,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:24,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:24,731 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 5 states. [2019-11-28 17:24:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,865 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2019-11-28 17:24:24,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:24,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,868 INFO L225 Difference]: With dead ends: 280 [2019-11-28 17:24:24,868 INFO L226 Difference]: Without dead ends: 278 [2019-11-28 17:24:24,869 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 17:24:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-28 17:24:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-11-28 17:24:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 17:24:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2019-11-28 17:24:24,889 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 30 [2019-11-28 17:24:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:24,889 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2019-11-28 17:24:24,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2019-11-28 17:24:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:24,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:24,891 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] [2019-11-28 17:24:24,892 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash 72774503, now seen corresponding path program 1 times [2019-11-28 17:24:24,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:24,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968908067] [2019-11-28 17:24:24,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:24,938 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 17:24:24,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968908067] [2019-11-28 17:24:24,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:24,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:24,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338639180] [2019-11-28 17:24:24,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:24:24,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:24:24,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:24:24,941 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 4 states. [2019-11-28 17:24:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:24,982 INFO L93 Difference]: Finished difference Result 240 states and 326 transitions. [2019-11-28 17:24:24,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:24:24,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 17:24:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:24,984 INFO L225 Difference]: With dead ends: 240 [2019-11-28 17:24:24,984 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 17:24:24,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 17:24:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-11-28 17:24:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 17:24:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 140 transitions. [2019-11-28 17:24:25,002 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 140 transitions. Word has length 30 [2019-11-28 17:24:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,003 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 140 transitions. [2019-11-28 17:24:25,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:24:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 140 transitions. [2019-11-28 17:24:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:25,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,005 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] [2019-11-28 17:24:25,006 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,006 INFO L82 PathProgramCache]: Analyzing trace with hash 330939941, now seen corresponding path program 1 times [2019-11-28 17:24:25,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096030573] [2019-11-28 17:24:25,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:25,053 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 17:24:25,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096030573] [2019-11-28 17:24:25,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:25,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:25,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386392850] [2019-11-28 17:24:25,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:25,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:25,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:25,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:25,056 INFO L87 Difference]: Start difference. First operand 104 states and 140 transitions. Second operand 3 states. [2019-11-28 17:24:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:25,089 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2019-11-28 17:24:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:25,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 17:24:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:25,091 INFO L225 Difference]: With dead ends: 250 [2019-11-28 17:24:25,091 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 17:24:25,092 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 17:24:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 17:24:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-28 17:24:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 17:24:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2019-11-28 17:24:25,109 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 30 [2019-11-28 17:24:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:25,109 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2019-11-28 17:24:25,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2019-11-28 17:24:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:25,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:25,111 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 17:24:25,111 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1676876253, now seen corresponding path program 1 times [2019-11-28 17:24:25,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:25,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600823056] [2019-11-28 17:24:25,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:25,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:25,285 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:25,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:25 BoogieIcfgContainer [2019-11-28 17:24:25,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:25,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:25,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:25,435 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:25,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:23" (3/4) ... [2019-11-28 17:24:25,438 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:25,547 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:25,548 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:25,553 INFO L168 Benchmark]: Toolchain (without parser) took 4048.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 837.8 MB in the end (delta: 123.9 MB). Peak memory consumption was 269.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:25,560 INFO L168 Benchmark]: CDTParser took 0.58 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 17:24:25,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:25,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:25,564 INFO L168 Benchmark]: Boogie Preprocessor took 38.58 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 17:24:25,565 INFO L168 Benchmark]: RCFGBuilder took 834.69 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: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:25,565 INFO L168 Benchmark]: TraceAbstraction took 2311.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 851.0 MB in the end (delta: 204.8 MB). Peak memory consumption was 204.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:25,566 INFO L168 Benchmark]: Witness Printer took 113.53 ms. Allocated memory is still 1.2 GB. Free memory was 851.0 MB in the beginning and 837.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:25,575 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.58 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 676.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 834.69 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: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2311.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 851.0 MB in the end (delta: 204.8 MB). Peak memory consumption was 204.8 MB. Max. memory is 11.5 GB. * Witness Printer took 113.53 ms. Allocated memory is still 1.2 GB. Free memory was 851.0 MB in the beginning and 837.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 514]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L313] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L524] int waterLevel = 1; [L525] int methaneLevelCritical = 0; [L689] int pumpRunning = 0; [L690] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L902] int retValue_acc ; [L905] retValue_acc = 1 [L906] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L620] int splverifierCounter ; [L621] int tmp ; [L622] int tmp___0 ; [L623] int tmp___1 ; [L624] int tmp___2 ; [L627] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L629] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L631] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L637] tmp = __VERIFIER_nondet_int() [L639] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L542] COND TRUE waterLevel < 2 [L543] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L647] tmp___0 = __VERIFIER_nondet_int() [L649] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L554] COND FALSE !(\read(methaneLevelCritical)) [L557] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L657] tmp___2 = __VERIFIER_nondet_int() [L659] COND TRUE \read(tmp___2) [L845] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L697] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L704] COND TRUE \read(systemActive) [L726] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L729] COND TRUE ! pumpRunning [L823] int retValue_acc ; [L824] int tmp ; [L825] int tmp___0 ; [L604] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L607] COND FALSE !(waterLevel < 2) [L611] retValue_acc = 0 [L612] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L829] tmp = isHighWaterSensorDry() [L831] COND FALSE !(\read(tmp)) [L834] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L836] retValue_acc = tmp___0 [L837] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L731] tmp = isHighWaterLevel() [L733] COND TRUE \read(tmp) [L754] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L851] int tmp ; [L852] int tmp___0 ; [L563] int retValue_acc ; [L566] retValue_acc = methaneLevelCritical [L567] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L856] tmp = isMethaneLevelCritical() [L858] COND TRUE \read(tmp) [L778] int retValue_acc ; [L781] retValue_acc = pumpRunning [L782] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L860] tmp___0 = isPumpRunning() [L862] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L514] __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, 78 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 577 SDtfs, 722 SDslu, 756 SDs, 0 SdLazy, 101 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 378 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 10827 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...