./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product54.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_product54.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 72d06b83689108b06d89f4f95641f29fdbb51231 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:20:24,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:24,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:24,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:24,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:24,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:24,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:24,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:24,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:24,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:24,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:24,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:24,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:24,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:24,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:24,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:24,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:24,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:24,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:24,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:24,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:24,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:24,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:24,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:24,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:24,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:24,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:24,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:24,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:24,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:24,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:24,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:24,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:24,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:24,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:24,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:24,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:24,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:24,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:24,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:24,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:24,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:20:24,794 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:24,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:24,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:24,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:24,796 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:24,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:24,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:24,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:24,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:24,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:24,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:24,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:24,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:24,799 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:24,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:24,799 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:24,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:24,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:24,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:24,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:24,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:24,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:24,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:24,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:24,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:24,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:24,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:24,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:24,803 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 -> 72d06b83689108b06d89f4f95641f29fdbb51231 [2019-11-28 00:20:25,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:25,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:25,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:25,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:25,130 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:25,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c [2019-11-28 00:20:25,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf01d635/9567ffe9e15145bb8c80913f8289adfe/FLAG785bdedf3 [2019-11-28 00:20:25,793 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:25,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c [2019-11-28 00:20:25,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf01d635/9567ffe9e15145bb8c80913f8289adfe/FLAG785bdedf3 [2019-11-28 00:20:26,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf01d635/9567ffe9e15145bb8c80913f8289adfe [2019-11-28 00:20:26,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:26,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:26,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:26,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:26,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:26,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4877c490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26, skipping insertion in model container [2019-11-28 00:20:26,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:26,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:26,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:26,718 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:26,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:26,873 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:26,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26 WrapperNode [2019-11-28 00:20:26,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:26,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:26,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:26,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:26,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:26,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:26,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:26,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:26,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:26,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:27,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:27,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:27,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... [2019-11-28 00:20:27,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:27,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:27,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:27,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:27,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:27,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:28,227 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:28,228 INFO L297 CfgBuilder]: Removed 278 assume(true) statements. [2019-11-28 00:20:28,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:28 BoogieIcfgContainer [2019-11-28 00:20:28,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:28,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:28,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:28,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:28,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:26" (1/3) ... [2019-11-28 00:20:28,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f502a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:28, skipping insertion in model container [2019-11-28 00:20:28,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:26" (2/3) ... [2019-11-28 00:20:28,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f502a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:28, skipping insertion in model container [2019-11-28 00:20:28,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:28" (3/3) ... [2019-11-28 00:20:28,247 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product54.cil.c [2019-11-28 00:20:28,258 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:28,268 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:28,282 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:28,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:28,319 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:28,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:28,320 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:28,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:28,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:28,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:28,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2019-11-28 00:20:28,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:28,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:28,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1439730149, now seen corresponding path program 1 times [2019-11-28 00:20:28,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763392219] [2019-11-28 00:20:28,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,696 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,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763392219] [2019-11-28 00:20:28,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:28,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966779495] [2019-11-28 00:20:28,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:28,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:28,721 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 2 states. [2019-11-28 00:20:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:28,769 INFO L93 Difference]: Finished difference Result 372 states and 569 transitions. [2019-11-28 00:20:28,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:28,771 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:28,786 INFO L225 Difference]: With dead ends: 372 [2019-11-28 00:20:28,786 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 00:20:28,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 00:20:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-11-28 00:20:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-28 00:20:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 276 transitions. [2019-11-28 00:20:28,851 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 276 transitions. Word has length 16 [2019-11-28 00:20:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:28,852 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 276 transitions. [2019-11-28 00:20:28,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2019-11-28 00:20:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:28,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:28,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:28,854 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1808480250, now seen corresponding path program 1 times [2019-11-28 00:20:28,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:28,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933405999] [2019-11-28 00:20:28,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:28,967 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,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933405999] [2019-11-28 00:20:28,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:28,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:28,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313100089] [2019-11-28 00:20:28,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:28,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:28,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:28,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:28,975 INFO L87 Difference]: Start difference. First operand 185 states and 276 transitions. Second operand 3 states. [2019-11-28 00:20:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,005 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2019-11-28 00:20:29,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:29,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,007 INFO L225 Difference]: With dead ends: 185 [2019-11-28 00:20:29,007 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:20:29,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:20:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:20:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:20:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2019-11-28 00:20:29,024 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 17 [2019-11-28 00:20:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,025 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2019-11-28 00:20:29,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2019-11-28 00:20:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:29,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:29,027 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash -886510538, now seen corresponding path program 1 times [2019-11-28 00:20:29,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525455620] [2019-11-28 00:20:29,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525455620] [2019-11-28 00:20:29,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:29,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15235711] [2019-11-28 00:20:29,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:29,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:29,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:29,163 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand 5 states. [2019-11-28 00:20:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,225 INFO L93 Difference]: Finished difference Result 136 states and 204 transitions. [2019-11-28 00:20:29,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:20:29,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:20:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,227 INFO L225 Difference]: With dead ends: 136 [2019-11-28 00:20:29,227 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 00:20:29,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:20:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 00:20:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 00:20:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:20:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2019-11-28 00:20:29,237 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 22 [2019-11-28 00:20:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,238 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2019-11-28 00:20:29,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2019-11-28 00:20:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:29,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:29,240 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1823541737, now seen corresponding path program 1 times [2019-11-28 00:20:29,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110141902] [2019-11-28 00:20:29,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110141902] [2019-11-28 00:20:29,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:29,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889873581] [2019-11-28 00:20:29,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:29,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:29,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:29,335 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2019-11-28 00:20:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,402 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2019-11-28 00:20:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:29,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:20:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,405 INFO L225 Difference]: With dead ends: 145 [2019-11-28 00:20:29,405 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:20:29,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:20:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-28 00:20:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 00:20:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2019-11-28 00:20:29,429 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 25 [2019-11-28 00:20:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,432 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2019-11-28 00:20:29,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2019-11-28 00:20:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:29,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:29,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash -920121944, now seen corresponding path program 1 times [2019-11-28 00:20:29,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919470794] [2019-11-28 00:20:29,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919470794] [2019-11-28 00:20:29,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:29,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592260434] [2019-11-28 00:20:29,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:29,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:29,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:29,550 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand 5 states. [2019-11-28 00:20:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,679 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2019-11-28 00:20:29,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:29,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,682 INFO L225 Difference]: With dead ends: 204 [2019-11-28 00:20:29,682 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 00:20:29,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:20:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 00:20:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2019-11-28 00:20:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 00:20:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2019-11-28 00:20:29,711 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 31 [2019-11-28 00:20:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:29,712 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2019-11-28 00:20:29,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2019-11-28 00:20:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:29,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:29,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:29,715 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1742389099, now seen corresponding path program 1 times [2019-11-28 00:20:29,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:29,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098570870] [2019-11-28 00:20:29,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:29,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098570870] [2019-11-28 00:20:29,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:29,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:29,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616749856] [2019-11-28 00:20:29,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:29,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:29,824 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 5 states. [2019-11-28 00:20:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:29,994 INFO L93 Difference]: Finished difference Result 250 states and 344 transitions. [2019-11-28 00:20:29,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:29,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:20:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:29,997 INFO L225 Difference]: With dead ends: 250 [2019-11-28 00:20:29,997 INFO L226 Difference]: Without dead ends: 248 [2019-11-28 00:20:29,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-28 00:20:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 87. [2019-11-28 00:20:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 00:20:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2019-11-28 00:20:30,010 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 31 [2019-11-28 00:20:30,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,011 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2019-11-28 00:20:30,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2019-11-28 00:20:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:30,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,012 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:30,013 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1313148954, now seen corresponding path program 1 times [2019-11-28 00:20:30,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859176952] [2019-11-28 00:20:30,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:30,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859176952] [2019-11-28 00:20:30,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:30,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835162129] [2019-11-28 00:20:30,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:20:30,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:20:30,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:20:30,066 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand 4 states. [2019-11-28 00:20:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,139 INFO L93 Difference]: Finished difference Result 204 states and 276 transitions. [2019-11-28 00:20:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:20:30,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 00:20:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,141 INFO L225 Difference]: With dead ends: 204 [2019-11-28 00:20:30,141 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 00:20:30,142 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:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 00:20:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2019-11-28 00:20:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 00:20:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-28 00:20:30,152 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 31 [2019-11-28 00:20:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,153 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-28 00:20:30,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:20:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-28 00:20:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:20:30,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,155 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:30,155 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1054983516, now seen corresponding path program 1 times [2019-11-28 00:20:30,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841359786] [2019-11-28 00:20:30,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,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 00:20:30,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841359786] [2019-11-28 00:20:30,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:30,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17457299] [2019-11-28 00:20:30,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:30,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:30,200 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-28 00:20:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,232 INFO L93 Difference]: Finished difference Result 207 states and 277 transitions. [2019-11-28 00:20:30,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:30,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 00:20:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,235 INFO L225 Difference]: With dead ends: 207 [2019-11-28 00:20:30,235 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 00:20:30,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 00:20:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-28 00:20:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 00:20:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2019-11-28 00:20:30,249 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 31 [2019-11-28 00:20:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,250 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2019-11-28 00:20:30,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2019-11-28 00:20:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:20:30,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:30,252 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1127223910, now seen corresponding path program 1 times [2019-11-28 00:20:30,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373517480] [2019-11-28 00:20:30,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:30,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373517480] [2019-11-28 00:20:30,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:30,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:30,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327481127] [2019-11-28 00:20:30,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:30,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:30,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:30,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:30,364 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand 5 states. [2019-11-28 00:20:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:30,528 INFO L93 Difference]: Finished difference Result 615 states and 812 transitions. [2019-11-28 00:20:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:30,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:20:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:30,532 INFO L225 Difference]: With dead ends: 615 [2019-11-28 00:20:30,532 INFO L226 Difference]: Without dead ends: 501 [2019-11-28 00:20:30,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-28 00:20:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 226. [2019-11-28 00:20:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-28 00:20:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2019-11-28 00:20:30,592 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 32 [2019-11-28 00:20:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:30,593 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2019-11-28 00:20:30,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2019-11-28 00:20:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:30,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:30,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:30,595 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1518924332, now seen corresponding path program 1 times [2019-11-28 00:20:30,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:30,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647918203] [2019-11-28 00:20:30,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:30,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:30,760 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:30,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:30 BoogieIcfgContainer [2019-11-28 00:20:30,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:30,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:30,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:30,907 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:30,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:28" (3/4) ... [2019-11-28 00:20:30,910 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:31,080 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:31,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:31,090 INFO L168 Benchmark]: Toolchain (without parser) took 4985.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -211.8 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,091 INFO L168 Benchmark]: CDTParser took 0.30 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 00:20:31,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,093 INFO L168 Benchmark]: Boogie Preprocessor took 70.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,093 INFO L168 Benchmark]: RCFGBuilder took 1192.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.6 MB). Peak memory consumption was 86.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,094 INFO L168 Benchmark]: TraceAbstraction took 2673.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -144.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:31,098 INFO L168 Benchmark]: Witness Printer took 174.65 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:31,100 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.30 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 775.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1192.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.6 MB). Peak memory consumption was 86.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2673.23 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -144.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 174.65 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 216]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L229] int pumpRunning = 0; [L230] int systemActive = 1; [L691] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L889] int waterLevel = 1; [L890] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L487] int retValue_acc ; [L490] retValue_acc = 1 [L491] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L146] int splverifierCounter ; [L147] int tmp ; [L148] int tmp___0 ; [L149] int tmp___1 ; [L150] int tmp___2 ; [L153] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L155] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L163] tmp = __VERIFIER_nondet_int() [L165] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L907] COND TRUE waterLevel < 2 [L908] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] tmp___0 = __VERIFIER_nondet_int() [L175] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L919] COND FALSE !(\read(methaneLevelCritical)) [L922] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L183] tmp___2 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___2) [L456] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L237] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L244] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L321] COND FALSE !(\read(pumpRunning)) [L292] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L295] COND FALSE !(\read(pumpRunning)) [L266] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L269] COND TRUE ! pumpRunning [L415] int retValue_acc ; [L416] int tmp ; [L417] int tmp___0 ; [L969] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L972] COND FALSE !(waterLevel < 2) [L976] retValue_acc = 0 [L977] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L421] tmp = isHighWaterSensorDry() [L423] COND FALSE !(\read(tmp)) [L426] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L428] retValue_acc = tmp___0 [L429] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L271] tmp = isHighWaterLevel() [L273] COND TRUE \read(tmp) [L346] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L497] int tmp ; [L498] int tmp___0 ; [L928] int retValue_acc ; [L931] retValue_acc = methaneLevelCritical [L932] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L502] tmp = isMethaneLevelCritical() [L504] COND TRUE \read(tmp) [L370] int retValue_acc ; [L373] retValue_acc = pumpRunning [L374] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] tmp___0 = isPumpRunning() [L508] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L216] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 189 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1137 SDtfs, 1314 SDslu, 1238 SDs, 0 SdLazy, 197 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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=226occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 513 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 15647 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...