./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer --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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:42:11,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:42:11,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:42:11,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:42:11,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:42:11,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:42:11,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:42:11,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:42:11,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:42:11,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:42:11,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:42:11,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:42:11,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:42:11,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:42:11,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:42:11,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:42:11,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:42:11,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:42:11,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:42:11,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:42:11,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:42:11,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:42:11,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:42:11,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:42:11,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:42:11,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:42:11,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:42:11,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:42:11,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:42:11,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:42:11,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:42:11,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:42:11,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:42:11,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:42:11,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:42:11,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:42:11,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:42:11,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:42:11,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:42:11,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:42:11,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:42:11,177 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:42:11,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:42:11,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:42:11,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:42:11,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:42:11,191 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:42:11,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:42:11,192 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:42:11,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:42:11,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:42:11,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:42:11,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:42:11,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:42:11,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:42:11,193 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:42:11,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:42:11,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:42:11,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:42:11,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:42:11,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:42:11,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:42:11,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:42:11,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:42:11,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:42:11,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:42:11,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:42:11,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:42:11,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:42:11,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:42:11,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:42:11,196 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-12-07 17:42:11,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:42:11,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:42:11,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:42:11,310 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:42:11,310 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:42:11,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_6.c [2019-12-07 17:42:11,353 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/data/b28597edd/bd40c519d1dd42f0b197dd88727fdd1d/FLAG5010044bf [2019-12-07 17:42:11,783 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:42:11,784 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/sv-benchmarks/c/locks/test_locks_6.c [2019-12-07 17:42:11,789 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/data/b28597edd/bd40c519d1dd42f0b197dd88727fdd1d/FLAG5010044bf [2019-12-07 17:42:11,798 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/data/b28597edd/bd40c519d1dd42f0b197dd88727fdd1d [2019-12-07 17:42:11,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:42:11,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:42:11,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:42:11,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:42:11,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:42:11,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:11,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f56138a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11, skipping insertion in model container [2019-12-07 17:42:11,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:11,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:42:11,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:42:11,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:42:11,928 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:42:11,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:42:11,987 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:42:11,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11 WrapperNode [2019-12-07 17:42:11,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:42:11,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:42:11,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:42:11,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:42:11,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:11,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:12,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:42:12,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:42:12,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:42:12,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:42:12,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:12,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:12,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:12,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:12,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:12,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:12,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... [2019-12-07 17:42:12,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:42:12,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:42:12,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:42:12,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:42:12,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/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-12-07 17:42:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:42:12,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:42:12,232 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:42:12,232 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 17:42:12,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:42:12 BoogieIcfgContainer [2019-12-07 17:42:12,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:42:12,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:42:12,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:42:12,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:42:12,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:42:11" (1/3) ... [2019-12-07 17:42:12,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560924a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:42:12, skipping insertion in model container [2019-12-07 17:42:12,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:42:11" (2/3) ... [2019-12-07 17:42:12,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560924a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:42:12, skipping insertion in model container [2019-12-07 17:42:12,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:42:12" (3/3) ... [2019-12-07 17:42:12,238 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2019-12-07 17:42:12,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:42:12,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:42:12,255 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:42:12,270 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:42:12,270 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:42:12,270 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:42:12,270 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:42:12,270 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:42:12,270 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:42:12,270 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:42:12,270 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:42:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-12-07 17:42:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:42:12,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,285 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash 502900931, now seen corresponding path program 1 times [2019-12-07 17:42:12,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145300656] [2019-12-07 17:42:12,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145300656] [2019-12-07 17:42:12,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734636533] [2019-12-07 17:42:12,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,422 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-12-07 17:42:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,452 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-12-07 17:42:12,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-12-07 17:42:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,460 INFO L225 Difference]: With dead ends: 58 [2019-12-07 17:42:12,460 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 17:42:12,462 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-12-07 17:42:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 17:42:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-12-07 17:42:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 17:42:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2019-12-07 17:42:12,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2019-12-07 17:42:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,487 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2019-12-07 17:42:12,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2019-12-07 17:42:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:42:12,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,488 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1182959301, now seen corresponding path program 1 times [2019-12-07 17:42:12,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019172844] [2019-12-07 17:42:12,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019172844] [2019-12-07 17:42:12,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319263405] [2019-12-07 17:42:12,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,523 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2019-12-07 17:42:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,537 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2019-12-07 17:42:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-12-07 17:42:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,538 INFO L225 Difference]: With dead ends: 73 [2019-12-07 17:42:12,538 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 17:42:12,539 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-12-07 17:42:12,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 17:42:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-12-07 17:42:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 17:42:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-12-07 17:42:12,544 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2019-12-07 17:42:12,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,544 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-12-07 17:42:12,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-12-07 17:42:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:42:12,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,545 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1589725680, now seen corresponding path program 1 times [2019-12-07 17:42:12,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202610064] [2019-12-07 17:42:12,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202610064] [2019-12-07 17:42:12,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957716905] [2019-12-07 17:42:12,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,568 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-12-07 17:42:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,580 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-12-07 17:42:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 17:42:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,581 INFO L225 Difference]: With dead ends: 68 [2019-12-07 17:42:12,581 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 17:42:12,581 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-12-07 17:42:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 17:42:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-12-07 17:42:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 17:42:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2019-12-07 17:42:12,586 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2019-12-07 17:42:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,586 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2019-12-07 17:42:12,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2019-12-07 17:42:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:42:12,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,587 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1982752690, now seen corresponding path program 1 times [2019-12-07 17:42:12,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610671484] [2019-12-07 17:42:12,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610671484] [2019-12-07 17:42:12,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432252806] [2019-12-07 17:42:12,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,607 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2019-12-07 17:42:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,617 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2019-12-07 17:42:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 17:42:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,619 INFO L225 Difference]: With dead ends: 84 [2019-12-07 17:42:12,619 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 17:42:12,619 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-12-07 17:42:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 17:42:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-12-07 17:42:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 17:42:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2019-12-07 17:42:12,626 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2019-12-07 17:42:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,626 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2019-12-07 17:42:12,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2019-12-07 17:42:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:42:12,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1302694320, now seen corresponding path program 1 times [2019-12-07 17:42:12,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405347182] [2019-12-07 17:42:12,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405347182] [2019-12-07 17:42:12,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712760638] [2019-12-07 17:42:12,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,646 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand 3 states. [2019-12-07 17:42:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,660 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2019-12-07 17:42:12,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 17:42:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,662 INFO L225 Difference]: With dead ends: 140 [2019-12-07 17:42:12,662 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 17:42:12,663 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-12-07 17:42:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 17:42:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-12-07 17:42:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 17:42:12,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2019-12-07 17:42:12,671 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2019-12-07 17:42:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,671 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2019-12-07 17:42:12,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2019-12-07 17:42:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:42:12,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,672 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1335576262, now seen corresponding path program 1 times [2019-12-07 17:42:12,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451597650] [2019-12-07 17:42:12,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451597650] [2019-12-07 17:42:12,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560997039] [2019-12-07 17:42:12,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,693 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand 3 states. [2019-12-07 17:42:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,704 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2019-12-07 17:42:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:42:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,706 INFO L225 Difference]: With dead ends: 125 [2019-12-07 17:42:12,706 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 17:42:12,706 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-12-07 17:42:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 17:42:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-12-07 17:42:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 17:42:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2019-12-07 17:42:12,713 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2019-12-07 17:42:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,714 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2019-12-07 17:42:12,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2019-12-07 17:42:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:42:12,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,715 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1728603272, now seen corresponding path program 1 times [2019-12-07 17:42:12,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765532495] [2019-12-07 17:42:12,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765532495] [2019-12-07 17:42:12,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524561963] [2019-12-07 17:42:12,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,732 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand 3 states. [2019-12-07 17:42:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,743 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2019-12-07 17:42:12,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:42:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,744 INFO L225 Difference]: With dead ends: 236 [2019-12-07 17:42:12,744 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 17:42:12,745 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-12-07 17:42:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 17:42:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-12-07 17:42:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 17:42:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2019-12-07 17:42:12,754 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2019-12-07 17:42:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,754 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2019-12-07 17:42:12,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2019-12-07 17:42:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:42:12,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,755 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1886305654, now seen corresponding path program 1 times [2019-12-07 17:42:12,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949201272] [2019-12-07 17:42:12,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949201272] [2019-12-07 17:42:12,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916744945] [2019-12-07 17:42:12,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,771 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand 3 states. [2019-12-07 17:42:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,783 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2019-12-07 17:42:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:42:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,785 INFO L225 Difference]: With dead ends: 192 [2019-12-07 17:42:12,785 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 17:42:12,786 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-12-07 17:42:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 17:42:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2019-12-07 17:42:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 17:42:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2019-12-07 17:42:12,795 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2019-12-07 17:42:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,796 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2019-12-07 17:42:12,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2019-12-07 17:42:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:42:12,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,797 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2046878555, now seen corresponding path program 1 times [2019-12-07 17:42:12,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881198430] [2019-12-07 17:42:12,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881198430] [2019-12-07 17:42:12,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898199164] [2019-12-07 17:42:12,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,816 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 3 states. [2019-12-07 17:42:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,831 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2019-12-07 17:42:12,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 17:42:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,832 INFO L225 Difference]: With dead ends: 276 [2019-12-07 17:42:12,833 INFO L226 Difference]: Without dead ends: 274 [2019-12-07 17:42:12,833 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-12-07 17:42:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-12-07 17:42:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2019-12-07 17:42:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 17:42:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2019-12-07 17:42:12,840 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2019-12-07 17:42:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,840 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2019-12-07 17:42:12,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2019-12-07 17:42:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:42:12,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,842 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1366820185, now seen corresponding path program 1 times [2019-12-07 17:42:12,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015955240] [2019-12-07 17:42:12,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015955240] [2019-12-07 17:42:12,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620296424] [2019-12-07 17:42:12,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,854 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand 3 states. [2019-12-07 17:42:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,867 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2019-12-07 17:42:12,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 17:42:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,868 INFO L225 Difference]: With dead ends: 516 [2019-12-07 17:42:12,869 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 17:42:12,869 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-12-07 17:42:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 17:42:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-12-07 17:42:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-12-07 17:42:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2019-12-07 17:42:12,877 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2019-12-07 17:42:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,877 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2019-12-07 17:42:12,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2019-12-07 17:42:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:42:12,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,878 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash 971489901, now seen corresponding path program 1 times [2019-12-07 17:42:12,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383288645] [2019-12-07 17:42:12,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383288645] [2019-12-07 17:42:12,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002179449] [2019-12-07 17:42:12,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,891 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand 3 states. [2019-12-07 17:42:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,901 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2019-12-07 17:42:12,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:42:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,903 INFO L225 Difference]: With dead ends: 452 [2019-12-07 17:42:12,903 INFO L226 Difference]: Without dead ends: 310 [2019-12-07 17:42:12,904 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-12-07 17:42:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-12-07 17:42:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-12-07 17:42:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-07 17:42:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2019-12-07 17:42:12,911 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2019-12-07 17:42:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,911 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2019-12-07 17:42:12,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2019-12-07 17:42:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:42:12,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash 578462891, now seen corresponding path program 1 times [2019-12-07 17:42:12,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018914105] [2019-12-07 17:42:12,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018914105] [2019-12-07 17:42:12,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100422997] [2019-12-07 17:42:12,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,924 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand 3 states. [2019-12-07 17:42:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,936 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2019-12-07 17:42:12,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:42:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,939 INFO L225 Difference]: With dead ends: 520 [2019-12-07 17:42:12,939 INFO L226 Difference]: Without dead ends: 518 [2019-12-07 17:42:12,939 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-12-07 17:42:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-07 17:42:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2019-12-07 17:42:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-12-07 17:42:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2019-12-07 17:42:12,948 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2019-12-07 17:42:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:12,949 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2019-12-07 17:42:12,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2019-12-07 17:42:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:42:12,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:12,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:12,950 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:12,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:12,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1258521261, now seen corresponding path program 1 times [2019-12-07 17:42:12,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:12,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788510138] [2019-12-07 17:42:12,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:12,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788510138] [2019-12-07 17:42:12,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:12,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:12,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896853800] [2019-12-07 17:42:12,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:12,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:12,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:12,962 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand 3 states. [2019-12-07 17:42:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:12,977 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2019-12-07 17:42:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:12,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:42:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:12,980 INFO L225 Difference]: With dead ends: 1016 [2019-12-07 17:42:12,980 INFO L226 Difference]: Without dead ends: 582 [2019-12-07 17:42:12,982 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-12-07 17:42:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-12-07 17:42:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2019-12-07 17:42:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-07 17:42:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2019-12-07 17:42:13,000 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2019-12-07 17:42:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:13,001 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2019-12-07 17:42:13,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2019-12-07 17:42:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:42:13,002 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:13,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:13,003 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 752696444, now seen corresponding path program 1 times [2019-12-07 17:42:13,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:13,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913616881] [2019-12-07 17:42:13,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:13,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913616881] [2019-12-07 17:42:13,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:13,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:13,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279841776] [2019-12-07 17:42:13,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:13,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:13,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:13,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:13,019 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand 3 states. [2019-12-07 17:42:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:13,032 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2019-12-07 17:42:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:13,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:42:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:13,034 INFO L225 Difference]: With dead ends: 872 [2019-12-07 17:42:13,034 INFO L226 Difference]: Without dead ends: 598 [2019-12-07 17:42:13,035 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-12-07 17:42:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-12-07 17:42:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-12-07 17:42:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-07 17:42:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2019-12-07 17:42:13,047 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2019-12-07 17:42:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:13,047 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2019-12-07 17:42:13,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2019-12-07 17:42:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:42:13,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:13,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:13,048 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:13,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash 359669434, now seen corresponding path program 1 times [2019-12-07 17:42:13,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:13,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134086098] [2019-12-07 17:42:13,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:13,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134086098] [2019-12-07 17:42:13,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:13,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:13,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402816814] [2019-12-07 17:42:13,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:13,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:13,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:13,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:13,060 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand 3 states. [2019-12-07 17:42:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:13,075 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2019-12-07 17:42:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:13,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:42:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:13,079 INFO L225 Difference]: With dead ends: 966 [2019-12-07 17:42:13,079 INFO L226 Difference]: Without dead ends: 964 [2019-12-07 17:42:13,079 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-12-07 17:42:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-12-07 17:42:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2019-12-07 17:42:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-07 17:42:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2019-12-07 17:42:13,098 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2019-12-07 17:42:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:13,098 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2019-12-07 17:42:13,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2019-12-07 17:42:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:42:13,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:13,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:13,100 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:13,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1039727804, now seen corresponding path program 1 times [2019-12-07 17:42:13,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:13,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310857504] [2019-12-07 17:42:13,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:42:13,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310857504] [2019-12-07 17:42:13,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:13,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:42:13,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158677066] [2019-12-07 17:42:13,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:42:13,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:13,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:42:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:42:13,112 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand 3 states. [2019-12-07 17:42:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:13,135 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2019-12-07 17:42:13,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:42:13,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:42:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:13,136 INFO L225 Difference]: With dead ends: 1988 [2019-12-07 17:42:13,136 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:42:13,138 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-12-07 17:42:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:42:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:42:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:42:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:42:13,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-12-07 17:42:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:13,139 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:42:13,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:42:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:42:13,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:42:13,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:42:13,154 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 17:42:13,154 INFO L246 CegarLoopResult]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,154 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:42:13,154 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:42:13,154 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 17:42:13,154 INFO L249 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-12-07 17:42:13,154 INFO L246 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-12-07 17:42:13,155 INFO L246 CegarLoopResult]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,155 INFO L246 CegarLoopResult]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,155 INFO L246 CegarLoopResult]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,155 INFO L246 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-12-07 17:42:13,155 INFO L246 CegarLoopResult]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,155 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 17:42:13,155 INFO L246 CegarLoopResult]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,155 INFO L249 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-12-07 17:42:13,155 INFO L249 CegarLoopResult]: At program point L106(lines 4 107) the Hoare annotation is: true [2019-12-07 17:42:13,155 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 17:42:13,156 INFO L246 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2019-12-07 17:42:13,156 INFO L242 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-12-07 17:42:13,156 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-12-07 17:42:13,156 INFO L246 CegarLoopResult]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,156 INFO L246 CegarLoopResult]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,156 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:42:13,156 INFO L246 CegarLoopResult]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,156 INFO L246 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2019-12-07 17:42:13,157 INFO L246 CegarLoopResult]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,157 INFO L246 CegarLoopResult]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-12-07 17:42:13,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:42:13 BoogieIcfgContainer [2019-12-07 17:42:13,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:42:13,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:42:13,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:42:13,164 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:42:13,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:42:12" (3/4) ... [2019-12-07 17:42:13,167 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:42:13,175 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 17:42:13,175 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:42:13,212 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6b5294d3-b697-4336-916a-c5502884983f/bin/uautomizer/witness.graphml [2019-12-07 17:42:13,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:42:13,214 INFO L168 Benchmark]: Toolchain (without parser) took 1412.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 944.6 MB in the beginning and 899.0 MB in the end (delta: 45.6 MB). Peak memory consumption was 145.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:13,214 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:42:13,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:13,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.33 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-12-07 17:42:13,215 INFO L168 Benchmark]: Boogie Preprocessor took 17.36 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:13,215 INFO L168 Benchmark]: RCFGBuilder took 199.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:13,215 INFO L168 Benchmark]: TraceAbstraction took 929.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 899.0 MB in the end (delta: 174.0 MB). Peak memory consumption was 174.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:42:13,215 INFO L168 Benchmark]: Witness Printer took 48.07 ms. Allocated memory is still 1.1 GB. Free memory is still 899.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:42:13,217 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 186.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.33 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. * Boogie Preprocessor took 17.36 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 929.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 899.0 MB in the end (delta: 174.0 MB). Peak memory consumption was 174.0 MB. Max. memory is 11.5 GB. * Witness Printer took 48.07 ms. Allocated memory is still 1.1 GB. Free memory is still 899.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 0.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 812 SDtfs, 391 SDslu, 511 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, 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, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 6130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...