./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product50.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 63231100df91d767f63e82b83b0d6c2eaec3a983 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:20:22,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:22,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:22,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:22,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:22,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:22,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:22,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:22,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:22,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:22,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:22,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:22,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:22,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:22,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:22,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:22,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:22,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:22,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:22,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:22,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:22,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:22,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:22,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:22,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:22,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:22,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:22,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:22,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:22,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:22,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:22,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:22,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:22,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:22,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:22,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:22,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:22,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:22,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:22,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:22,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:22,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:20:22,978 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:22,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:22,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:22,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:22,985 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:22,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:22,986 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:22,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:22,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:22,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:22,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:22,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:22,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:22,988 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:22,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:22,989 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:22,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:22,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:22,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:22,990 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:22,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:22,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:22,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:22,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:22,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:22,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:22,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:22,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:22,992 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 -> 63231100df91d767f63e82b83b0d6c2eaec3a983 [2019-11-28 00:20:23,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:23,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:23,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:23,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:23,330 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:23,331 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2019-11-28 00:20:23,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b837fb000/32138aa8db624bf0ab014aae3dd1afe0/FLAGa89f64a9a [2019-11-28 00:20:23,955 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:23,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2019-11-28 00:20:23,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b837fb000/32138aa8db624bf0ab014aae3dd1afe0/FLAGa89f64a9a [2019-11-28 00:20:24,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b837fb000/32138aa8db624bf0ab014aae3dd1afe0 [2019-11-28 00:20:24,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:24,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:24,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:24,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:24,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:24,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7539c191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24, skipping insertion in model container [2019-11-28 00:20:24,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:24,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:24,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:24,762 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:24,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:24,911 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:24,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24 WrapperNode [2019-11-28 00:20:24,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:24,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:24,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:24,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:24,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:24,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:25,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:25,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:25,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:25,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:25,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:25,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:25,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:25,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:25,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:25,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:25,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... [2019-11-28 00:20:25,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:25,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:25,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:25,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:25,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:26,103 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:26,103 INFO L297 CfgBuilder]: Removed 158 assume(true) statements. [2019-11-28 00:20:26,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:26 BoogieIcfgContainer [2019-11-28 00:20:26,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:26,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:26,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:26,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:26,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:24" (1/3) ... [2019-11-28 00:20:26,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1ac881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:26, skipping insertion in model container [2019-11-28 00:20:26,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:24" (2/3) ... [2019-11-28 00:20:26,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1ac881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:26, skipping insertion in model container [2019-11-28 00:20:26,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:26" (3/3) ... [2019-11-28 00:20:26,117 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product50.cil.c [2019-11-28 00:20:26,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:26,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:26,149 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:26,177 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:26,177 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:26,178 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:26,178 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:26,178 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:26,178 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:26,179 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:26,179 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-11-28 00:20:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:26,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:26,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:26,219 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1800894747, now seen corresponding path program 1 times [2019-11-28 00:20:26,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784498067] [2019-11-28 00:20:26,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:26,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784498067] [2019-11-28 00:20:26,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:26,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:26,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485059975] [2019-11-28 00:20:26,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:26,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:26,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:26,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:26,635 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2019-11-28 00:20:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:26,703 INFO L93 Difference]: Finished difference Result 228 states and 347 transitions. [2019-11-28 00:20:26,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:26,705 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:26,723 INFO L225 Difference]: With dead ends: 228 [2019-11-28 00:20:26,724 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 00:20:26,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 00:20:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 00:20:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 00:20:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-11-28 00:20:26,804 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 16 [2019-11-28 00:20:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:26,805 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-11-28 00:20:26,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-11-28 00:20:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:26,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:26,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:26,811 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1447315652, now seen corresponding path program 1 times [2019-11-28 00:20:26,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950866637] [2019-11-28 00:20:26,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:26,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950866637] [2019-11-28 00:20:26,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:26,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:26,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814661675] [2019-11-28 00:20:26,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:26,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:26,940 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 3 states. [2019-11-28 00:20:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:26,962 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2019-11-28 00:20:26,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:26,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:26,964 INFO L225 Difference]: With dead ends: 113 [2019-11-28 00:20:26,964 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:20:26,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:20:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:20:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:20:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 00:20:26,971 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 00:20:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:26,972 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 00:20:26,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 00:20:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:26,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:26,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:26,974 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash -230586389, now seen corresponding path program 1 times [2019-11-28 00:20:26,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:26,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576196097] [2019-11-28 00:20:26,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:27,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576196097] [2019-11-28 00:20:27,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:27,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003237657] [2019-11-28 00:20:27,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,125 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2019-11-28 00:20:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,182 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-11-28 00:20:27,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:20:27,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:20:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,184 INFO L225 Difference]: With dead ends: 88 [2019-11-28 00:20:27,184 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:20:27,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:20:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:20:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:20:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:20:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-11-28 00:20:27,191 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 22 [2019-11-28 00:20:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,192 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-11-28 00:20:27,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-11-28 00:20:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:20:27,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:27,193 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash -108421843, now seen corresponding path program 1 times [2019-11-28 00:20:27,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498673828] [2019-11-28 00:20:27,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:27,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498673828] [2019-11-28 00:20:27,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:27,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480532498] [2019-11-28 00:20:27,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:27,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:27,265 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2019-11-28 00:20:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,325 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2019-11-28 00:20:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:27,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:20:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,327 INFO L225 Difference]: With dead ends: 109 [2019-11-28 00:20:27,328 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:20:27,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:20:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 00:20:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:20:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-11-28 00:20:27,349 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 24 [2019-11-28 00:20:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,350 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-11-28 00:20:27,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-11-28 00:20:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:20:27,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,352 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 00:20:27,352 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1619186466, now seen corresponding path program 1 times [2019-11-28 00:20:27,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979528274] [2019-11-28 00:20:27,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:27,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979528274] [2019-11-28 00:20:27,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:27,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699932037] [2019-11-28 00:20:27,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,472 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 5 states. [2019-11-28 00:20:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,557 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2019-11-28 00:20:27,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:27,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:20:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,559 INFO L225 Difference]: With dead ends: 175 [2019-11-28 00:20:27,560 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 00:20:27,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:20:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 00:20:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-11-28 00:20:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 00:20:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-11-28 00:20:27,576 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 30 [2019-11-28 00:20:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,576 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-11-28 00:20:27,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-11-28 00:20:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:20:27,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,580 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 00:20:27,580 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1043324577, now seen corresponding path program 1 times [2019-11-28 00:20:27,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460268167] [2019-11-28 00:20:27,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:27,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460268167] [2019-11-28 00:20:27,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:27,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148715108] [2019-11-28 00:20:27,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:27,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:27,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:27,711 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 5 states. [2019-11-28 00:20:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,855 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2019-11-28 00:20:27,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:27,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:20:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,857 INFO L225 Difference]: With dead ends: 204 [2019-11-28 00:20:27,858 INFO L226 Difference]: Without dead ends: 202 [2019-11-28 00:20:27,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-28 00:20:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 72. [2019-11-28 00:20:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 00:20:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2019-11-28 00:20:27,871 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 30 [2019-11-28 00:20:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,871 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2019-11-28 00:20:27,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2019-11-28 00:20:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:20:27,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,873 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 00:20:27,874 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2012213476, now seen corresponding path program 1 times [2019-11-28 00:20:27,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396066426] [2019-11-28 00:20:27,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:27,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396066426] [2019-11-28 00:20:27,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:27,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:27,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827281101] [2019-11-28 00:20:27,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:20:27,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:27,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:20:27,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:20:27,926 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand 4 states. [2019-11-28 00:20:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:27,969 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2019-11-28 00:20:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:20:27,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 00:20:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:27,971 INFO L225 Difference]: With dead ends: 168 [2019-11-28 00:20:27,971 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 00:20:27,972 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 00:20:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 00:20:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2019-11-28 00:20:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 00:20:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2019-11-28 00:20:27,982 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 30 [2019-11-28 00:20:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:27,983 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2019-11-28 00:20:27,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:20:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2019-11-28 00:20:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:20:27,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:27,985 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 00:20:27,985 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:27,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1754048038, now seen corresponding path program 1 times [2019-11-28 00:20:27,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:27,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587445534] [2019-11-28 00:20:27,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:28,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587445534] [2019-11-28 00:20:28,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:28,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333473225] [2019-11-28 00:20:28,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:28,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:28,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:28,029 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 3 states. [2019-11-28 00:20:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,054 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-11-28 00:20:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:28,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 00:20:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,056 INFO L225 Difference]: With dead ends: 172 [2019-11-28 00:20:28,056 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 00:20:28,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 00:20:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-28 00:20:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 00:20:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2019-11-28 00:20:28,071 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 30 [2019-11-28 00:20:28,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,071 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2019-11-28 00:20:28,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2019-11-28 00:20:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:28,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:28,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash 533103064, now seen corresponding path program 1 times [2019-11-28 00:20:28,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73182105] [2019-11-28 00:20:28,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:28,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73182105] [2019-11-28 00:20:28,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:28,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858000677] [2019-11-28 00:20:28,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:28,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:28,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:28,171 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand 5 states. [2019-11-28 00:20:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,295 INFO L93 Difference]: Finished difference Result 553 states and 737 transitions. [2019-11-28 00:20:28,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:28,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,298 INFO L225 Difference]: With dead ends: 553 [2019-11-28 00:20:28,299 INFO L226 Difference]: Without dead ends: 457 [2019-11-28 00:20:28,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-28 00:20:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 190. [2019-11-28 00:20:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-28 00:20:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 248 transitions. [2019-11-28 00:20:28,345 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 248 transitions. Word has length 31 [2019-11-28 00:20:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,346 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 248 transitions. [2019-11-28 00:20:28,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 248 transitions. [2019-11-28 00:20:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:28,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:28,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1099927890, now seen corresponding path program 1 times [2019-11-28 00:20:28,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573753960] [2019-11-28 00:20:28,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:28,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:28,602 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:28,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:28 BoogieIcfgContainer [2019-11-28 00:20:28,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:28,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:28,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:28,756 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:28,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:26" (3/4) ... [2019-11-28 00:20:28,759 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:28,956 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:28,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:28,961 INFO L168 Benchmark]: Toolchain (without parser) took 4717.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -217.4 MB). Peak memory consumption was 307.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,964 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:28,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.51 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,965 INFO L168 Benchmark]: Boogie Preprocessor took 44.77 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 00:20:28,966 INFO L168 Benchmark]: RCFGBuilder took 1058.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.8 MB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,966 INFO L168 Benchmark]: TraceAbstraction took 2648.31 ms. Allocated memory is still 1.1 GB. Free memory was 998.8 MB in the beginning and 771.4 MB in the end (delta: 227.4 MB). Peak memory consumption was 227.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,967 INFO L168 Benchmark]: Witness Printer took 200.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 771.4 MB in the beginning and 1.2 GB in the end (delta: -403.7 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:28,969 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.22 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 670.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.51 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.77 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 1058.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.8 MB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2648.31 ms. Allocated memory is still 1.1 GB. Free memory was 998.8 MB in the beginning and 771.4 MB in the end (delta: 227.4 MB). Peak memory consumption was 227.4 MB. Max. memory is 11.5 GB. * Witness Printer took 200.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 771.4 MB in the beginning and 1.2 GB in the end (delta: -403.7 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 388]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L76] int waterLevel = 1; [L77] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L395] int pumpRunning = 0; [L396] int systemActive = 1; [L769] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L258] int retValue_acc ; [L259] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L307] int retValue_acc ; [L310] retValue_acc = 1 [L311] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L265] tmp = valid_product() [L267] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L318] int splverifierCounter ; [L319] int tmp ; [L320] int tmp___0 ; [L321] int tmp___1 ; [L322] int tmp___2 ; [L325] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L327] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L329] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] tmp = __VERIFIER_nondet_int() [L337] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L94] COND TRUE waterLevel < 2 [L95] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L345] tmp___0 = __VERIFIER_nondet_int() [L347] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L106] COND FALSE !(\read(methaneLevelCritical)) [L109] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L355] tmp___2 = __VERIFIER_nondet_int() [L357] COND TRUE \read(tmp___2) [L595] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L402] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L409] COND TRUE \read(systemActive) [L457] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L460] COND FALSE !(\read(pumpRunning)) [L431] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L434] COND TRUE ! pumpRunning [L554] int retValue_acc ; [L555] int tmp ; [L556] int tmp___0 ; [L156] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L159] COND FALSE !(waterLevel < 2) [L163] retValue_acc = 0 [L164] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L560] tmp = isHighWaterSensorDry() [L562] COND FALSE !(\read(tmp)) [L565] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L567] retValue_acc = tmp___0 [L568] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L436] tmp = isHighWaterLevel() [L438] COND TRUE \read(tmp) [L485] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L115] int retValue_acc ; [L118] retValue_acc = methaneLevelCritical [L119] 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) [L509] int retValue_acc ; [L512] retValue_acc = pumpRunning [L513] 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] [L388] __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.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 828 SDtfs, 1030 SDslu, 1038 SDs, 0 SdLazy, 141 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s 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=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, 468 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 11349 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...