./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c -s /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/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 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:19,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:19,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:19,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:19,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:19,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:19,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:19,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:19,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:19,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:19,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:19,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:19,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:19,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:19,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:19,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:19,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:19,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:19,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:19,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:19,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:19,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:19,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:19,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:19,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:19,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:19,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:19,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:19,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:19,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:19,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:19,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:19,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:19,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:19,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:19,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:19,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:19,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:19,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:19,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:19,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:19,275 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:19,292 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:19,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:19,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:19,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:19,294 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:19,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:19,294 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:19,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:19,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:19,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:19,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:19,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:19,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:19,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:19,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:19,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:19,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:19,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:19,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:19,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:19,297 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/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/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 -> 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b [2019-10-22 08:58:19,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:19,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:19,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:19,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:19,350 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:19,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-10-22 08:58:19,392 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/data/07728279b/33c6a016da894403b5e6046e55eecc78/FLAG6e174d514 [2019-10-22 08:58:19,858 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:19,859 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-10-22 08:58:19,872 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/data/07728279b/33c6a016da894403b5e6046e55eecc78/FLAG6e174d514 [2019-10-22 08:58:20,370 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/data/07728279b/33c6a016da894403b5e6046e55eecc78 [2019-10-22 08:58:20,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:20,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:20,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:20,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:20,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:20,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:20,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68061c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20, skipping insertion in model container [2019-10-22 08:58:20,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:20,386 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:20,438 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:20,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:20,813 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:20,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:20,929 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:20,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20 WrapperNode [2019-10-22 08:58:20,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:20,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:20,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:20,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:20,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:20,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:21,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:21,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:21,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:21,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:21,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:21,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:21,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:21,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:21,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:21,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:21,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... [2019-10-22 08:58:21,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:21,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:21,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:21,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:21,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/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-10-22 08:58:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:22,146 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:22,146 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:58:22,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:22 BoogieIcfgContainer [2019-10-22 08:58:22,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:22,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:22,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:22,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:22,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:20" (1/3) ... [2019-10-22 08:58:22,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533f0c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:22, skipping insertion in model container [2019-10-22 08:58:22,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:20" (2/3) ... [2019-10-22 08:58:22,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533f0c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:22, skipping insertion in model container [2019-10-22 08:58:22,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:22" (3/3) ... [2019-10-22 08:58:22,156 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label28.c [2019-10-22 08:58:22,164 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:22,171 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:58:22,180 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:58:22,208 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:22,215 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:22,215 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:22,215 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:22,215 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:22,216 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:22,216 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:22,216 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 08:58:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-22 08:58:22,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:22,244 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:22,245 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:22,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1601987962, now seen corresponding path program 1 times [2019-10-22 08:58:22,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:22,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006897841] [2019-10-22 08:58:22,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:22,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:22,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:22,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006897841] [2019-10-22 08:58:22,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:22,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:22,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160821526] [2019-10-22 08:58:22,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:22,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:22,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:22,588 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-10-22 08:58:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:23,373 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-10-22 08:58:23,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:23,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-22 08:58:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:23,393 INFO L225 Difference]: With dead ends: 528 [2019-10-22 08:58:23,393 INFO L226 Difference]: Without dead ends: 266 [2019-10-22 08:58:23,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-22 08:58:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-10-22 08:58:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-22 08:58:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-10-22 08:58:23,460 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 93 [2019-10-22 08:58:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:23,461 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-10-22 08:58:23,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-10-22 08:58:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:58:23,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:23,464 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:23,466 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:23,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1168423854, now seen corresponding path program 1 times [2019-10-22 08:58:23,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:23,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992545762] [2019-10-22 08:58:23,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:23,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:23,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:23,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992545762] [2019-10-22 08:58:23,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:23,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:23,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106771680] [2019-10-22 08:58:23,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:23,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:23,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:23,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:23,537 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-10-22 08:58:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:24,085 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-10-22 08:58:24,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:24,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 08:58:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:24,091 INFO L225 Difference]: With dead ends: 792 [2019-10-22 08:58:24,091 INFO L226 Difference]: Without dead ends: 528 [2019-10-22 08:58:24,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-10-22 08:58:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-10-22 08:58:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-22 08:58:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2019-10-22 08:58:24,138 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 98 [2019-10-22 08:58:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:24,138 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2019-10-22 08:58:24,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2019-10-22 08:58:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 08:58:24,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:24,142 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:24,144 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1574089224, now seen corresponding path program 1 times [2019-10-22 08:58:24,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:24,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903340387] [2019-10-22 08:58:24,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:24,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903340387] [2019-10-22 08:58:24,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:24,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:24,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029643146] [2019-10-22 08:58:24,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:24,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:24,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:24,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:24,204 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2019-10-22 08:58:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:24,830 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2019-10-22 08:58:24,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:24,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 08:58:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:24,841 INFO L225 Difference]: With dead ends: 2102 [2019-10-22 08:58:24,841 INFO L226 Difference]: Without dead ends: 1576 [2019-10-22 08:58:24,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-10-22 08:58:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-10-22 08:58:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 08:58:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2045 transitions. [2019-10-22 08:58:24,895 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2045 transitions. Word has length 102 [2019-10-22 08:58:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:24,895 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2045 transitions. [2019-10-22 08:58:24,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2045 transitions. [2019-10-22 08:58:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 08:58:24,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:24,910 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:24,910 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1573040001, now seen corresponding path program 1 times [2019-10-22 08:58:24,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:24,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478789688] [2019-10-22 08:58:24,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:24,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:58:24,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478789688] [2019-10-22 08:58:24,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:24,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:24,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199815238] [2019-10-22 08:58:24,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:24,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:24,949 INFO L87 Difference]: Start difference. First operand 1576 states and 2045 transitions. Second operand 3 states. [2019-10-22 08:58:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:25,361 INFO L93 Difference]: Finished difference Result 3412 states and 4452 transitions. [2019-10-22 08:58:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:25,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 08:58:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:25,367 INFO L225 Difference]: With dead ends: 3412 [2019-10-22 08:58:25,368 INFO L226 Difference]: Without dead ends: 1838 [2019-10-22 08:58:25,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-10-22 08:58:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2019-10-22 08:58:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-10-22 08:58:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1699 transitions. [2019-10-22 08:58:25,409 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1699 transitions. Word has length 105 [2019-10-22 08:58:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:25,411 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1699 transitions. [2019-10-22 08:58:25,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1699 transitions. [2019-10-22 08:58:25,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-22 08:58:25,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:25,413 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:25,414 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:25,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:25,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1954141031, now seen corresponding path program 1 times [2019-10-22 08:58:25,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:25,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685183551] [2019-10-22 08:58:25,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:25,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:25,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:25,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685183551] [2019-10-22 08:58:25,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:25,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:25,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137637867] [2019-10-22 08:58:25,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:25,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:25,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:25,550 INFO L87 Difference]: Start difference. First operand 1314 states and 1699 transitions. Second operand 4 states. [2019-10-22 08:58:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:26,132 INFO L93 Difference]: Finished difference Result 2762 states and 3550 transitions. [2019-10-22 08:58:26,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:26,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-22 08:58:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:26,136 INFO L225 Difference]: With dead ends: 2762 [2019-10-22 08:58:26,137 INFO L226 Difference]: Without dead ends: 1450 [2019-10-22 08:58:26,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-22 08:58:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-10-22 08:58:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 08:58:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1836 transitions. [2019-10-22 08:58:26,164 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1836 transitions. Word has length 108 [2019-10-22 08:58:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:26,165 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1836 transitions. [2019-10-22 08:58:26,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1836 transitions. [2019-10-22 08:58:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-22 08:58:26,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:26,171 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:26,171 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:26,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash -376310369, now seen corresponding path program 1 times [2019-10-22 08:58:26,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:26,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647257044] [2019-10-22 08:58:26,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:26,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:26,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:26,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647257044] [2019-10-22 08:58:26,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:26,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:26,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767023139] [2019-10-22 08:58:26,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:26,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:26,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:26,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:26,239 INFO L87 Difference]: Start difference. First operand 1445 states and 1836 transitions. Second operand 5 states. [2019-10-22 08:58:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:26,989 INFO L93 Difference]: Finished difference Result 2757 states and 3533 transitions. [2019-10-22 08:58:26,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:26,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-22 08:58:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:26,994 INFO L225 Difference]: With dead ends: 2757 [2019-10-22 08:58:26,994 INFO L226 Difference]: Without dead ends: 1445 [2019-10-22 08:58:26,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-22 08:58:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-10-22 08:58:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 08:58:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1806 transitions. [2019-10-22 08:58:27,020 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1806 transitions. Word has length 112 [2019-10-22 08:58:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:27,020 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1806 transitions. [2019-10-22 08:58:27,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1806 transitions. [2019-10-22 08:58:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-22 08:58:27,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:27,023 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:27,023 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1702667398, now seen corresponding path program 1 times [2019-10-22 08:58:27,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:27,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106334074] [2019-10-22 08:58:27,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:27,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106334074] [2019-10-22 08:58:27,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:27,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:27,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032794557] [2019-10-22 08:58:27,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:27,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:27,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:27,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:27,063 INFO L87 Difference]: Start difference. First operand 1445 states and 1806 transitions. Second operand 3 states. [2019-10-22 08:58:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:27,405 INFO L93 Difference]: Finished difference Result 3150 states and 3956 transitions. [2019-10-22 08:58:27,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:27,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-22 08:58:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:27,409 INFO L225 Difference]: With dead ends: 3150 [2019-10-22 08:58:27,410 INFO L226 Difference]: Without dead ends: 1707 [2019-10-22 08:58:27,411 INFO L600 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-10-22 08:58:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-10-22 08:58:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-10-22 08:58:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 08:58:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1665 transitions. [2019-10-22 08:58:27,435 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1665 transitions. Word has length 115 [2019-10-22 08:58:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:27,436 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1665 transitions. [2019-10-22 08:58:27,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1665 transitions. [2019-10-22 08:58:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-22 08:58:27,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:27,438 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:27,438 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:27,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash 970685544, now seen corresponding path program 1 times [2019-10-22 08:58:27,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:27,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355959911] [2019-10-22 08:58:27,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-22 08:58:27,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355959911] [2019-10-22 08:58:27,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:27,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:27,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712172112] [2019-10-22 08:58:27,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:27,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:27,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:27,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:27,515 INFO L87 Difference]: Start difference. First operand 1445 states and 1665 transitions. Second operand 3 states. [2019-10-22 08:58:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:27,848 INFO L93 Difference]: Finished difference Result 2888 states and 3326 transitions. [2019-10-22 08:58:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:27,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-22 08:58:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:27,853 INFO L225 Difference]: With dead ends: 2888 [2019-10-22 08:58:27,854 INFO L226 Difference]: Without dead ends: 1445 [2019-10-22 08:58:27,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-22 08:58:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-10-22 08:58:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 08:58:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1593 transitions. [2019-10-22 08:58:27,882 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1593 transitions. Word has length 123 [2019-10-22 08:58:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:27,882 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1593 transitions. [2019-10-22 08:58:27,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1593 transitions. [2019-10-22 08:58:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-22 08:58:27,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:27,885 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:27,885 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:27,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2027458046, now seen corresponding path program 1 times [2019-10-22 08:58:27,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:27,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385756924] [2019-10-22 08:58:27,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:27,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:28,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385756924] [2019-10-22 08:58:28,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:28,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-22 08:58:28,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478807900] [2019-10-22 08:58:28,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:58:28,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:28,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:58:28,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:58:28,548 INFO L87 Difference]: Start difference. First operand 1445 states and 1593 transitions. Second operand 12 states. [2019-10-22 08:58:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:29,555 INFO L93 Difference]: Finished difference Result 3260 states and 3653 transitions. [2019-10-22 08:58:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 08:58:29,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2019-10-22 08:58:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:29,561 INFO L225 Difference]: With dead ends: 3260 [2019-10-22 08:58:29,561 INFO L226 Difference]: Without dead ends: 1914 [2019-10-22 08:58:29,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-10-22 08:58:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-10-22 08:58:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2019-10-22 08:58:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-10-22 08:58:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1908 transitions. [2019-10-22 08:58:29,591 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1908 transitions. Word has length 130 [2019-10-22 08:58:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:29,591 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1908 transitions. [2019-10-22 08:58:29,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:58:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1908 transitions. [2019-10-22 08:58:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-22 08:58:29,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:29,596 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:29,596 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:29,596 INFO L82 PathProgramCache]: Analyzing trace with hash 591091391, now seen corresponding path program 1 times [2019-10-22 08:58:29,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:29,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417303917] [2019-10-22 08:58:29,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:29,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-22 08:58:29,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417303917] [2019-10-22 08:58:29,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:29,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:29,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21587500] [2019-10-22 08:58:29,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:29,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:29,771 INFO L87 Difference]: Start difference. First operand 1742 states and 1908 transitions. Second operand 4 states. [2019-10-22 08:58:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:30,296 INFO L93 Difference]: Finished difference Result 3613 states and 3988 transitions. [2019-10-22 08:58:30,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:30,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-10-22 08:58:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:30,300 INFO L225 Difference]: With dead ends: 3613 [2019-10-22 08:58:30,300 INFO L226 Difference]: Without dead ends: 1873 [2019-10-22 08:58:30,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-10-22 08:58:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1742. [2019-10-22 08:58:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-10-22 08:58:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1878 transitions. [2019-10-22 08:58:30,325 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1878 transitions. Word has length 200 [2019-10-22 08:58:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:30,326 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1878 transitions. [2019-10-22 08:58:30,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1878 transitions. [2019-10-22 08:58:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-22 08:58:30,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:30,329 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:30,329 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:30,330 INFO L82 PathProgramCache]: Analyzing trace with hash 490719990, now seen corresponding path program 1 times [2019-10-22 08:58:30,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:30,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538967137] [2019-10-22 08:58:30,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-22 08:58:30,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538967137] [2019-10-22 08:58:30,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:30,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:30,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199783582] [2019-10-22 08:58:30,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:30,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:30,455 INFO L87 Difference]: Start difference. First operand 1742 states and 1878 transitions. Second operand 3 states. [2019-10-22 08:58:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:30,726 INFO L93 Difference]: Finished difference Result 1744 states and 1879 transitions. [2019-10-22 08:58:30,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:30,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-22 08:58:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:30,730 INFO L225 Difference]: With dead ends: 1744 [2019-10-22 08:58:30,731 INFO L226 Difference]: Without dead ends: 1742 [2019-10-22 08:58:30,731 INFO L600 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-10-22 08:58:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-10-22 08:58:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2019-10-22 08:58:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-10-22 08:58:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1877 transitions. [2019-10-22 08:58:30,752 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1877 transitions. Word has length 208 [2019-10-22 08:58:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:30,752 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1877 transitions. [2019-10-22 08:58:30,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1877 transitions. [2019-10-22 08:58:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-22 08:58:30,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:30,757 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:30,757 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1524272564, now seen corresponding path program 1 times [2019-10-22 08:58:30,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:30,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381654541] [2019-10-22 08:58:30,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:30,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-22 08:58:31,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381654541] [2019-10-22 08:58:31,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327709769] [2019-10-22 08:58:31,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:31,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:31,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-10-22 08:58:31,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:58:31,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-10-22 08:58:31,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386075128] [2019-10-22 08:58:31,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:31,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:31,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:58:31,923 INFO L87 Difference]: Start difference. First operand 1742 states and 1877 transitions. Second operand 3 states. [2019-10-22 08:58:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:32,232 INFO L93 Difference]: Finished difference Result 1742 states and 1877 transitions. [2019-10-22 08:58:32,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:32,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-10-22 08:58:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:32,234 INFO L225 Difference]: With dead ends: 1742 [2019-10-22 08:58:32,234 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:58:32,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:58:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:58:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:58:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:58:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:58:32,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2019-10-22 08:58:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:32,236 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:32,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:32,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:58:32,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:32,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:58:32,593 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-10-22 08:58:32,699 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-10-22 08:58:32,701 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 08:58:32,701 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 08:58:32,701 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,701 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,702 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,702 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,702 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,702 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,702 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 08:58:32,702 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 08:58:32,702 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 08:58:32,702 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,703 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 08:58:32,704 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 08:58:32,705 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 08:58:32,706 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 08:58:32,706 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (= ~a7~0 1))) (let ((.cse0 (<= ~a21~0 0)) (.cse1 (not (= ~a16~0 6))) (.cse4 (= ~a17~0 1)) (.cse3 (not .cse2)) (.cse6 (= ~a16~0 4)) (.cse5 (= ~a21~0 1))) (or (and (= 1 ~a7~0) .cse0 .cse1) (and .cse0 .cse2 (= ~a12~0 8) (= ~a20~0 1)) (and .cse3 .cse4 .cse5) (and .cse5 (= 5 ~a16~0)) (and .cse3 .cse5 (= 15 ~a8~0)) (and .cse1 .cse4 .cse5) (and .cse6 (<= ~a17~0 0) .cse5) (and .cse3 .cse6 .cse5)))) [2019-10-22 08:58:32,707 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,707 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,707 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,707 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,707 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,707 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 08:58:32,707 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 08:58:32,707 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 08:58:32,708 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 08:58:32,709 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 08:58:32,710 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 08:58:32,710 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,710 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,710 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,710 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,710 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 08:58:32,710 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,710 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 08:58:32,711 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (= ~a7~0 1))) (let ((.cse0 (<= ~a21~0 0)) (.cse1 (not (= ~a16~0 6))) (.cse4 (= ~a17~0 1)) (.cse3 (not .cse2)) (.cse6 (= ~a16~0 4)) (.cse5 (= ~a21~0 1))) (or (and (= 1 ~a7~0) .cse0 .cse1) (and .cse0 .cse2 (= ~a12~0 8) (= ~a20~0 1)) (and .cse3 .cse4 .cse5) (and .cse5 (= 5 ~a16~0)) (and .cse3 .cse5 (= 15 ~a8~0)) (and .cse1 .cse4 .cse5) (and .cse6 (<= ~a17~0 0) .cse5) (and .cse3 .cse6 .cse5)))) [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 08:58:32,712 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 08:58:32,713 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 08:58:32,714 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 08:58:32,714 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 08:58:32,714 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 08:58:32,714 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 08:58:32,714 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 08:58:32,714 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,714 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,714 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,715 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,715 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 08:58:32,715 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,715 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,715 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 08:58:32,715 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 08:58:32,715 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,716 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 08:58:32,717 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 08:58:32,718 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 08:58:32,718 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 08:58:32,718 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:58:32,718 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 08:58:32,718 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 08:58:32,718 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 08:58:32,718 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,718 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 08:58:32,719 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 08:58:32,720 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 08:58:32,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:32 BoogieIcfgContainer [2019-10-22 08:58:32,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:32,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:32,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:32,736 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:32,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:22" (3/4) ... [2019-10-22 08:58:32,744 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:58:32,761 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:58:32,765 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:58:32,900 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_27db5dca-be5a-4c85-abe7-388c73013500/bin/uautomizer/witness.graphml [2019-10-22 08:58:32,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:32,904 INFO L168 Benchmark]: Toolchain (without parser) took 12530.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.5 MB). Free memory was 939.2 MB in the beginning and 1.0 GB in the end (delta: -72.1 MB). Peak memory consumption was 348.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:32,905 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:32,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:32,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:32,905 INFO L168 Benchmark]: Boogie Preprocessor took 43.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:32,906 INFO L168 Benchmark]: RCFGBuilder took 1095.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 973.6 MB in the end (delta: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:32,906 INFO L168 Benchmark]: TraceAbstraction took 10587.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 294.1 MB). Free memory was 973.6 MB in the beginning and 1.0 GB in the end (delta: -66.1 MB). Peak memory consumption was 228.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:32,906 INFO L168 Benchmark]: Witness Printer took 167.03 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:32,908 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1095.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 973.6 MB in the end (delta: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10587.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 294.1 MB). Free memory was 973.6 MB in the beginning and 1.0 GB in the end (delta: -66.1 MB). Peak memory consumption was 228.0 MB. Max. memory is 11.5 GB. * Witness Printer took 167.03 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((a21 <= 0 && a7 == 1) && a12 == 8) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || (a21 == 1 && 5 == a16)) || ((!(a7 == 1) && a21 == 1) && 15 == a8)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || ((!(a7 == 1) && a16 == 4) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((a21 <= 0 && a7 == 1) && a12 == 8) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || (a21 == 1 && 5 == a16)) || ((!(a7 == 1) && a21 == 1) && 15 == a8)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || ((!(a7 == 1) && a16 == 4) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 10.5s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 887 SDtfs, 2590 SDslu, 128 SDs, 0 SdLazy, 5907 SolverSat, 779 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 306 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1094 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 173 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1550 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1947 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696138 SizeOfPredicates, 1 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1511/1519 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...