./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product49.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_product49.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 712263c6c933aaef268a48b623f3b4ee6fd9ad4b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:22:52,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:52,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:52,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:52,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:52,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:52,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:52,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:52,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:52,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:52,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:52,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:52,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:52,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:52,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:52,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:52,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:52,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:52,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:52,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:52,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:52,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:52,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:52,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:52,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:52,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:52,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:52,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:52,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:52,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:52,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:52,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:52,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:52,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:52,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:52,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:52,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:52,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:52,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:52,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:52,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:52,996 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:53,010 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:53,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:53,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:53,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:53,012 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:53,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:53,013 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:53,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:53,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:53,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:53,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:53,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:53,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:53,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:53,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:53,015 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:53,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:53,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:53,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:53,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:53,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:53,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:53,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:53,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:53,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:53,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:53,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:53,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:53,019 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 -> 712263c6c933aaef268a48b623f3b4ee6fd9ad4b [2019-11-28 00:22:53,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:53,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:53,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:53,397 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:53,397 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:53,398 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product49.cil.c [2019-11-28 00:22:53,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48687946c/d1ea8289cd4648e383e4e12f2825affc/FLAG8cf135d61 [2019-11-28 00:22:54,003 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:54,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product49.cil.c [2019-11-28 00:22:54,024 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48687946c/d1ea8289cd4648e383e4e12f2825affc/FLAG8cf135d61 [2019-11-28 00:22:54,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48687946c/d1ea8289cd4648e383e4e12f2825affc [2019-11-28 00:22:54,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:54,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:54,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:54,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:54,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:54,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:54" (1/1) ... [2019-11-28 00:22:54,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce269f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:54, skipping insertion in model container [2019-11-28 00:22:54,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:54" (1/1) ... [2019-11-28 00:22:54,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:54,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:54,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:54,803 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:54,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:54,984 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:54,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:54 WrapperNode [2019-11-28 00:22:54,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:54,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:54,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:54,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:54,995 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:54" (1/1) ... [2019-11-28 00:22:55,026 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:54" (1/1) ... [2019-11-28 00:22:55,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:55,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:55,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:55,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:55,088 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:54" (1/1) ... [2019-11-28 00:22:55,088 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:54" (1/1) ... [2019-11-28 00:22:55,093 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:54" (1/1) ... [2019-11-28 00:22:55,093 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:54" (1/1) ... [2019-11-28 00:22:55,106 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:54" (1/1) ... [2019-11-28 00:22:55,116 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:54" (1/1) ... [2019-11-28 00:22:55,119 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:54" (1/1) ... [2019-11-28 00:22:55,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:55,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:55,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:55,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:55,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:54" (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:55,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:56,176 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:56,176 INFO L297 CfgBuilder]: Removed 156 assume(true) statements. [2019-11-28 00:22:56,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:56 BoogieIcfgContainer [2019-11-28 00:22:56,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:56,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:56,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:56,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:56,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:54" (1/3) ... [2019-11-28 00:22:56,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce105ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:56, skipping insertion in model container [2019-11-28 00:22:56,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:54" (2/3) ... [2019-11-28 00:22:56,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce105ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:56, skipping insertion in model container [2019-11-28 00:22:56,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:56" (3/3) ... [2019-11-28 00:22:56,193 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product49.cil.c [2019-11-28 00:22:56,201 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:56,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:56,217 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:56,238 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:56,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:56,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:56,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:56,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:56,239 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:56,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:56,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-11-28 00:22:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:56,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,267 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:56,267 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1641629540, now seen corresponding path program 1 times [2019-11-28 00:22:56,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84226289] [2019-11-28 00:22:56,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,575 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:56,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84226289] [2019-11-28 00:22:56,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:56,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148299146] [2019-11-28 00:22:56,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:56,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:56,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:56,603 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2019-11-28 00:22:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,639 INFO L93 Difference]: Finished difference Result 228 states and 347 transitions. [2019-11-28 00:22:56,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:56,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,654 INFO L225 Difference]: With dead ends: 228 [2019-11-28 00:22:56,654 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 00:22:56,658 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:56,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 00:22:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-28 00:22:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 00:22:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-11-28 00:22:56,705 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 16 [2019-11-28 00:22:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,705 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-11-28 00:22:56,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-11-28 00:22:56,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:56,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,707 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:56,708 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,708 INFO L82 PathProgramCache]: Analyzing trace with hash 594872643, now seen corresponding path program 1 times [2019-11-28 00:22:56,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515180596] [2019-11-28 00:22:56,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,829 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:56,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515180596] [2019-11-28 00:22:56,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:56,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121932006] [2019-11-28 00:22:56,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:56,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:56,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:56,833 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 3 states. [2019-11-28 00:22:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,847 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2019-11-28 00:22:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:56,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,849 INFO L225 Difference]: With dead ends: 113 [2019-11-28 00:22:56,850 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:22:56,851 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:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:22:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:22:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:22:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 00:22:56,858 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 00:22:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,858 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 00:22:56,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 00:22:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:56,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,860 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:56,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1404483435, now seen corresponding path program 1 times [2019-11-28 00:22:56,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754702957] [2019-11-28 00:22:56,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,975 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:56,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754702957] [2019-11-28 00:22:56,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:56,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583422368] [2019-11-28 00:22:56,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:56,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:56,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:56,981 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 3 states. [2019-11-28 00:22:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:57,014 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2019-11-28 00:22:57,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:57,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:22:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:57,016 INFO L225 Difference]: With dead ends: 88 [2019-11-28 00:22:57,017 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:22:57,017 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:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:22:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:22:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:22:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-11-28 00:22:57,027 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 22 [2019-11-28 00:22:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:57,027 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-11-28 00:22:57,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2019-11-28 00:22:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:22:57,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:57,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:57,029 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash -764351347, now seen corresponding path program 1 times [2019-11-28 00:22:57,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:57,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119392928] [2019-11-28 00:22:57,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:57,111 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:57,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119392928] [2019-11-28 00:22:57,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:57,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:57,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335033889] [2019-11-28 00:22:57,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:57,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:57,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:57,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:57,114 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2019-11-28 00:22:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:57,149 INFO L93 Difference]: Finished difference Result 109 states and 158 transitions. [2019-11-28 00:22:57,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:57,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:22:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:57,151 INFO L225 Difference]: With dead ends: 109 [2019-11-28 00:22:57,151 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 00:22:57,152 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:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 00:22:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 00:22:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:22:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2019-11-28 00:22:57,161 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 24 [2019-11-28 00:22:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:57,161 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2019-11-28 00:22:57,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2019-11-28 00:22:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:57,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:57,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:57,164 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:57,164 INFO L82 PathProgramCache]: Analyzing trace with hash -805303330, now seen corresponding path program 1 times [2019-11-28 00:22:57,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:57,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912542475] [2019-11-28 00:22:57,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:57,244 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:57,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912542475] [2019-11-28 00:22:57,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:57,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:57,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806374225] [2019-11-28 00:22:57,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:57,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:57,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:57,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:57,247 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand 5 states. [2019-11-28 00:22:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:57,379 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2019-11-28 00:22:57,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:57,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:57,381 INFO L225 Difference]: With dead ends: 175 [2019-11-28 00:22:57,381 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 00:22:57,382 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:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 00:22:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-11-28 00:22:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 00:22:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-11-28 00:22:57,391 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 30 [2019-11-28 00:22:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:57,392 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-11-28 00:22:57,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-11-28 00:22:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:57,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:57,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:57,394 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1857207713, now seen corresponding path program 1 times [2019-11-28 00:22:57,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:57,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50896396] [2019-11-28 00:22:57,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:57,517 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:57,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50896396] [2019-11-28 00:22:57,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:57,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:57,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251785352] [2019-11-28 00:22:57,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:57,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:57,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:57,525 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 5 states. [2019-11-28 00:22:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:57,645 INFO L93 Difference]: Finished difference Result 253 states and 355 transitions. [2019-11-28 00:22:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:57,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:57,647 INFO L225 Difference]: With dead ends: 253 [2019-11-28 00:22:57,647 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 00:22:57,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 00:22:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 115. [2019-11-28 00:22:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 00:22:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 155 transitions. [2019-11-28 00:22:57,664 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 155 transitions. Word has length 30 [2019-11-28 00:22:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:57,664 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 155 transitions. [2019-11-28 00:22:57,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 155 transitions. [2019-11-28 00:22:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:57,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:57,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:57,666 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:57,667 INFO L82 PathProgramCache]: Analyzing trace with hash -150608481, now seen corresponding path program 1 times [2019-11-28 00:22:57,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:57,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136891622] [2019-11-28 00:22:57,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:57,799 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:57,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136891622] [2019-11-28 00:22:57,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:57,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:57,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121894668] [2019-11-28 00:22:57,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:57,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:57,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:57,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:57,808 INFO L87 Difference]: Start difference. First operand 115 states and 155 transitions. Second operand 5 states. [2019-11-28 00:22:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:57,932 INFO L93 Difference]: Finished difference Result 247 states and 339 transitions. [2019-11-28 00:22:57,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:57,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:57,934 INFO L225 Difference]: With dead ends: 247 [2019-11-28 00:22:57,935 INFO L226 Difference]: Without dead ends: 245 [2019-11-28 00:22:57,935 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:22:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-28 00:22:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 115. [2019-11-28 00:22:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 00:22:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2019-11-28 00:22:57,952 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 31 [2019-11-28 00:22:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:57,952 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2019-11-28 00:22:57,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2019-11-28 00:22:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:57,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:57,954 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:22:57,955 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1088820762, now seen corresponding path program 1 times [2019-11-28 00:22:57,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:57,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150723472] [2019-11-28 00:22:57,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:58,019 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:58,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150723472] [2019-11-28 00:22:58,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:58,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:58,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327437064] [2019-11-28 00:22:58,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:22:58,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:22:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:22:58,022 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 4 states. [2019-11-28 00:22:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:58,082 INFO L93 Difference]: Finished difference Result 250 states and 335 transitions. [2019-11-28 00:22:58,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:22:58,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 00:22:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:58,084 INFO L225 Difference]: With dead ends: 250 [2019-11-28 00:22:58,084 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 00:22:58,085 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:22:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 00:22:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2019-11-28 00:22:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 00:22:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2019-11-28 00:22:58,095 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 31 [2019-11-28 00:22:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:58,096 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2019-11-28 00:22:58,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:22:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2019-11-28 00:22:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:58,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:58,097 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:22:58,098 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:58,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1346986200, now seen corresponding path program 1 times [2019-11-28 00:22:58,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:58,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231204498] [2019-11-28 00:22:58,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:58,152 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:58,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231204498] [2019-11-28 00:22:58,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:58,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:58,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475740191] [2019-11-28 00:22:58,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:58,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:58,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:58,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:58,155 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand 5 states. [2019-11-28 00:22:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:58,305 INFO L93 Difference]: Finished difference Result 271 states and 366 transitions. [2019-11-28 00:22:58,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:58,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:58,307 INFO L225 Difference]: With dead ends: 271 [2019-11-28 00:22:58,307 INFO L226 Difference]: Without dead ends: 201 [2019-11-28 00:22:58,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-28 00:22:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 141. [2019-11-28 00:22:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-28 00:22:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2019-11-28 00:22:58,326 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 31 [2019-11-28 00:22:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:58,328 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2019-11-28 00:22:58,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2019-11-28 00:22:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 00:22:58,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:58,335 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:58,336 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:58,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:58,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1033530397, now seen corresponding path program 1 times [2019-11-28 00:22:58,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:58,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611590749] [2019-11-28 00:22:58,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:58,455 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:58,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611590749] [2019-11-28 00:22:58,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673191750] [2019-11-28 00:22:58,457 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:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:58,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:58,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:58,733 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:58,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:58,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 00:22:58,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786134640] [2019-11-28 00:22:58,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:58,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:58,737 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 6 states. [2019-11-28 00:22:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:58,938 INFO L93 Difference]: Finished difference Result 441 states and 588 transitions. [2019-11-28 00:22:58,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:58,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 00:22:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:58,941 INFO L225 Difference]: With dead ends: 441 [2019-11-28 00:22:58,944 INFO L226 Difference]: Without dead ends: 330 [2019-11-28 00:22:58,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:22:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-28 00:22:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 195. [2019-11-28 00:22:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-28 00:22:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 256 transitions. [2019-11-28 00:22:58,970 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 256 transitions. Word has length 52 [2019-11-28 00:22:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:58,971 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 256 transitions. [2019-11-28 00:22:58,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 256 transitions. [2019-11-28 00:22:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 00:22:58,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:58,973 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:22:59,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:59,183 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2113506808, now seen corresponding path program 2 times [2019-11-28 00:22:59,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:59,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457544048] [2019-11-28 00:22:59,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 00:22:59,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457544048] [2019-11-28 00:22:59,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:59,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:59,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340423241] [2019-11-28 00:22:59,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:59,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:59,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:59,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:59,355 INFO L87 Difference]: Start difference. First operand 195 states and 256 transitions. Second operand 5 states. [2019-11-28 00:22:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:59,649 INFO L93 Difference]: Finished difference Result 599 states and 798 transitions. [2019-11-28 00:22:59,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:22:59,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-28 00:22:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:59,653 INFO L225 Difference]: With dead ends: 599 [2019-11-28 00:22:59,653 INFO L226 Difference]: Without dead ends: 433 [2019-11-28 00:22:59,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-28 00:22:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 271. [2019-11-28 00:22:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-28 00:22:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 353 transitions. [2019-11-28 00:22:59,683 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 353 transitions. Word has length 73 [2019-11-28 00:22:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:59,684 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 353 transitions. [2019-11-28 00:22:59,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 353 transitions. [2019-11-28 00:22:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 00:22:59,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:59,685 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:22:59,686 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:59,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:59,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1906700874, now seen corresponding path program 1 times [2019-11-28 00:22:59,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:59,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925156971] [2019-11-28 00:22:59,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:22:59,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925156971] [2019-11-28 00:22:59,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321928686] [2019-11-28 00:22:59,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:59,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 00:22:59,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:22:59,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:22:59,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-28 00:22:59,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353194965] [2019-11-28 00:22:59,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:59,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:22:59,943 INFO L87 Difference]: Start difference. First operand 271 states and 353 transitions. Second operand 5 states. [2019-11-28 00:22:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:59,999 INFO L93 Difference]: Finished difference Result 480 states and 624 transitions. [2019-11-28 00:23:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:23:00,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-28 00:23:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:23:00,000 INFO L225 Difference]: With dead ends: 480 [2019-11-28 00:23:00,000 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:23:00,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:23:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:23:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:23:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:23:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:23:00,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2019-11-28 00:23:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:23:00,003 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:23:00,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:23:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:23:00,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:23:00,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:23:00,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:23:00,378 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-11-28 00:23:00,576 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-11-28 00:23:00,721 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-11-28 00:23:00,876 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-11-28 00:23:01,054 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2019-11-28 00:23:01,636 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 17 [2019-11-28 00:23:01,882 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 17 [2019-11-28 00:23:02,258 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 17 [2019-11-28 00:23:02,511 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 10 [2019-11-28 00:23:02,757 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 20 [2019-11-28 00:23:03,091 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 17 [2019-11-28 00:23:03,326 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 25 [2019-11-28 00:23:03,509 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 19 [2019-11-28 00:23:03,514 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-11-28 00:23:03,514 INFO L246 CegarLoopResult]: For program point L433(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,514 INFO L246 CegarLoopResult]: For program point L433-2(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-3(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-5(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-6(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-8(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-9(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-11(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-12(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-14(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-15(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,515 INFO L246 CegarLoopResult]: For program point L433-17(lines 433 437) no Hoare annotation was computed. [2019-11-28 00:23:03,516 INFO L246 CegarLoopResult]: For program point L335(lines 335 343) no Hoare annotation was computed. [2019-11-28 00:23:03,516 INFO L246 CegarLoopResult]: For program point L335-1(lines 335 343) no Hoare annotation was computed. [2019-11-28 00:23:03,516 INFO L246 CegarLoopResult]: For program point L335-2(lines 335 343) no Hoare annotation was computed. [2019-11-28 00:23:03,516 INFO L242 CegarLoopResult]: At program point L172-2(lines 172 186) the Hoare annotation is: false [2019-11-28 00:23:03,516 INFO L246 CegarLoopResult]: For program point L503(lines 503 514) no Hoare annotation was computed. [2019-11-28 00:23:03,516 INFO L246 CegarLoopResult]: For program point L305(lines 305 322) no Hoare annotation was computed. [2019-11-28 00:23:03,516 INFO L246 CegarLoopResult]: For program point L305-1(lines 305 322) no Hoare annotation was computed. [2019-11-28 00:23:03,516 INFO L246 CegarLoopResult]: For program point L305-2(lines 305 322) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L305-3(lines 305 322) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L305-4(lines 305 322) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L140(lines 140 146) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L305-5(lines 305 322) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L140-1(lines 140 146) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L140-2(lines 140 146) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L140-3(lines 140 146) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L140-4(lines 140 146) no Hoare annotation was computed. [2019-11-28 00:23:03,517 INFO L246 CegarLoopResult]: For program point L140-5(lines 140 146) no Hoare annotation was computed. [2019-11-28 00:23:03,518 INFO L242 CegarLoopResult]: At program point L273(lines 272 291) the Hoare annotation is: (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0) (= 0 ULTIMATE.start_test_~splverifierCounter~0)) [2019-11-28 00:23:03,518 INFO L246 CegarLoopResult]: For program point L273-1(lines 273 279) no Hoare annotation was computed. [2019-11-28 00:23:03,518 INFO L242 CegarLoopResult]: At program point L273-2(lines 272 291) the Hoare annotation is: false [2019-11-28 00:23:03,518 INFO L242 CegarLoopResult]: At program point L273-3(lines 272 291) the Hoare annotation is: false [2019-11-28 00:23:03,518 INFO L246 CegarLoopResult]: For program point L75(lines 75 79) no Hoare annotation was computed. [2019-11-28 00:23:03,518 INFO L246 CegarLoopResult]: For program point L571(lines 571 584) no Hoare annotation was computed. [2019-11-28 00:23:03,518 INFO L242 CegarLoopResult]: At program point L571-1(lines 1 953) the Hoare annotation is: (let ((.cse1 (= ~pumpRunning~0 0)) (.cse0 (= 1 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= 1 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~6) (<= 1 |ULTIMATE.start_getWaterLevel_#res|) (<= 1 ~waterLevel~0) .cse1 .cse2) (and .cse0 (= 1 ~waterLevel~0) .cse1 .cse2) (and .cse0 (<= 2 ~waterLevel~0) (<= 2 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~6) (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse2))) [2019-11-28 00:23:03,519 INFO L246 CegarLoopResult]: For program point L571-2(lines 571 584) no Hoare annotation was computed. [2019-11-28 00:23:03,519 INFO L242 CegarLoopResult]: At program point L571-3(lines 1 953) the Hoare annotation is: false [2019-11-28 00:23:03,519 INFO L242 CegarLoopResult]: At program point L439(lines 424 442) the Hoare annotation is: false [2019-11-28 00:23:03,519 INFO L246 CegarLoopResult]: For program point L571-4(lines 571 584) no Hoare annotation was computed. [2019-11-28 00:23:03,519 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-11-28 00:23:03,519 INFO L242 CegarLoopResult]: At program point L439-1(lines 424 442) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) (<= 1 ~waterLevel~0) .cse1 .cse2))) [2019-11-28 00:23:03,519 INFO L242 CegarLoopResult]: At program point L571-5(lines 1 953) the Hoare annotation is: false [2019-11-28 00:23:03,519 INFO L242 CegarLoopResult]: At program point L439-2(lines 424 442) the Hoare annotation is: false [2019-11-28 00:23:03,520 INFO L242 CegarLoopResult]: At program point L439-3(lines 424 442) the Hoare annotation is: false [2019-11-28 00:23:03,520 INFO L242 CegarLoopResult]: At program point L439-4(lines 424 442) the Hoare annotation is: false [2019-11-28 00:23:03,520 INFO L242 CegarLoopResult]: At program point L439-5(lines 424 442) the Hoare annotation is: false [2019-11-28 00:23:03,520 INFO L246 CegarLoopResult]: For program point L176(lines 176 180) no Hoare annotation was computed. [2019-11-28 00:23:03,520 INFO L246 CegarLoopResult]: For program point L176-1(lines 273 279) no Hoare annotation was computed. [2019-11-28 00:23:03,520 INFO L246 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2019-11-28 00:23:03,520 INFO L246 CegarLoopResult]: For program point L44-1(line 44) no Hoare annotation was computed. [2019-11-28 00:23:03,520 INFO L246 CegarLoopResult]: For program point L44-2(line 44) no Hoare annotation was computed. [2019-11-28 00:23:03,520 INFO L246 CegarLoopResult]: For program point L474(lines 473 518) no Hoare annotation was computed. [2019-11-28 00:23:03,520 INFO L246 CegarLoopResult]: For program point L309(lines 309 317) no Hoare annotation was computed. [2019-11-28 00:23:03,521 INFO L246 CegarLoopResult]: For program point L309-1(lines 309 317) no Hoare annotation was computed. [2019-11-28 00:23:03,521 INFO L246 CegarLoopResult]: For program point L309-2(lines 309 317) no Hoare annotation was computed. [2019-11-28 00:23:03,521 INFO L246 CegarLoopResult]: For program point L309-3(lines 309 317) no Hoare annotation was computed. [2019-11-28 00:23:03,521 INFO L246 CegarLoopResult]: For program point L309-4(lines 309 317) no Hoare annotation was computed. [2019-11-28 00:23:03,521 INFO L246 CegarLoopResult]: For program point L309-5(lines 309 317) no Hoare annotation was computed. [2019-11-28 00:23:03,521 INFO L246 CegarLoopResult]: For program point L475(lines 475 479) no Hoare annotation was computed. [2019-11-28 00:23:03,521 INFO L242 CegarLoopResult]: At program point L145(lines 136 149) the Hoare annotation is: false [2019-11-28 00:23:03,521 INFO L242 CegarLoopResult]: At program point L145-1(lines 136 149) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 1) .cse0 (<= 1 ~waterLevel~0) .cse1 .cse2))) [2019-11-28 00:23:03,521 INFO L242 CegarLoopResult]: At program point L145-2(lines 136 149) the Hoare annotation is: false [2019-11-28 00:23:03,522 INFO L242 CegarLoopResult]: At program point L145-3(lines 136 149) the Hoare annotation is: false [2019-11-28 00:23:03,522 INFO L242 CegarLoopResult]: At program point L145-4(lines 136 149) the Hoare annotation is: false [2019-11-28 00:23:03,522 INFO L242 CegarLoopResult]: At program point L145-5(lines 136 149) the Hoare annotation is: false [2019-11-28 00:23:03,522 INFO L246 CegarLoopResult]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-11-28 00:23:03,522 INFO L246 CegarLoopResult]: For program point L509(lines 509 513) no Hoare annotation was computed. [2019-11-28 00:23:03,522 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 581) no Hoare annotation was computed. [2019-11-28 00:23:03,522 INFO L246 CegarLoopResult]: For program point L509-2(lines 273 279) no Hoare annotation was computed. [2019-11-28 00:23:03,522 INFO L246 CegarLoopResult]: For program point L575-4(lines 575 581) no Hoare annotation was computed. [2019-11-28 00:23:03,523 INFO L242 CegarLoopResult]: At program point L280(lines 280 286) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0) .cse1) (and .cse0 (<= 2 ~waterLevel~0) .cse1))) [2019-11-28 00:23:03,523 INFO L242 CegarLoopResult]: At program point L280-1(lines 280 286) the Hoare annotation is: false [2019-11-28 00:23:03,523 INFO L242 CegarLoopResult]: At program point L280-2(lines 280 286) the Hoare annotation is: false [2019-11-28 00:23:03,523 INFO L246 CegarLoopResult]: For program point L248(lines 248 255) no Hoare annotation was computed. [2019-11-28 00:23:03,523 INFO L249 CegarLoopResult]: At program point L248-1(lines 248 255) the Hoare annotation is: true [2019-11-28 00:23:03,523 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:23:03,523 INFO L246 CegarLoopResult]: For program point L483(lines 483 489) no Hoare annotation was computed. [2019-11-28 00:23:03,523 INFO L242 CegarLoopResult]: At program point L483-1(lines 483 489) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1) (and .cse0 (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) .cse1))) [2019-11-28 00:23:03,523 INFO L242 CegarLoopResult]: At program point L384(lines 379 387) the Hoare annotation is: false [2019-11-28 00:23:03,524 INFO L242 CegarLoopResult]: At program point L384-1(lines 379 387) the Hoare annotation is: false [2019-11-28 00:23:03,524 INFO L242 CegarLoopResult]: At program point L384-2(lines 379 387) the Hoare annotation is: false [2019-11-28 00:23:03,524 INFO L246 CegarLoopResult]: For program point L87(lines 87 91) no Hoare annotation was computed. [2019-11-28 00:23:03,524 INFO L242 CegarLoopResult]: At program point L550(lines 1 953) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-28 00:23:03,524 INFO L246 CegarLoopResult]: For program point L452(lines 452 456) no Hoare annotation was computed. [2019-11-28 00:23:03,524 INFO L246 CegarLoopResult]: For program point L452-2(lines 452 456) no Hoare annotation was computed. [2019-11-28 00:23:03,524 INFO L246 CegarLoopResult]: For program point L452-3(lines 452 456) no Hoare annotation was computed. [2019-11-28 00:23:03,524 INFO L246 CegarLoopResult]: For program point L452-5(lines 452 456) no Hoare annotation was computed. [2019-11-28 00:23:03,525 INFO L246 CegarLoopResult]: For program point L452-6(lines 452 456) no Hoare annotation was computed. [2019-11-28 00:23:03,525 INFO L242 CegarLoopResult]: At program point L221(lines 217 223) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-28 00:23:03,525 INFO L246 CegarLoopResult]: For program point L452-8(lines 452 456) no Hoare annotation was computed. [2019-11-28 00:23:03,525 INFO L242 CegarLoopResult]: At program point L155(lines 150 158) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (<= 1 ~waterLevel~0) (= 0 ULTIMATE.start_test_~splverifierCounter~0)) [2019-11-28 00:23:03,525 INFO L242 CegarLoopResult]: At program point L155-1(lines 150 158) the Hoare annotation is: false [2019-11-28 00:23:03,525 INFO L242 CegarLoopResult]: At program point L155-2(lines 150 158) the Hoare annotation is: false [2019-11-28 00:23:03,525 INFO L242 CegarLoopResult]: At program point L519(lines 472 520) the Hoare annotation is: false [2019-11-28 00:23:03,525 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:23:03,526 INFO L249 CegarLoopResult]: At program point L257(lines 238 260) the Hoare annotation is: true [2019-11-28 00:23:03,526 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:23:03,526 INFO L242 CegarLoopResult]: At program point L458(lines 443 461) the Hoare annotation is: (and (<= 1 ULTIMATE.start_isLowWaterLevel_~tmp___0~1) (= 1 ~systemActive~0) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (<= 1 |ULTIMATE.start_isLowWaterLevel_#res|) (<= 1 ~waterLevel~0) (= 0 ULTIMATE.start_isLowWaterLevel_~tmp~4) (= 0 ULTIMATE.start_test_~splverifierCounter~0)) [2019-11-28 00:23:03,526 INFO L242 CegarLoopResult]: At program point L458-1(lines 443 461) the Hoare annotation is: false [2019-11-28 00:23:03,526 INFO L242 CegarLoopResult]: At program point L458-2(lines 443 461) the Hoare annotation is: false [2019-11-28 00:23:03,526 INFO L242 CegarLoopResult]: At program point L558(lines 553 561) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-28 00:23:03,526 INFO L246 CegarLoopResult]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-11-28 00:23:03,526 INFO L246 CegarLoopResult]: For program point L63-3(lines 63 67) no Hoare annotation was computed. [2019-11-28 00:23:03,526 INFO L246 CegarLoopResult]: For program point L63-6(lines 63 67) no Hoare annotation was computed. [2019-11-28 00:23:03,527 INFO L246 CegarLoopResult]: For program point L493(lines 493 499) no Hoare annotation was computed. [2019-11-28 00:23:03,527 INFO L242 CegarLoopResult]: At program point L493-1(lines 493 499) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1) (and .cse0 (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) .cse1))) [2019-11-28 00:23:03,527 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:23:03,527 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-11-28 00:23:03,527 INFO L242 CegarLoopResult]: At program point L132(lines 127 135) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= 1 |ULTIMATE.start_getWaterLevel_#res|) (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0) .cse1) (and .cse0 (<= 2 ~waterLevel~0) (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse1))) [2019-11-28 00:23:03,527 INFO L242 CegarLoopResult]: At program point L132-1(lines 127 135) the Hoare annotation is: false [2019-11-28 00:23:03,527 INFO L242 CegarLoopResult]: At program point L132-2(lines 127 135) the Hoare annotation is: false [2019-11-28 00:23:03,528 INFO L246 CegarLoopResult]: For program point L331(lines 331 348) no Hoare annotation was computed. [2019-11-28 00:23:03,528 INFO L246 CegarLoopResult]: For program point L331-1(lines 331 348) no Hoare annotation was computed. [2019-11-28 00:23:03,528 INFO L246 CegarLoopResult]: For program point L331-2(lines 331 348) no Hoare annotation was computed. [2019-11-28 00:23:03,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:23:03 BoogieIcfgContainer [2019-11-28 00:23:03,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:23:03,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:23:03,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:23:03,565 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:23:03,566 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:56" (3/4) ... [2019-11-28 00:23:03,572 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:23:03,613 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-11-28 00:23:03,615 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-28 00:23:03,617 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-28 00:23:03,618 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:23:03,619 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:23:03,621 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:23:03,622 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:23:03,659 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 == systemActive && 1 <= tmp) && 1 <= \result) && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 1 == waterLevel) && pumpRunning == 0) && 0 == splverifierCounter)) || ((((1 == systemActive && 2 <= waterLevel) && 2 <= tmp) && 2 <= \result) && 0 == splverifierCounter) [2019-11-28 00:23:03,663 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == systemActive && 1 <= \result) && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 2 <= waterLevel) && 2 <= \result) && 0 == splverifierCounter) [2019-11-28 00:23:03,664 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == systemActive && 0 == \result) && 1 <= waterLevel) && 0 == splverifierCounter [2019-11-28 00:23:03,665 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && 2 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || ((((\result == 1 && 1 == systemActive) && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) [2019-11-28 00:23:03,671 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= tmp___0 && 1 == systemActive) && 0 == \result) && 1 <= \result) && 1 <= waterLevel) && 0 == tmp) && 0 == splverifierCounter [2019-11-28 00:23:03,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && 2 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) [2019-11-28 00:23:03,784 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:23:03,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:23:03,786 INFO L168 Benchmark]: Toolchain (without parser) took 9483.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.3 MB). Free memory was 952.3 MB in the beginning and 949.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:23:03,787 INFO L168 Benchmark]: CDTParser took 0.18 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:23:03,787 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:23:03,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:23:03,788 INFO L168 Benchmark]: Boogie Preprocessor took 50.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:23:03,788 INFO L168 Benchmark]: RCFGBuilder took 1052.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:23:03,789 INFO L168 Benchmark]: TraceAbstraction took 7380.21 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.0 GB in the beginning and 959.4 MB in the end (delta: 43.8 MB). Peak memory consumption was 337.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:23:03,789 INFO L168 Benchmark]: Witness Printer took 222.61 ms. Allocated memory is still 1.3 GB. Free memory was 959.4 MB in the beginning and 949.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:23:03,792 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.18 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 681.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1052.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7380.21 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.0 GB in the beginning and 959.4 MB in the end (delta: 43.8 MB). Peak memory consumption was 337.4 MB. Max. memory is 11.5 GB. * Witness Printer took 222.61 ms. Allocated memory is still 1.3 GB. Free memory was 959.4 MB in the beginning and 949.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((1 == systemActive && 0 == \result) && 1 <= waterLevel) && 0 == splverifierCounter - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((1 == systemActive && 2 <= waterLevel) && 0 == splverifierCounter) || (((1 == systemActive && 1 == waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((1 <= tmp___0 && 1 == systemActive) && 0 == \result) && 1 <= \result) && 1 <= waterLevel) && 0 == tmp) && 0 == splverifierCounter - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((1 == systemActive && 2 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || ((((\result == 1 && 1 == systemActive) && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 483]: Loop Invariant Derived loop invariant: ((1 == systemActive && 2 <= waterLevel) && 0 == splverifierCounter) || (((1 == systemActive && 1 == waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 <= waterLevel) && 0 == splverifierCounter - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: (((1 == systemActive && 2 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((1 == systemActive && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || ((1 == systemActive && 2 <= waterLevel) && 0 == splverifierCounter) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((1 == systemActive && 1 <= tmp) && 1 <= \result) && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 1 == waterLevel) && pumpRunning == 0) && 0 == splverifierCounter)) || ((((1 == systemActive && 2 <= waterLevel) && 2 <= tmp) && 2 <= \result) && 0 == splverifierCounter) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((1 == systemActive && 1 <= \result) && 1 <= waterLevel) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 2 <= waterLevel) && 2 <= \result) && 0 == splverifierCounter) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 117 locations, 3 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, HoareTripleCheckerStatistics: 1169 SDtfs, 1561 SDslu, 1818 SDs, 0 SdLazy, 314 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=11, 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, 12 MinimizatonAttempts, 645 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 42 PreInvPairs, 115 NumberOfFragments, 318 HoareAnnotationTreeSize, 42 FomulaSimplifications, 120838 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 42 FomulaSimplificationsInter, 44834 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 541 ConstructedInterpolants, 0 QuantifiedInterpolants, 45993 SizeOfPredicates, 8 NumberOfNonLiveVariables, 855 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 159/175 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 correct! Received shutdown request...