./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label42.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/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 e264c6bfc59204684e8ff5f8f4a46a363046b0d1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:58:28,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:58:28,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:58:28,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:58:28,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:58:28,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:58:28,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:58:28,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:58:28,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:58:28,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:58:28,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:58:28,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:58:28,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:58:28,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:58:28,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:58:28,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:58:28,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:58:28,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:58:28,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:58:28,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:58:28,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:58:28,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:58:28,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:58:28,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:58:28,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:58:28,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:58:28,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:58:28,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:58:28,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:58:28,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:58:28,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:58:28,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:58:28,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:58:28,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:58:28,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:58:28,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:58:28,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:58:28,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:58:28,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:58:28,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:58:28,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:58:28,171 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:58:28,184 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:58:28,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:58:28,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:58:28,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:58:28,185 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:58:28,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:58:28,185 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:58:28,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:58:28,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:58:28,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:58:28,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:58:28,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:58:28,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:58:28,186 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:58:28,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:58:28,186 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:58:28,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:58:28,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:58:28,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:58:28,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:58:28,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:58:28,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:58:28,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:58:28,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:58:28,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:58:28,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:58:28,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:58:28,188 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:58:28,188 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:58:28,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/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 -> e264c6bfc59204684e8ff5f8f4a46a363046b0d1 [2019-12-07 10:58:28,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:58:28,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:58:28,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:58:28,330 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:58:28,330 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:58:28,331 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label42.c [2019-12-07 10:58:28,380 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/data/a76e12b6d/3b3ea5ebd6664a169aa4db1ff45e1bff/FLAG147d74fac [2019-12-07 10:58:28,891 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:58:28,892 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/sv-benchmarks/c/eca-rers2012/Problem03_label42.c [2019-12-07 10:58:28,903 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/data/a76e12b6d/3b3ea5ebd6664a169aa4db1ff45e1bff/FLAG147d74fac [2019-12-07 10:58:29,183 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/data/a76e12b6d/3b3ea5ebd6664a169aa4db1ff45e1bff [2019-12-07 10:58:29,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:58:29,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:58:29,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:58:29,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:58:29,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:58:29,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:29,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25877ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29, skipping insertion in model container [2019-12-07 10:58:29,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:29,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:58:29,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:58:29,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:58:29,680 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:58:29,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:58:29,886 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:58:29,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29 WrapperNode [2019-12-07 10:58:29,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:58:29,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:58:29,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:58:29,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:58:29,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:29,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:29,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:58:29,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:58:29,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:58:29,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:58:29,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:29,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:29,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:29,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:30,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:30,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:30,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... [2019-12-07 10:58:30,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:58:30,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:58:30,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:58:30,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:58:30,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:58:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:58:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:58:31,303 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:58:31,304 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:58:31,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:58:31 BoogieIcfgContainer [2019-12-07 10:58:31,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:58:31,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:58:31,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:58:31,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:58:31,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:58:29" (1/3) ... [2019-12-07 10:58:31,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193630a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:58:31, skipping insertion in model container [2019-12-07 10:58:31,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:58:29" (2/3) ... [2019-12-07 10:58:31,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193630a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:58:31, skipping insertion in model container [2019-12-07 10:58:31,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:58:31" (3/3) ... [2019-12-07 10:58:31,310 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label42.c [2019-12-07 10:58:31,318 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:58:31,324 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:58:31,333 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:58:31,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:58:31,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:58:31,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:58:31,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:58:31,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:58:31,356 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:58:31,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:58:31,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:58:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 10:58:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-07 10:58:31,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:31,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:31,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:31,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:31,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1065786898, now seen corresponding path program 1 times [2019-12-07 10:58:31,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:31,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035428272] [2019-12-07 10:58:31,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:58:31,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035428272] [2019-12-07 10:58:31,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:31,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:58:31,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684048692] [2019-12-07 10:58:31,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:31,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:31,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:31,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:31,843 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-12-07 10:58:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:32,783 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-12-07 10:58:32,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:32,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-12-07 10:58:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:32,799 INFO L225 Difference]: With dead ends: 829 [2019-12-07 10:58:32,799 INFO L226 Difference]: Without dead ends: 463 [2019-12-07 10:58:32,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-12-07 10:58:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-12-07 10:58:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-07 10:58:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-12-07 10:58:32,859 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 196 [2019-12-07 10:58:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:32,860 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-12-07 10:58:32,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:32,861 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-12-07 10:58:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-07 10:58:32,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:32,866 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:32,867 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:32,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:32,867 INFO L82 PathProgramCache]: Analyzing trace with hash -32063774, now seen corresponding path program 1 times [2019-12-07 10:58:32,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:32,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782609394] [2019-12-07 10:58:32,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:58:32,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782609394] [2019-12-07 10:58:32,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:32,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:58:32,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139407588] [2019-12-07 10:58:32,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:58:32,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:32,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:58:32,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:58:32,961 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-12-07 10:58:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:34,042 INFO L93 Difference]: Finished difference Result 1735 states and 2827 transitions. [2019-12-07 10:58:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:58:34,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-12-07 10:58:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:34,049 INFO L225 Difference]: With dead ends: 1735 [2019-12-07 10:58:34,049 INFO L226 Difference]: Without dead ends: 1288 [2019-12-07 10:58:34,051 INFO L630 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-12-07 10:58:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-12-07 10:58:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 859. [2019-12-07 10:58:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-07 10:58:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-12-07 10:58:34,078 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 201 [2019-12-07 10:58:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:34,078 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-12-07 10:58:34,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:58:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-12-07 10:58:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-12-07 10:58:34,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:34,082 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:34,083 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:34,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2017736626, now seen corresponding path program 1 times [2019-12-07 10:58:34,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:34,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210002170] [2019-12-07 10:58:34,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:58:34,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210002170] [2019-12-07 10:58:34,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:34,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:58:34,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865100474] [2019-12-07 10:58:34,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:34,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:34,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:34,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:34,150 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-12-07 10:58:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:34,492 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-12-07 10:58:34,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:34,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-12-07 10:58:34,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:34,495 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 10:58:34,495 INFO L226 Difference]: Without dead ends: 838 [2019-12-07 10:58:34,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-12-07 10:58:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-12-07 10:58:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-07 10:58:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-12-07 10:58:34,508 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 209 [2019-12-07 10:58:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:34,509 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-12-07 10:58:34,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-12-07 10:58:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-07 10:58:34,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:34,511 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:34,511 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:34,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:34,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1890661660, now seen corresponding path program 1 times [2019-12-07 10:58:34,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:34,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410286641] [2019-12-07 10:58:34,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 10:58:34,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410286641] [2019-12-07 10:58:34,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:34,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:58:34,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538607084] [2019-12-07 10:58:34,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:58:34,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:34,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:58:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:58:34,573 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-12-07 10:58:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:35,592 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-12-07 10:58:35,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:58:35,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-12-07 10:58:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:35,606 INFO L225 Difference]: With dead ends: 3313 [2019-12-07 10:58:35,606 INFO L226 Difference]: Without dead ends: 2477 [2019-12-07 10:58:35,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:58:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-12-07 10:58:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-12-07 10:58:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-12-07 10:58:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-12-07 10:58:35,643 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 210 [2019-12-07 10:58:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:35,643 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-12-07 10:58:35,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:58:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-12-07 10:58:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 10:58:35,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:35,647 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:35,647 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:35,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1263756579, now seen corresponding path program 1 times [2019-12-07 10:58:35,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:35,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655958910] [2019-12-07 10:58:35,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:58:35,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655958910] [2019-12-07 10:58:35,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:35,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:58:35,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569813460] [2019-12-07 10:58:35,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:35,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:35,709 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-12-07 10:58:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:36,272 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-12-07 10:58:36,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:36,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-12-07 10:58:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:36,282 INFO L225 Difference]: With dead ends: 4133 [2019-12-07 10:58:36,282 INFO L226 Difference]: Without dead ends: 2480 [2019-12-07 10:58:36,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-12-07 10:58:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-12-07 10:58:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-12-07 10:58:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-12-07 10:58:36,325 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 213 [2019-12-07 10:58:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:36,325 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-12-07 10:58:36,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-12-07 10:58:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-12-07 10:58:36,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:36,330 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:36,331 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash -115502888, now seen corresponding path program 1 times [2019-12-07 10:58:36,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:36,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113227660] [2019-12-07 10:58:36,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:58:36,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113227660] [2019-12-07 10:58:36,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:36,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:58:36,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706187808] [2019-12-07 10:58:36,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:36,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:36,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:36,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:36,438 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-12-07 10:58:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:36,695 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-12-07 10:58:36,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:36,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-12-07 10:58:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:36,712 INFO L225 Difference]: With dead ends: 7424 [2019-12-07 10:58:36,712 INFO L226 Difference]: Without dead ends: 4947 [2019-12-07 10:58:36,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-12-07 10:58:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-12-07 10:58:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-12-07 10:58:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-12-07 10:58:36,777 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 216 [2019-12-07 10:58:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:36,777 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-12-07 10:58:36,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-12-07 10:58:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-07 10:58:36,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:36,782 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:36,782 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:36,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1543109555, now seen corresponding path program 1 times [2019-12-07 10:58:36,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:36,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626045024] [2019-12-07 10:58:36,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:58:36,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626045024] [2019-12-07 10:58:36,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:36,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:58:36,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901944699] [2019-12-07 10:58:36,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:36,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:36,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:36,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:36,842 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-12-07 10:58:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:37,478 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-12-07 10:58:37,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:37,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-12-07 10:58:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:37,509 INFO L225 Difference]: With dead ends: 14560 [2019-12-07 10:58:37,509 INFO L226 Difference]: Without dead ends: 9617 [2019-12-07 10:58:37,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-12-07 10:58:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-12-07 10:58:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-12-07 10:58:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12497 transitions. [2019-12-07 10:58:37,617 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12497 transitions. Word has length 218 [2019-12-07 10:58:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:37,618 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12497 transitions. [2019-12-07 10:58:37,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12497 transitions. [2019-12-07 10:58:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 10:58:37,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:37,625 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:37,625 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:37,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:37,626 INFO L82 PathProgramCache]: Analyzing trace with hash 23285592, now seen corresponding path program 2 times [2019-12-07 10:58:37,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:37,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574428837] [2019-12-07 10:58:37,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:58:37,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574428837] [2019-12-07 10:58:37,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:37,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:58:37,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218596346] [2019-12-07 10:58:37,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:37,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:37,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:37,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:37,720 INFO L87 Difference]: Start difference. First operand 9615 states and 12497 transitions. Second operand 3 states. [2019-12-07 10:58:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:38,397 INFO L93 Difference]: Finished difference Result 26540 states and 34570 transitions. [2019-12-07 10:58:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:38,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-12-07 10:58:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:38,434 INFO L225 Difference]: With dead ends: 26540 [2019-12-07 10:58:38,434 INFO L226 Difference]: Without dead ends: 16927 [2019-12-07 10:58:38,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-12-07 10:58:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-12-07 10:58:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-12-07 10:58:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20092 transitions. [2019-12-07 10:58:38,608 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20092 transitions. Word has length 220 [2019-12-07 10:58:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:38,608 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20092 transitions. [2019-12-07 10:58:38,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20092 transitions. [2019-12-07 10:58:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-12-07 10:58:38,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:38,620 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:38,620 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash 633556933, now seen corresponding path program 1 times [2019-12-07 10:58:38,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:38,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992793250] [2019-12-07 10:58:38,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 10:58:38,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992793250] [2019-12-07 10:58:38,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:38,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:58:38,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068049962] [2019-12-07 10:58:38,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:58:38,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:38,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:58:38,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:58:38,700 INFO L87 Difference]: Start difference. First operand 16923 states and 20092 transitions. Second operand 4 states. [2019-12-07 10:58:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:39,321 INFO L93 Difference]: Finished difference Result 33846 states and 40186 transitions. [2019-12-07 10:58:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:39,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-12-07 10:58:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:39,351 INFO L225 Difference]: With dead ends: 33846 [2019-12-07 10:58:39,351 INFO L226 Difference]: Without dead ends: 16925 [2019-12-07 10:58:39,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:58:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16925 states. [2019-12-07 10:58:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16925 to 16923. [2019-12-07 10:58:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-12-07 10:58:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 19543 transitions. [2019-12-07 10:58:39,584 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 19543 transitions. Word has length 238 [2019-12-07 10:58:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:39,584 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 19543 transitions. [2019-12-07 10:58:39,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:58:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 19543 transitions. [2019-12-07 10:58:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-12-07 10:58:39,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:39,596 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:39,596 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1654047318, now seen corresponding path program 1 times [2019-12-07 10:58:39,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:39,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934302047] [2019-12-07 10:58:39,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:58:39,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934302047] [2019-12-07 10:58:39,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022054003] [2019-12-07 10:58:39,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/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-12-07 10:58:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:39,837 INFO L264 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:58:39,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:58:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:58:39,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:58:39,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 10:58:39,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389041854] [2019-12-07 10:58:39,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:39,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:39,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:39,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:58:39,907 INFO L87 Difference]: Start difference. First operand 16923 states and 19543 transitions. Second operand 3 states. [2019-12-07 10:58:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:40,568 INFO L93 Difference]: Finished difference Result 33645 states and 38869 transitions. [2019-12-07 10:58:40,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:40,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-12-07 10:58:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:40,588 INFO L225 Difference]: With dead ends: 33645 [2019-12-07 10:58:40,588 INFO L226 Difference]: Without dead ends: 16724 [2019-12-07 10:58:40,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:58:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16724 states. [2019-12-07 10:58:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16724 to 15705. [2019-12-07 10:58:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15705 states. [2019-12-07 10:58:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15705 states to 15705 states and 17742 transitions. [2019-12-07 10:58:40,731 INFO L78 Accepts]: Start accepts. Automaton has 15705 states and 17742 transitions. Word has length 244 [2019-12-07 10:58:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:40,732 INFO L462 AbstractCegarLoop]: Abstraction has 15705 states and 17742 transitions. [2019-12-07 10:58:40,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 15705 states and 17742 transitions. [2019-12-07 10:58:40,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-12-07 10:58:40,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:40,743 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 10:58:40,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:58:40,945 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:40,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash 157230195, now seen corresponding path program 1 times [2019-12-07 10:58:40,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:40,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611814761] [2019-12-07 10:58:40,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:58:41,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611814761] [2019-12-07 10:58:41,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76810161] [2019-12-07 10:58:41,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:58:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:41,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:58:41,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:58:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 10:58:41,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:58:41,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-12-07 10:58:41,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340015258] [2019-12-07 10:58:41,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:41,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:41,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:41,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:58:41,320 INFO L87 Difference]: Start difference. First operand 15705 states and 17742 transitions. Second operand 3 states. [2019-12-07 10:58:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:41,633 INFO L93 Difference]: Finished difference Result 45849 states and 51764 transitions. [2019-12-07 10:58:41,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:41,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-12-07 10:58:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:41,664 INFO L225 Difference]: With dead ends: 45849 [2019-12-07 10:58:41,664 INFO L226 Difference]: Without dead ends: 30146 [2019-12-07 10:58:41,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:58:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30146 states. [2019-12-07 10:58:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30146 to 30144. [2019-12-07 10:58:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30144 states. [2019-12-07 10:58:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30144 states to 30144 states and 34011 transitions. [2019-12-07 10:58:41,939 INFO L78 Accepts]: Start accepts. Automaton has 30144 states and 34011 transitions. Word has length 273 [2019-12-07 10:58:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:41,939 INFO L462 AbstractCegarLoop]: Abstraction has 30144 states and 34011 transitions. [2019-12-07 10:58:41,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 30144 states and 34011 transitions. [2019-12-07 10:58:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-12-07 10:58:41,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:41,963 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:58:42,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:58:42,164 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1715760606, now seen corresponding path program 1 times [2019-12-07 10:58:42,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:42,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867144339] [2019-12-07 10:58:42,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 10:58:42,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867144339] [2019-12-07 10:58:42,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:42,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:58:42,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257014518] [2019-12-07 10:58:42,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:42,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:42,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:42,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:42,363 INFO L87 Difference]: Start difference. First operand 30144 states and 34011 transitions. Second operand 3 states. [2019-12-07 10:58:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:42,857 INFO L93 Difference]: Finished difference Result 83876 states and 94508 transitions. [2019-12-07 10:58:42,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:42,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-12-07 10:58:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:42,904 INFO L225 Difference]: With dead ends: 83876 [2019-12-07 10:58:42,904 INFO L226 Difference]: Without dead ends: 53734 [2019-12-07 10:58:42,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53734 states. [2019-12-07 10:58:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53734 to 53732. [2019-12-07 10:58:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53732 states. [2019-12-07 10:58:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53732 states to 53732 states and 60487 transitions. [2019-12-07 10:58:43,373 INFO L78 Accepts]: Start accepts. Automaton has 53732 states and 60487 transitions. Word has length 347 [2019-12-07 10:58:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:43,373 INFO L462 AbstractCegarLoop]: Abstraction has 53732 states and 60487 transitions. [2019-12-07 10:58:43,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 53732 states and 60487 transitions. [2019-12-07 10:58:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-12-07 10:58:43,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:43,400 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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] [2019-12-07 10:58:43,400 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1270062948, now seen corresponding path program 1 times [2019-12-07 10:58:43,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:43,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575662983] [2019-12-07 10:58:43,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-12-07 10:58:43,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575662983] [2019-12-07 10:58:43,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:43,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:58:43,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082780021] [2019-12-07 10:58:43,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:58:43,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:58:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:58:43,502 INFO L87 Difference]: Start difference. First operand 53732 states and 60487 transitions. Second operand 4 states. [2019-12-07 10:58:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:44,657 INFO L93 Difference]: Finished difference Result 120863 states and 136956 transitions. [2019-12-07 10:58:44,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:58:44,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 359 [2019-12-07 10:58:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:44,718 INFO L225 Difference]: With dead ends: 120863 [2019-12-07 10:58:44,719 INFO L226 Difference]: Without dead ends: 67133 [2019-12-07 10:58:44,737 INFO L630 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-12-07 10:58:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67133 states. [2019-12-07 10:58:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67133 to 67125. [2019-12-07 10:58:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67125 states. [2019-12-07 10:58:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67125 states to 67125 states and 74028 transitions. [2019-12-07 10:58:45,322 INFO L78 Accepts]: Start accepts. Automaton has 67125 states and 74028 transitions. Word has length 359 [2019-12-07 10:58:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:45,322 INFO L462 AbstractCegarLoop]: Abstraction has 67125 states and 74028 transitions. [2019-12-07 10:58:45,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:58:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 67125 states and 74028 transitions. [2019-12-07 10:58:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-12-07 10:58:45,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:58:45,350 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:58:45,350 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:58:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:58:45,351 INFO L82 PathProgramCache]: Analyzing trace with hash 316644986, now seen corresponding path program 1 times [2019-12-07 10:58:45,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:58:45,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984052808] [2019-12-07 10:58:45,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:58:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:58:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-12-07 10:58:45,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984052808] [2019-12-07 10:58:45,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:58:45,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:58:45,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521494677] [2019-12-07 10:58:45,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:58:45,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:58:45,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:58:45,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:45,615 INFO L87 Difference]: Start difference. First operand 67125 states and 74028 transitions. Second operand 3 states. [2019-12-07 10:58:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:58:46,550 INFO L93 Difference]: Finished difference Result 148092 states and 163567 transitions. [2019-12-07 10:58:46,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:58:46,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 423 [2019-12-07 10:58:46,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:58:46,551 INFO L225 Difference]: With dead ends: 148092 [2019-12-07 10:58:46,551 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:58:46,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:58:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:58:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:58:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:58:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:58:46,579 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 423 [2019-12-07 10:58:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:58:46,579 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:58:46,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:58:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:58:46,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:58:46,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:58:47,160 WARN L192 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 441 DAG size of output: 151 [2019-12-07 10:58:47,611 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 441 DAG size of output: 151 [2019-12-07 10:58:48,339 WARN L192 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 63 [2019-12-07 10:58:49,060 WARN L192 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 63 [2019-12-07 10:58:49,062 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 10:58:49,062 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 10:58:49,062 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,062 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 10:58:49,063 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,064 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 10:58:49,065 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,066 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,067 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 10:58:49,068 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,069 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 10:58:49,070 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse7 (= 1 ~a6~0))) (let ((.cse4 (= ~a27~0 1)) (.cse11 (= 1 ~a4~0)) (.cse5 (not (= ~a12~0 1))) (.cse8 (= 1 ~a0~0)) (.cse2 (not .cse7)) (.cse10 (= 1 ~a3~0)) (.cse6 (= ~a11~0 1)) (.cse12 (<= ~a3~0 0)) (.cse0 (= 1 ~a5~0)) (.cse1 (<= ~a11~0 0)) (.cse3 (= ~a26~0 1)) (.cse9 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2 .cse6 .cse3) (and .cse0 .cse7 .cse5 .cse1 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse8) (and .cse0 .cse7 .cse5 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse11) (and .cse4 .cse0 .cse1 .cse8) (and .cse12 .cse0 .cse6 .cse2 .cse3 .cse9) (and .cse0 .cse1 .cse3 .cse8) (and .cse12 .cse0 .cse4 .cse7 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse8 .cse9 .cse11) (and .cse12 .cse0 .cse1 .cse8 .cse9) (and .cse0 .cse7 .cse5 .cse1 .cse11) (and .cse12 .cse4 .cse0 .cse7 .cse6 .cse8) (and .cse12 .cse0 .cse6 .cse3 .cse9 .cse11) (and .cse4 .cse0 .cse7 .cse1 .cse11) (and .cse0 .cse4 .cse7 .cse1 .cse5) (and .cse0 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse2 .cse3 .cse11) (and .cse12 .cse0 .cse6 .cse3 .cse8) (and .cse12 .cse0 .cse4 .cse5 .cse2 .cse6 .cse11) (and .cse12 .cse4 .cse0 .cse7 .cse6 .cse3) (and .cse0 .cse1 .cse3 .cse11) (and .cse0 .cse5 .cse2 .cse6 .cse9) (and .cse0 .cse7 .cse5 .cse1 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse8) (and .cse4 .cse0 .cse7 .cse6 .cse9 .cse11) (and .cse0 .cse5 .cse2 .cse6 .cse8) (and .cse12 .cse0 .cse1 .cse2) (and .cse10 .cse0 .cse7 .cse6 .cse9) (and .cse12 .cse0 .cse1 .cse3 .cse9)))) [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,071 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1623) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 10:58:49,072 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 10:58:49,073 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse7 (= 1 ~a6~0))) (let ((.cse4 (= ~a27~0 1)) (.cse11 (= 1 ~a4~0)) (.cse5 (not (= ~a12~0 1))) (.cse8 (= 1 ~a0~0)) (.cse2 (not .cse7)) (.cse10 (= 1 ~a3~0)) (.cse6 (= ~a11~0 1)) (.cse12 (<= ~a3~0 0)) (.cse0 (= 1 ~a5~0)) (.cse1 (<= ~a11~0 0)) (.cse3 (= ~a26~0 1)) (.cse9 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2 .cse6 .cse3) (and .cse0 .cse7 .cse5 .cse1 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse8) (and .cse0 .cse7 .cse5 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse11) (and .cse4 .cse0 .cse1 .cse8) (and .cse12 .cse0 .cse6 .cse2 .cse3 .cse9) (and .cse0 .cse1 .cse3 .cse8) (and .cse12 .cse0 .cse4 .cse7 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse8 .cse9 .cse11) (and .cse12 .cse0 .cse1 .cse8 .cse9) (and .cse0 .cse7 .cse5 .cse1 .cse11) (and .cse12 .cse4 .cse0 .cse7 .cse6 .cse8) (and .cse12 .cse0 .cse6 .cse3 .cse9 .cse11) (and .cse4 .cse0 .cse7 .cse1 .cse11) (and .cse0 .cse4 .cse7 .cse1 .cse5) (and .cse0 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse2 .cse3 .cse11) (and .cse12 .cse0 .cse6 .cse3 .cse8) (and .cse12 .cse0 .cse4 .cse5 .cse2 .cse6 .cse11) (and .cse12 .cse4 .cse0 .cse7 .cse6 .cse3) (and .cse0 .cse1 .cse3 .cse11) (and .cse0 .cse5 .cse2 .cse6 .cse9) (and .cse0 .cse7 .cse5 .cse1 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse8) (and .cse4 .cse0 .cse7 .cse6 .cse9 .cse11) (and .cse0 .cse5 .cse2 .cse6 .cse8) (and .cse12 .cse0 .cse1 .cse2) (and .cse10 .cse0 .cse7 .cse6 .cse9) (and .cse12 .cse0 .cse1 .cse3 .cse9)))) [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,074 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,075 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,076 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 10:58:49,077 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 10:58:49,078 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,079 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 10:58:49,080 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:58:49,081 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,082 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 10:58:49,082 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 10:58:49,082 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,082 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 10:58:49,082 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 10:58:49,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:58:49 BoogieIcfgContainer [2019-12-07 10:58:49,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:58:49,106 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:58:49,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:58:49,107 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:58:49,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:58:31" (3/4) ... [2019-12-07 10:58:49,109 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:58:49,131 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 10:58:49,133 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:58:49,256 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a07dc1c8-4804-4798-a26c-1782f20defe0/bin/uautomizer/witness.graphml [2019-12-07 10:58:49,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:58:49,257 INFO L168 Benchmark]: Toolchain (without parser) took 20067.44 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 928.5 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 406.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:58:49,257 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:58:49,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 928.5 MB in the beginning and 1.0 GB in the end (delta: -118.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:58:49,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:58:49,258 INFO L168 Benchmark]: Boogie Preprocessor took 75.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:58:49,258 INFO L168 Benchmark]: RCFGBuilder took 1249.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.3 MB). Peak memory consumption was 188.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:58:49,258 INFO L168 Benchmark]: TraceAbstraction took 17800.67 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 995.2 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 10:58:49,259 INFO L168 Benchmark]: Witness Printer took 149.49 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:58:49,260 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 693.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 928.5 MB in the beginning and 1.0 GB in the end (delta: -118.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1249.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.3 MB). Peak memory consumption was 188.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17800.67 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 995.2 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 149.49 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1623]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a0)) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || (((((a27 == 1 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((1 == a3 && 1 == a5) && a11 <= 0) && 1 == a0) && 1 == a4)) || (((a27 == 1 && 1 == a5) && a11 <= 0) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1)) || (((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((1 == a5 && 1 == a6) && a11 <= 0) && 1 == a0) && a16 == 1) && 1 == a4)) || ((((a3 <= 0 && 1 == a5) && a11 <= 0) && 1 == a0) && a16 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a4)) || ((((1 == a5 && a27 == 1) && 1 == a6) && a11 <= 0) && !(a12 == 1))) || (((1 == a5 && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a4)) || ((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || (((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a4)) || ((((1 == a5 && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a16 == 1)) || ((((1 == a3 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((1 == a5 && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6))) || ((((1 == a3 && 1 == a5) && 1 == a6) && a11 == 1) && a16 == 1)) || ((((a3 <= 0 && 1 == a5) && a11 <= 0) && a26 == 1) && a16 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((1 == a5 && a11 <= 0) && !(1 == a6)) && a26 == 1) || (((((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a0)) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || (((((a27 == 1 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((1 == a3 && 1 == a5) && a11 <= 0) && 1 == a0) && 1 == a4)) || (((a27 == 1 && 1 == a5) && a11 <= 0) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1)) || (((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || (((((1 == a5 && 1 == a6) && a11 <= 0) && 1 == a0) && a16 == 1) && 1 == a4)) || ((((a3 <= 0 && 1 == a5) && a11 <= 0) && 1 == a0) && a16 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && 1 == a0)) || (((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a5) && 1 == a6) && a11 <= 0) && 1 == a4)) || ((((1 == a5 && a27 == 1) && 1 == a6) && a11 <= 0) && !(a12 == 1))) || (((1 == a5 && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(1 == a6)) && a26 == 1) && 1 == a4)) || ((((a3 <= 0 && 1 == a5) && a11 == 1) && a26 == 1) && 1 == a0)) || ((((((a3 <= 0 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || (((1 == a5 && a11 <= 0) && a26 == 1) && 1 == a4)) || ((((1 == a5 && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a16 == 1)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a16 == 1)) || ((((1 == a3 && 1 == a5) && a11 <= 0) && !(1 == a6)) && 1 == a0)) || (((((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((1 == a5 && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && 1 == a0)) || (((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6))) || ((((1 == a3 && 1 == a5) && 1 == a6) && a11 == 1) && a16 == 1)) || ((((a3 <= 0 && 1 == a5) && a11 <= 0) && a26 == 1) && a16 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 15.2s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 2602 SDtfs, 4065 SDslu, 901 SDs, 0 SdLazy, 7530 SolverSat, 1813 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 530 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67125occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 2307 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 761 NumberOfFragments, 1099 HoareAnnotationTreeSize, 3 FomulaSimplifications, 24528 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7328 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 4084 NumberOfCodeBlocks, 4084 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4068 ConstructedInterpolants, 0 QuantifiedInterpolants, 1794842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 892 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 1195/1202 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...