./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product49.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_product49.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 5f66ecd5f6aef5b29bc80dee4a57cabf0f421223 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:29,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:29,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:29,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:29,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:29,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:29,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:29,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:29,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:29,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:29,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:29,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:29,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:29,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:29,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:29,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:29,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:29,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:29,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:29,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:29,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:30,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:30,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:30,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:30,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:30,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:30,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:30,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:30,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:30,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:30,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:30,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:30,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:30,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:30,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:30,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:30,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:30,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:30,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:30,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:30,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:30,022 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:30,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:30,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:30,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:30,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:30,066 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:30,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:30,066 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:30,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:30,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:30,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:30,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:30,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:30,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:30,069 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:30,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:30,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:30,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:30,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:30,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:30,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:30,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:30,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:30,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:30,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:30,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:30,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:30,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:30,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:30,075 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:30,076 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 -> 5f66ecd5f6aef5b29bc80dee4a57cabf0f421223 [2019-11-28 17:24:30,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:30,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:30,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:30,377 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:30,378 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:30,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product49.cil.c [2019-11-28 17:24:30,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02daf0a7e/1ce7fa693a594551bd5dcd8b914bf453/FLAGce4f0eda4 [2019-11-28 17:24:30,988 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:30,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product49.cil.c [2019-11-28 17:24:31,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02daf0a7e/1ce7fa693a594551bd5dcd8b914bf453/FLAGce4f0eda4 [2019-11-28 17:24:31,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02daf0a7e/1ce7fa693a594551bd5dcd8b914bf453 [2019-11-28 17:24:31,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:31,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:31,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:31,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:31,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:31,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:31" (1/1) ... [2019-11-28 17:24:31,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ddb74a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:31, skipping insertion in model container [2019-11-28 17:24:31,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:31" (1/1) ... [2019-11-28 17:24:31,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:31,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:31,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:31,799 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:31,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:31,928 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:31,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:31 WrapperNode [2019-11-28 17:24:31,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:31,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:31,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:31,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:31,939 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:31" (1/1) ... [2019-11-28 17:24:31,962 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:31" (1/1) ... [2019-11-28 17:24:32,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:32,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:32,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:32,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:32,028 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:31" (1/1) ... [2019-11-28 17:24:32,028 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:31" (1/1) ... [2019-11-28 17:24:32,033 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:31" (1/1) ... [2019-11-28 17:24:32,034 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:31" (1/1) ... [2019-11-28 17:24:32,047 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:31" (1/1) ... [2019-11-28 17:24:32,057 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:31" (1/1) ... [2019-11-28 17:24:32,060 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:31" (1/1) ... [2019-11-28 17:24:32,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:32,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:32,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:32,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:32,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:31" (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:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:32,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:32,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:33,152 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:33,152 INFO L287 CfgBuilder]: Removed 156 assume(true) statements. [2019-11-28 17:24:33,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:33 BoogieIcfgContainer [2019-11-28 17:24:33,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:33,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:33,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:33,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:33,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:31" (1/3) ... [2019-11-28 17:24:33,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3c5e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:33, skipping insertion in model container [2019-11-28 17:24:33,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:31" (2/3) ... [2019-11-28 17:24:33,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3c5e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:33, skipping insertion in model container [2019-11-28 17:24:33,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:33" (3/3) ... [2019-11-28 17:24:33,163 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product49.cil.c [2019-11-28 17:24:33,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:33,187 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:33,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:33,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:33,224 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:33,224 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:33,224 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:33,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:33,225 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:33,225 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:33,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:33,246 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-11-28 17:24:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:33,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:33,254 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:33,255 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1641629540, now seen corresponding path program 1 times [2019-11-28 17:24:33,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:33,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631967603] [2019-11-28 17:24:33,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:33,509 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:33,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631967603] [2019-11-28 17:24:33,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:33,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:33,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924252584] [2019-11-28 17:24:33,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:33,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:33,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:33,537 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2019-11-28 17:24:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:33,575 INFO L93 Difference]: Finished difference Result 228 states and 347 transitions. [2019-11-28 17:24:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:33,576 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:33,590 INFO L225 Difference]: With dead ends: 228 [2019-11-28 17:24:33,590 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 17:24:33,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:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 17:24:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 17:24:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 17:24:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-11-28 17:24:33,642 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 16 [2019-11-28 17:24:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:33,643 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-11-28 17:24:33,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-11-28 17:24:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:33,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:33,645 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:33,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash 594872643, now seen corresponding path program 1 times [2019-11-28 17:24:33,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:33,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595724051] [2019-11-28 17:24:33,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:33,749 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:33,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595724051] [2019-11-28 17:24:33,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:33,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:33,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120601939] [2019-11-28 17:24:33,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:33,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:33,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:33,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:33,754 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 3 states. [2019-11-28 17:24:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:33,769 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2019-11-28 17:24:33,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:33,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:33,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:33,772 INFO L225 Difference]: With dead ends: 113 [2019-11-28 17:24:33,772 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:24:33,773 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:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:24:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:24:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:24:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 17:24:33,781 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 17:24:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:33,782 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 17:24:33,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 17:24:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:33,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:33,784 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:33,784 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:33,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:33,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1404483435, now seen corresponding path program 1 times [2019-11-28 17:24:33,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:33,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021806408] [2019-11-28 17:24:33,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:33,945 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:33,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021806408] [2019-11-28 17:24:33,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:33,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:33,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418151836] [2019-11-28 17:24:33,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:24:33,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:24:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:24:33,948 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 6 states. [2019-11-28 17:24:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:34,101 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-11-28 17:24:34,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:24:34,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 17:24:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:34,105 INFO L225 Difference]: With dead ends: 88 [2019-11-28 17:24:34,107 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:24:34,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:24:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:24:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:24:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:24:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-11-28 17:24:34,120 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 22 [2019-11-28 17:24:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,120 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-11-28 17:24:34,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:24:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-11-28 17:24:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:24:34,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,123 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] [2019-11-28 17:24:34,123 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -764351347, now seen corresponding path program 1 times [2019-11-28 17:24:34,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664319412] [2019-11-28 17:24:34,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,203 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:34,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664319412] [2019-11-28 17:24:34,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:34,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933675365] [2019-11-28 17:24:34,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:34,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:34,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:34,206 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2019-11-28 17:24:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:34,260 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2019-11-28 17:24:34,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:34,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:24:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:34,261 INFO L225 Difference]: With dead ends: 109 [2019-11-28 17:24:34,261 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:24:34,262 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:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:24:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 17:24:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:24:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-11-28 17:24:34,273 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 24 [2019-11-28 17:24:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,274 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-11-28 17:24:34,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-11-28 17:24:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:34,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,275 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:34,276 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,276 INFO L82 PathProgramCache]: Analyzing trace with hash -805303330, now seen corresponding path program 1 times [2019-11-28 17:24:34,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350191697] [2019-11-28 17:24:34,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:34,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350191697] [2019-11-28 17:24:34,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:34,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802085853] [2019-11-28 17:24:34,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:34,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:34,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:34,410 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 5 states. [2019-11-28 17:24:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:34,547 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2019-11-28 17:24:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:34,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:34,552 INFO L225 Difference]: With dead ends: 175 [2019-11-28 17:24:34,552 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 17:24:34,553 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:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 17:24:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-11-28 17:24:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 17:24:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-11-28 17:24:34,579 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 30 [2019-11-28 17:24:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,580 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-11-28 17:24:34,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-11-28 17:24:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:34,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,585 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:34,585 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1857207713, now seen corresponding path program 1 times [2019-11-28 17:24:34,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956325332] [2019-11-28 17:24:34,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,749 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:34,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956325332] [2019-11-28 17:24:34,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:34,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236238317] [2019-11-28 17:24:34,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:34,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:34,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:34,753 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 5 states. [2019-11-28 17:24:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:34,894 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2019-11-28 17:24:34,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:34,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 17:24:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:34,896 INFO L225 Difference]: With dead ends: 204 [2019-11-28 17:24:34,897 INFO L226 Difference]: Without dead ends: 202 [2019-11-28 17:24:34,898 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:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-28 17:24:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 72. [2019-11-28 17:24:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 17:24:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2019-11-28 17:24:34,911 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 30 [2019-11-28 17:24:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:34,911 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2019-11-28 17:24:34,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2019-11-28 17:24:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:34,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,913 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:34,914 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1198330340, now seen corresponding path program 1 times [2019-11-28 17:24:34,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227372654] [2019-11-28 17:24:34,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:34,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227372654] [2019-11-28 17:24:34,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:24:34,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906318082] [2019-11-28 17:24:34,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:24:35,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:24:35,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:24:35,000 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 6 states. [2019-11-28 17:24:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,115 INFO L93 Difference]: Finished difference Result 188 states and 256 transitions. [2019-11-28 17:24:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:24:35,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-28 17:24:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,117 INFO L225 Difference]: With dead ends: 188 [2019-11-28 17:24:35,117 INFO L226 Difference]: Without dead ends: 122 [2019-11-28 17:24:35,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:24:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-28 17:24:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 76. [2019-11-28 17:24:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 17:24:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2019-11-28 17:24:35,137 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 30 [2019-11-28 17:24:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,138 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2019-11-28 17:24:35,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:24:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2019-11-28 17:24:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:24:35,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,140 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:35,140 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash -940164902, now seen corresponding path program 1 times [2019-11-28 17:24:35,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564591460] [2019-11-28 17:24:35,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,197 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:35,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564591460] [2019-11-28 17:24:35,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:35,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154543893] [2019-11-28 17:24:35,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:35,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:35,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:35,200 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2019-11-28 17:24:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,231 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-11-28 17:24:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:35,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 17:24:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,233 INFO L225 Difference]: With dead ends: 172 [2019-11-28 17:24:35,233 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 17:24:35,235 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:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 17:24:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-28 17:24:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 17:24:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-11-28 17:24:35,258 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 30 [2019-11-28 17:24:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,259 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-11-28 17:24:35,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2019-11-28 17:24:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:35,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,263 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:35,263 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1346986200, now seen corresponding path program 1 times [2019-11-28 17:24:35,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427481295] [2019-11-28 17:24:35,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,366 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:35,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427481295] [2019-11-28 17:24:35,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:35,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036138575] [2019-11-28 17:24:35,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:35,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:35,369 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand 5 states. [2019-11-28 17:24:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,478 INFO L93 Difference]: Finished difference Result 553 states and 737 transitions. [2019-11-28 17:24:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:35,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:24:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,482 INFO L225 Difference]: With dead ends: 553 [2019-11-28 17:24:35,482 INFO L226 Difference]: Without dead ends: 457 [2019-11-28 17:24:35,483 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:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-28 17:24:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 190. [2019-11-28 17:24:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-28 17:24:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 248 transitions. [2019-11-28 17:24:35,509 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 248 transitions. Word has length 31 [2019-11-28 17:24:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,509 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 248 transitions. [2019-11-28 17:24:35,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 248 transitions. [2019-11-28 17:24:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:35,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,511 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 17:24:35,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1913811026, now seen corresponding path program 1 times [2019-11-28 17:24:35,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318299955] [2019-11-28 17:24:35,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:35,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:35,717 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:35,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:35 BoogieIcfgContainer [2019-11-28 17:24:35,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:35,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:35,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:35,873 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:35,873 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:33" (3/4) ... [2019-11-28 17:24:35,876 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:36,043 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:36,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:36,047 INFO L168 Benchmark]: Toolchain (without parser) took 4739.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -220.1 MB). Peak memory consumption was 299.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,048 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:36,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,053 INFO L168 Benchmark]: Boogie Preprocessor took 55.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:36,054 INFO L168 Benchmark]: RCFGBuilder took 1079.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,055 INFO L168 Benchmark]: TraceAbstraction took 2716.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 788.7 MB in the end (delta: 231.4 MB). Peak memory consumption was 231.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,056 INFO L168 Benchmark]: Witness Printer took 171.01 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 788.7 MB in the beginning and 1.2 GB in the end (delta: -387.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:36,058 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 622.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1079.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2716.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 788.7 MB in the end (delta: 231.4 MB). Peak memory consumption was 231.4 MB. Max. memory is 11.5 GB. * Witness Printer took 171.01 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 788.7 MB in the beginning and 1.2 GB in the end (delta: -387.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 950]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] int cleanupTimeShifts = 4; [L342] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L545] int pumpRunning = 0; [L546] int systemActive = 1; [L843] int waterLevel = 1; [L844] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L150] int retValue_acc ; [L151] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L833] int retValue_acc ; [L836] retValue_acc = 1 [L837] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] tmp = valid_product() [L159] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L743] int splverifierCounter ; [L744] int tmp ; [L745] int tmp___0 ; [L746] int tmp___1 ; [L747] int tmp___2 ; [L750] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L752] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L754] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L760] tmp = __VERIFIER_nondet_int() [L762] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L861] COND TRUE waterLevel < 2 [L862] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L770] tmp___0 = __VERIFIER_nondet_int() [L772] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L873] COND FALSE !(\read(methaneLevelCritical)) [L876] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L780] tmp___2 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L552] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L559] COND TRUE \read(systemActive) [L607] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L610] COND FALSE !(\read(pumpRunning)) [L581] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L584] COND TRUE ! pumpRunning [L704] int retValue_acc ; [L705] int tmp ; [L706] int tmp___0 ; [L923] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L926] COND FALSE !(waterLevel < 2) [L930] retValue_acc = 0 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L710] tmp = isHighWaterSensorDry() [L712] COND FALSE !(\read(tmp)) [L715] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L717] retValue_acc = tmp___0 [L718] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L586] tmp = isHighWaterLevel() [L588] COND TRUE \read(tmp) [L635] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L882] int retValue_acc ; [L885] retValue_acc = methaneLevelCritical [L886] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = isMethaneLevelCritical() [L51] COND TRUE \read(tmp) [L659] int retValue_acc ; [L662] retValue_acc = pumpRunning [L663] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L950] __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, 117 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 826 SDtfs, 1231 SDslu, 1056 SDs, 0 SdLazy, 148 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred 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, 488 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 12174 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...