./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product34.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_spec4_product34.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash feddb53df5c889a09349b532f3a03633c4161684 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:43,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:43,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:43,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:43,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:43,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:43,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:43,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:43,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:43,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:43,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:43,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:43,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:43,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:43,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:43,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:43,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:43,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:43,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:43,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:43,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:43,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:43,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:43,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:43,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:43,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:43,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:43,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:43,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:43,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:43,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:43,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:43,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:43,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:43,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:43,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:43,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:43,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:43,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:43,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:43,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:43,966 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:22:43,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:44,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:44,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:44,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:44,006 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:44,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:44,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:44,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:44,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:44,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:44,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:44,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:44,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:44,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:44,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:44,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:44,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:44,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:44,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:44,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:44,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:44,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:44,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:44,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:44,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:44,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:44,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:44,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:44,013 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 -> feddb53df5c889a09349b532f3a03633c4161684 [2019-11-28 00:22:44,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:44,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:44,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:44,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:44,330 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:44,331 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c [2019-11-28 00:22:44,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ee0b9b1/e1c921cfc160479f8ee32df1d389bde4/FLAG56b122e8d [2019-11-28 00:22:44,965 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:44,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c [2019-11-28 00:22:44,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ee0b9b1/e1c921cfc160479f8ee32df1d389bde4/FLAG56b122e8d [2019-11-28 00:22:45,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ee0b9b1/e1c921cfc160479f8ee32df1d389bde4 [2019-11-28 00:22:45,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:45,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:45,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:45,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:45,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:45,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:45,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ebb17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45, skipping insertion in model container [2019-11-28 00:22:45,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:45,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:45,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:45,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:45,800 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:45,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:45,979 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:45,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45 WrapperNode [2019-11-28 00:22:45,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:45,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:45,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:45,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:45,990 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:22:45" (1/1) ... [2019-11-28 00:22:46,008 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:22:45" (1/1) ... [2019-11-28 00:22:46,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:46,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:46,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:46,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:46,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:46,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:46,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:46,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:46,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:46,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:46,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:46,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:46,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:46,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:46,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:46,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (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:22:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:46,855 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:46,855 INFO L297 CfgBuilder]: Removed 98 assume(true) statements. [2019-11-28 00:22:46,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:46 BoogieIcfgContainer [2019-11-28 00:22:46,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:46,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:46,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:46,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:46,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:45" (1/3) ... [2019-11-28 00:22:46,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3797be9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:46, skipping insertion in model container [2019-11-28 00:22:46,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45" (2/3) ... [2019-11-28 00:22:46,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3797be9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:46, skipping insertion in model container [2019-11-28 00:22:46,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:46" (3/3) ... [2019-11-28 00:22:46,873 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product34.cil.c [2019-11-28 00:22:46,883 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:46,892 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:46,906 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:46,938 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:46,938 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:46,938 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:46,938 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:46,940 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:46,940 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:46,940 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:46,940 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-28 00:22:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:46,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:46,970 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:22:46,971 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1424204181, now seen corresponding path program 1 times [2019-11-28 00:22:46,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:46,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240717115] [2019-11-28 00:22:46,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:47,265 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:22:47,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240717115] [2019-11-28 00:22:47,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:47,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:47,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053562548] [2019-11-28 00:22:47,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:47,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:47,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:47,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:47,294 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-28 00:22:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:47,341 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-11-28 00:22:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:47,343 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:47,353 INFO L225 Difference]: With dead ends: 150 [2019-11-28 00:22:47,354 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 00:22:47,358 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:22:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 00:22:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 00:22:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 00:22:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-11-28 00:22:47,404 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-11-28 00:22:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:47,405 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-11-28 00:22:47,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-11-28 00:22:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:47,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:47,407 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:22:47,407 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash -631654862, now seen corresponding path program 1 times [2019-11-28 00:22:47,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:47,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249736190] [2019-11-28 00:22:47,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:47,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249736190] [2019-11-28 00:22:47,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:47,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:47,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66421287] [2019-11-28 00:22:47,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:47,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:47,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:47,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:47,537 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-11-28 00:22:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:47,553 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-11-28 00:22:47,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:47,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:47,555 INFO L225 Difference]: With dead ends: 74 [2019-11-28 00:22:47,555 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 00:22:47,557 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:22:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 00:22:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 00:22:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 00:22:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-11-28 00:22:47,563 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-11-28 00:22:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:47,563 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-28 00:22:47,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-11-28 00:22:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:47,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:47,565 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:22:47,565 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:47,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash -964945646, now seen corresponding path program 1 times [2019-11-28 00:22:47,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:47,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772006261] [2019-11-28 00:22:47,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:47,669 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:22:47,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772006261] [2019-11-28 00:22:47,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:47,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:47,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456674519] [2019-11-28 00:22:47,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:47,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:47,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:47,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:47,675 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2019-11-28 00:22:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:47,756 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-11-28 00:22:47,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:22:47,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:22:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:47,759 INFO L225 Difference]: With dead ends: 62 [2019-11-28 00:22:47,759 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 00:22:47,760 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:22:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 00:22:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 00:22:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 00:22:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-11-28 00:22:47,770 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-11-28 00:22:47,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:47,772 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-28 00:22:47,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-11-28 00:22:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:22:47,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:47,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:47,774 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash -952202930, now seen corresponding path program 1 times [2019-11-28 00:22:47,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:47,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026769123] [2019-11-28 00:22:47,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:47,834 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:22:47,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026769123] [2019-11-28 00:22:47,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:47,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:47,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417720857] [2019-11-28 00:22:47,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:47,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:47,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:47,837 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-11-28 00:22:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:47,878 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-11-28 00:22:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:47,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:22:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:47,881 INFO L225 Difference]: With dead ends: 83 [2019-11-28 00:22:47,881 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 00:22:47,882 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:22:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 00:22:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-28 00:22:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:22:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-11-28 00:22:47,903 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-11-28 00:22:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:47,904 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-11-28 00:22:47,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-11-28 00:22:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 00:22:47,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:47,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:47,906 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2049720417, now seen corresponding path program 1 times [2019-11-28 00:22:47,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:47,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371686928] [2019-11-28 00:22:47,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:47,990 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:22:47,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371686928] [2019-11-28 00:22:47,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:47,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:47,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012860366] [2019-11-28 00:22:47,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:47,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:47,993 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-11-28 00:22:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,060 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-11-28 00:22:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:48,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 00:22:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,063 INFO L225 Difference]: With dead ends: 139 [2019-11-28 00:22:48,063 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 00:22:48,064 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:22:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 00:22:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-11-28 00:22:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:22:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-11-28 00:22:48,074 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-11-28 00:22:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,075 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-11-28 00:22:48,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-11-28 00:22:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 00:22:48,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:48,077 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash 612790626, now seen corresponding path program 1 times [2019-11-28 00:22:48,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853791177] [2019-11-28 00:22:48,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,220 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:22:48,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853791177] [2019-11-28 00:22:48,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:22:48,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254852181] [2019-11-28 00:22:48,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:22:48,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:22:48,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:48,223 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 8 states. [2019-11-28 00:22:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,638 INFO L93 Difference]: Finished difference Result 347 states and 497 transitions. [2019-11-28 00:22:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:22:48,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-28 00:22:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,642 INFO L225 Difference]: With dead ends: 347 [2019-11-28 00:22:48,642 INFO L226 Difference]: Without dead ends: 297 [2019-11-28 00:22:48,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:22:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-28 00:22:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 140. [2019-11-28 00:22:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 00:22:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-11-28 00:22:48,688 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 29 [2019-11-28 00:22:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,689 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-11-28 00:22:48,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:22:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-11-28 00:22:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 00:22:48,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,692 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:22:48,692 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash -230943976, now seen corresponding path program 1 times [2019-11-28 00:22:48,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019836139] [2019-11-28 00:22:48,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 00:22:48,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019836139] [2019-11-28 00:22:48,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:22:48,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978097546] [2019-11-28 00:22:48,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:48,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:48,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:48,773 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2019-11-28 00:22:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,871 INFO L93 Difference]: Finished difference Result 325 states and 442 transitions. [2019-11-28 00:22:48,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:22:48,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-28 00:22:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,874 INFO L225 Difference]: With dead ends: 325 [2019-11-28 00:22:48,874 INFO L226 Difference]: Without dead ends: 191 [2019-11-28 00:22:48,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:22:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-28 00:22:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 120. [2019-11-28 00:22:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-28 00:22:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2019-11-28 00:22:48,895 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 44 [2019-11-28 00:22:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,896 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2019-11-28 00:22:48,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2019-11-28 00:22:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:22:48,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,899 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:22:48,899 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash -187398120, now seen corresponding path program 1 times [2019-11-28 00:22:48,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606266809] [2019-11-28 00:22:48,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:49,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606266809] [2019-11-28 00:22:49,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196266661] [2019-11-28 00:22:49,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:49,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:49,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:49,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 00:22:49,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751098708] [2019-11-28 00:22:49,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:22:49,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:22:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:49,202 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand 8 states. [2019-11-28 00:22:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,460 INFO L93 Difference]: Finished difference Result 412 states and 570 transitions. [2019-11-28 00:22:49,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:22:49,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-28 00:22:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,463 INFO L225 Difference]: With dead ends: 412 [2019-11-28 00:22:49,463 INFO L226 Difference]: Without dead ends: 321 [2019-11-28 00:22:49,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:22:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-28 00:22:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 159. [2019-11-28 00:22:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-28 00:22:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 211 transitions. [2019-11-28 00:22:49,486 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 211 transitions. Word has length 45 [2019-11-28 00:22:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,487 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 211 transitions. [2019-11-28 00:22:49,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:22:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 211 transitions. [2019-11-28 00:22:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 00:22:49,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,489 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:49,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:49,695 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash 774082429, now seen corresponding path program 2 times [2019-11-28 00:22:49,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457797298] [2019-11-28 00:22:49,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:49,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:49,856 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:50,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:50 BoogieIcfgContainer [2019-11-28 00:22:50,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:50,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:50,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:50,045 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:50,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:46" (3/4) ... [2019-11-28 00:22:50,048 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:50,175 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:50,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:50,183 INFO L168 Benchmark]: Toolchain (without parser) took 4861.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 51.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,183 INFO L168 Benchmark]: CDTParser took 0.20 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:22:50,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,185 INFO L168 Benchmark]: Boogie Preprocessor took 37.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:50,185 INFO L168 Benchmark]: RCFGBuilder took 770.15 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: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,186 INFO L168 Benchmark]: TraceAbstraction took 3184.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:50,186 INFO L168 Benchmark]: Witness Printer took 130.98 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: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,188 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.20 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 661.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 770.15 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: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3184.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -76.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 130.98 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: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 540]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] int cleanupTimeShifts = 4; [L282] int pumpRunning = 0; [L283] int systemActive = 1; [L442] int waterLevel = 1; [L443] int methaneLevelCritical = 0; [L714] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L150] int retValue_acc ; [L151] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L199] int retValue_acc ; [L202] retValue_acc = 1 [L203] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L157] tmp = valid_product() [L159] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L210] int splverifierCounter ; [L211] int tmp ; [L212] int tmp___0 ; [L213] int tmp___1 ; [L214] int tmp___2 ; [L217] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L227] tmp = __VERIFIER_nondet_int() [L229] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L460] COND TRUE waterLevel < 2 [L461] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L289] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L321] COND TRUE ! pumpRunning [L415] int retValue_acc ; [L416] int tmp ; [L417] int tmp___0 ; [L522] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L525] COND FALSE !(waterLevel < 2) [L529] retValue_acc = 0 [L530] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, 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=0, pumpRunning=0, systemActive=1, waterLevel=2] [L428] retValue_acc = tmp___0 [L429] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L323] tmp = isHighWaterLevel() [L325] COND TRUE \read(tmp) [L346] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L227] tmp = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L289] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L448] COND TRUE waterLevel > 0 [L449] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L321] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L219] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L221] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L227] tmp = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L237] tmp___0 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L247] tmp___2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp___2) [L437] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L289] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L448] COND TRUE waterLevel > 0 [L449] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L296] COND TRUE \read(systemActive) [L318] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L321] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L44] int tmp ; [L45] int tmp___0 ; [L513] int retValue_acc ; [L516] retValue_acc = waterLevel [L517] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L49] tmp = getWaterLevel() [L51] COND TRUE tmp == 0 [L370] int retValue_acc ; [L373] retValue_acc = pumpRunning [L374] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L540] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.9s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 552 SDtfs, 1019 SDslu, 1121 SDs, 0 SdLazy, 205 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=8, 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, 8 MinimizatonAttempts, 428 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 16395 SizeOfPredicates, 4 NumberOfNonLiveVariables, 379 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 36/42 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...