./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label50.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_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label50.c -s /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/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 7492cd022f1e8554d216271372c4fc16e69b1112 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:50:16,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:50:16,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:50:16,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:50:16,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:50:16,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:50:16,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:50:16,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:50:16,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:50:16,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:50:16,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:50:16,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:50:16,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:50:16,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:50:16,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:50:16,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:50:16,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:50:16,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:50:16,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:50:16,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:50:16,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:50:16,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:50:16,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:50:16,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:50:16,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:50:16,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:50:16,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:50:16,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:50:16,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:50:16,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:50:16,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:50:16,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:50:16,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:50:16,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:50:16,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:50:16,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:50:16,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:50:16,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:50:16,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:50:16,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:50:16,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:50:16,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:50:16,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:50:16,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:50:16,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:50:16,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:50:16,255 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:50:16,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:50:16,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:50:16,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:50:16,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:50:16,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:50:16,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:50:16,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:50:16,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:50:16,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:50:16,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:50:16,257 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:50:16,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:50:16,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:50:16,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:50:16,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:50:16,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:50:16,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:50:16,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:50:16,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:50:16,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:50:16,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:50:16,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:50:16,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:50:16,258 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:50:16,258 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_eb1c3da2-b8de-4630-bfb2-40740261308a/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 -> 7492cd022f1e8554d216271372c4fc16e69b1112 [2019-12-07 16:50:16,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:50:16,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:50:16,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:50:16,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:50:16,373 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:50:16,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2019-12-07 16:50:16,413 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/data/dbc2dab15/3ed945ec1a444c1c8f19895cbf455749/FLAGfd67e9370 [2019-12-07 16:50:16,961 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:50:16,962 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2019-12-07 16:50:16,973 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/data/dbc2dab15/3ed945ec1a444c1c8f19895cbf455749/FLAGfd67e9370 [2019-12-07 16:50:17,409 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/data/dbc2dab15/3ed945ec1a444c1c8f19895cbf455749 [2019-12-07 16:50:17,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:50:17,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:50:17,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:50:17,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:50:17,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:50:17,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:17,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119a7e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17, skipping insertion in model container [2019-12-07 16:50:17,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:17,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:50:17,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:50:17,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:50:17,825 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:50:17,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:50:17,941 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:50:17,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17 WrapperNode [2019-12-07 16:50:17,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:50:17,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:50:17,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:50:17,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:50:17,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:17,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:18,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:50:18,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:50:18,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:50:18,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:50:18,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:18,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:18,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:18,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:18,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:18,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:18,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... [2019-12-07 16:50:18,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:50:18,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:50:18,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:50:18,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:50:18,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/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 16:50:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:50:18,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:50:19,202 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:50:19,202 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:50:19,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:50:19 BoogieIcfgContainer [2019-12-07 16:50:19,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:50:19,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:50:19,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:50:19,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:50:19,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:50:17" (1/3) ... [2019-12-07 16:50:19,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e2dbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:50:19, skipping insertion in model container [2019-12-07 16:50:19,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:50:17" (2/3) ... [2019-12-07 16:50:19,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e2dbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:50:19, skipping insertion in model container [2019-12-07 16:50:19,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:50:19" (3/3) ... [2019-12-07 16:50:19,209 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label50.c [2019-12-07 16:50:19,216 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:50:19,221 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:50:19,228 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:50:19,248 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:50:19,248 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:50:19,248 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:50:19,248 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:50:19,248 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:50:19,248 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:50:19,249 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:50:19,249 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:50:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 16:50:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:50:19,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:19,271 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] [2019-12-07 16:50:19,272 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:19,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2019-12-07 16:50:19,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:19,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944073558] [2019-12-07 16:50:19,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:19,473 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 16:50:19,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944073558] [2019-12-07 16:50:19,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:19,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:19,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888329126] [2019-12-07 16:50:19,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:19,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:19,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:19,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:19,495 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 16:50:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:20,728 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-12-07 16:50:20,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:20,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 16:50:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:20,741 INFO L225 Difference]: With dead ends: 973 [2019-12-07 16:50:20,741 INFO L226 Difference]: Without dead ends: 607 [2019-12-07 16:50:20,745 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 16:50:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-07 16:50:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-12-07 16:50:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-07 16:50:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-12-07 16:50:20,795 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 36 [2019-12-07 16:50:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:20,795 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-12-07 16:50:20,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-12-07 16:50:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 16:50:20,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:20,799 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:20,799 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash -464053414, now seen corresponding path program 1 times [2019-12-07 16:50:20,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:20,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056618034] [2019-12-07 16:50:20,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:20,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056618034] [2019-12-07 16:50:20,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:20,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:20,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561277764] [2019-12-07 16:50:20,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:20,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:20,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:20,899 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-12-07 16:50:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:21,879 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-12-07 16:50:21,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:21,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 16:50:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:21,887 INFO L225 Difference]: With dead ends: 2328 [2019-12-07 16:50:21,887 INFO L226 Difference]: Without dead ends: 1726 [2019-12-07 16:50:21,889 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 16:50:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-12-07 16:50:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-12-07 16:50:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-12-07 16:50:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-12-07 16:50:21,924 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 104 [2019-12-07 16:50:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:21,924 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-12-07 16:50:21,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-12-07 16:50:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 16:50:21,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:21,927 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:21,928 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash 898348729, now seen corresponding path program 1 times [2019-12-07 16:50:21,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:21,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885102137] [2019-12-07 16:50:21,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:22,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885102137] [2019-12-07 16:50:22,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:22,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:50:22,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924830110] [2019-12-07 16:50:22,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:22,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:22,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:22,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:22,034 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-12-07 16:50:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:22,677 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-12-07 16:50:22,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:22,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-12-07 16:50:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:22,693 INFO L225 Difference]: With dead ends: 4707 [2019-12-07 16:50:22,694 INFO L226 Difference]: Without dead ends: 2999 [2019-12-07 16:50:22,696 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 16:50:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-12-07 16:50:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-12-07 16:50:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-12-07 16:50:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-12-07 16:50:22,739 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 130 [2019-12-07 16:50:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:22,739 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-12-07 16:50:22,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-12-07 16:50:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 16:50:22,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:22,741 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:22,741 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1163752101, now seen corresponding path program 1 times [2019-12-07 16:50:22,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:22,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903195836] [2019-12-07 16:50:22,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 16:50:22,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903195836] [2019-12-07 16:50:22,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803826429] [2019-12-07 16:50:22,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/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 16:50:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:22,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:50:22,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:50:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:22,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:50:22,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 16:50:22,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116954721] [2019-12-07 16:50:22,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:22,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:22,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:22,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:22,939 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-12-07 16:50:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:23,590 INFO L93 Difference]: Finished difference Result 7652 states and 9361 transitions. [2019-12-07 16:50:23,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:23,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-12-07 16:50:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:23,606 INFO L225 Difference]: With dead ends: 7652 [2019-12-07 16:50:23,606 INFO L226 Difference]: Without dead ends: 4655 [2019-12-07 16:50:23,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 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 16:50:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2019-12-07 16:50:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 3550. [2019-12-07 16:50:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2019-12-07 16:50:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4399 transitions. [2019-12-07 16:50:23,666 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4399 transitions. Word has length 158 [2019-12-07 16:50:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:23,666 INFO L462 AbstractCegarLoop]: Abstraction has 3550 states and 4399 transitions. [2019-12-07 16:50:23,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4399 transitions. [2019-12-07 16:50:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 16:50:23,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:23,668 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:23,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:50:23,868 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:23,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:23,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1754552329, now seen corresponding path program 1 times [2019-12-07 16:50:23,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:23,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880107430] [2019-12-07 16:50:23,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:23,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880107430] [2019-12-07 16:50:23,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:23,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:50:23,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192049477] [2019-12-07 16:50:23,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:23,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:23,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:23,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:23,963 INFO L87 Difference]: Start difference. First operand 3550 states and 4399 transitions. Second operand 4 states. [2019-12-07 16:50:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:25,059 INFO L93 Difference]: Finished difference Result 8407 states and 10478 transitions. [2019-12-07 16:50:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:25,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 16:50:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:25,076 INFO L225 Difference]: With dead ends: 8407 [2019-12-07 16:50:25,076 INFO L226 Difference]: Without dead ends: 4859 [2019-12-07 16:50:25,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:50:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2019-12-07 16:50:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4102. [2019-12-07 16:50:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2019-12-07 16:50:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5013 transitions. [2019-12-07 16:50:25,133 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5013 transitions. Word has length 163 [2019-12-07 16:50:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:25,134 INFO L462 AbstractCegarLoop]: Abstraction has 4102 states and 5013 transitions. [2019-12-07 16:50:25,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5013 transitions. [2019-12-07 16:50:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-12-07 16:50:25,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:25,137 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, 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] [2019-12-07 16:50:25,137 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1310756102, now seen corresponding path program 1 times [2019-12-07 16:50:25,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:25,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367720328] [2019-12-07 16:50:25,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:25,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367720328] [2019-12-07 16:50:25,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670173262] [2019-12-07 16:50:25,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/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 16:50:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:25,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:50:25,461 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:50:25,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:25,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:25,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:50:25,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2019-12-07 16:50:25,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575074083] [2019-12-07 16:50:25,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:50:25,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:50:25,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:50:25,819 INFO L87 Difference]: Start difference. First operand 4102 states and 5013 transitions. Second operand 8 states. [2019-12-07 16:50:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:30,996 INFO L93 Difference]: Finished difference Result 17803 states and 21348 transitions. [2019-12-07 16:50:30,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:50:30,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2019-12-07 16:50:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:31,039 INFO L225 Difference]: With dead ends: 17803 [2019-12-07 16:50:31,039 INFO L226 Difference]: Without dead ends: 13334 [2019-12-07 16:50:31,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:50:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13334 states. [2019-12-07 16:50:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13334 to 11847. [2019-12-07 16:50:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11847 states. [2019-12-07 16:50:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13963 transitions. [2019-12-07 16:50:31,217 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13963 transitions. Word has length 248 [2019-12-07 16:50:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:31,218 INFO L462 AbstractCegarLoop]: Abstraction has 11847 states and 13963 transitions. [2019-12-07 16:50:31,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:50:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13963 transitions. [2019-12-07 16:50:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-12-07 16:50:31,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:31,228 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:50:31,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:50:31,429 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1638131916, now seen corresponding path program 1 times [2019-12-07 16:50:31,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:31,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723523566] [2019-12-07 16:50:31,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 218 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:31,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723523566] [2019-12-07 16:50:31,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362019322] [2019-12-07 16:50:31,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:50:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:31,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:50:31,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:50:31,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:32,183 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 28 [2019-12-07 16:50:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 101 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 16:50:32,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:50:32,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-12-07 16:50:32,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510548822] [2019-12-07 16:50:32,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:50:32,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:50:32,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:50:32,616 INFO L87 Difference]: Start difference. First operand 11847 states and 13963 transitions. Second operand 9 states. [2019-12-07 16:50:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:41,132 INFO L93 Difference]: Finished difference Result 30168 states and 35764 transitions. [2019-12-07 16:50:41,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:50:41,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 345 [2019-12-07 16:50:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:41,168 INFO L225 Difference]: With dead ends: 30168 [2019-12-07 16:50:41,168 INFO L226 Difference]: Without dead ends: 20354 [2019-12-07 16:50:41,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:50:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20354 states. [2019-12-07 16:50:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20354 to 17011. [2019-12-07 16:50:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17011 states. [2019-12-07 16:50:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17011 states to 17011 states and 19720 transitions. [2019-12-07 16:50:41,336 INFO L78 Accepts]: Start accepts. Automaton has 17011 states and 19720 transitions. Word has length 345 [2019-12-07 16:50:41,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:41,336 INFO L462 AbstractCegarLoop]: Abstraction has 17011 states and 19720 transitions. [2019-12-07 16:50:41,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:50:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 17011 states and 19720 transitions. [2019-12-07 16:50:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-12-07 16:50:41,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:41,349 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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 16:50:41,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:50:41,550 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:41,551 INFO L82 PathProgramCache]: Analyzing trace with hash -620962545, now seen corresponding path program 1 times [2019-12-07 16:50:41,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:41,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238687886] [2019-12-07 16:50:41,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 16:50:41,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238687886] [2019-12-07 16:50:41,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:41,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:50:41,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415437139] [2019-12-07 16:50:41,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:41,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:41,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:41,754 INFO L87 Difference]: Start difference. First operand 17011 states and 19720 transitions. Second operand 4 states. [2019-12-07 16:50:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:42,866 INFO L93 Difference]: Finished difference Result 37366 states and 43502 transitions. [2019-12-07 16:50:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:42,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-12-07 16:50:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:42,894 INFO L225 Difference]: With dead ends: 37366 [2019-12-07 16:50:42,894 INFO L226 Difference]: Without dead ends: 20725 [2019-12-07 16:50:42,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:50:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20725 states. [2019-12-07 16:50:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20725 to 19035. [2019-12-07 16:50:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19035 states. [2019-12-07 16:50:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19035 states to 19035 states and 21900 transitions. [2019-12-07 16:50:43,116 INFO L78 Accepts]: Start accepts. Automaton has 19035 states and 21900 transitions. Word has length 357 [2019-12-07 16:50:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:43,117 INFO L462 AbstractCegarLoop]: Abstraction has 19035 states and 21900 transitions. [2019-12-07 16:50:43,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19035 states and 21900 transitions. [2019-12-07 16:50:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-12-07 16:50:43,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:43,130 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 16:50:43,130 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash -108272370, now seen corresponding path program 1 times [2019-12-07 16:50:43,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:43,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831562204] [2019-12-07 16:50:43,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 16:50:43,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831562204] [2019-12-07 16:50:43,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:43,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:50:43,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292744274] [2019-12-07 16:50:43,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:50:43,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:43,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:50:43,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:50:43,338 INFO L87 Difference]: Start difference. First operand 19035 states and 21900 transitions. Second operand 5 states. [2019-12-07 16:50:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:44,475 INFO L93 Difference]: Finished difference Result 36254 states and 41917 transitions. [2019-12-07 16:50:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:50:44,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 358 [2019-12-07 16:50:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:44,491 INFO L225 Difference]: With dead ends: 36254 [2019-12-07 16:50:44,492 INFO L226 Difference]: Without dead ends: 21099 [2019-12-07 16:50:44,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:50:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-07 16:50:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 19967. [2019-12-07 16:50:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19967 states. [2019-12-07 16:50:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19967 states to 19967 states and 22740 transitions. [2019-12-07 16:50:44,673 INFO L78 Accepts]: Start accepts. Automaton has 19967 states and 22740 transitions. Word has length 358 [2019-12-07 16:50:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:44,673 INFO L462 AbstractCegarLoop]: Abstraction has 19967 states and 22740 transitions. [2019-12-07 16:50:44,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:50:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19967 states and 22740 transitions. [2019-12-07 16:50:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-12-07 16:50:44,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:44,682 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:50:44,682 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:44,682 INFO L82 PathProgramCache]: Analyzing trace with hash 535880552, now seen corresponding path program 1 times [2019-12-07 16:50:44,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:44,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906330231] [2019-12-07 16:50:44,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-07 16:50:44,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906330231] [2019-12-07 16:50:44,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:44,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:44,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457377121] [2019-12-07 16:50:44,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:44,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:44,949 INFO L87 Difference]: Start difference. First operand 19967 states and 22740 transitions. Second operand 4 states. [2019-12-07 16:50:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:45,921 INFO L93 Difference]: Finished difference Result 39938 states and 45481 transitions. [2019-12-07 16:50:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:45,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-12-07 16:50:45,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:45,939 INFO L225 Difference]: With dead ends: 39938 [2019-12-07 16:50:45,939 INFO L226 Difference]: Without dead ends: 19973 [2019-12-07 16:50:45,949 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 16:50:45,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19973 states. [2019-12-07 16:50:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19973 to 17942. [2019-12-07 16:50:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17942 states. [2019-12-07 16:50:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 20269 transitions. [2019-12-07 16:50:46,100 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 20269 transitions. Word has length 361 [2019-12-07 16:50:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:46,100 INFO L462 AbstractCegarLoop]: Abstraction has 17942 states and 20269 transitions. [2019-12-07 16:50:46,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 20269 transitions. [2019-12-07 16:50:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-12-07 16:50:46,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:46,110 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:46,110 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:46,111 INFO L82 PathProgramCache]: Analyzing trace with hash 19325802, now seen corresponding path program 1 times [2019-12-07 16:50:46,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:46,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463013761] [2019-12-07 16:50:46,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 16:50:46,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463013761] [2019-12-07 16:50:46,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:46,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:50:46,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920305968] [2019-12-07 16:50:46,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:50:46,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:46,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:50:46,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:50:46,278 INFO L87 Difference]: Start difference. First operand 17942 states and 20269 transitions. Second operand 3 states. [2019-12-07 16:50:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:47,610 INFO L93 Difference]: Finished difference Result 34770 states and 39330 transitions. [2019-12-07 16:50:47,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:50:47,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 395 [2019-12-07 16:50:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:47,630 INFO L225 Difference]: With dead ends: 34770 [2019-12-07 16:50:47,630 INFO L226 Difference]: Without dead ends: 19044 [2019-12-07 16:50:47,636 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 16:50:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19044 states. [2019-12-07 16:50:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19044 to 17743. [2019-12-07 16:50:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17743 states. [2019-12-07 16:50:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17743 states to 17743 states and 19773 transitions. [2019-12-07 16:50:47,789 INFO L78 Accepts]: Start accepts. Automaton has 17743 states and 19773 transitions. Word has length 395 [2019-12-07 16:50:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:47,790 INFO L462 AbstractCegarLoop]: Abstraction has 17743 states and 19773 transitions. [2019-12-07 16:50:47,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:50:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 17743 states and 19773 transitions. [2019-12-07 16:50:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-12-07 16:50:47,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:47,803 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-12-07 16:50:47,803 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash -168560213, now seen corresponding path program 1 times [2019-12-07 16:50:47,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:47,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511431730] [2019-12-07 16:50:47,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 388 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:48,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511431730] [2019-12-07 16:50:48,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982805089] [2019-12-07 16:50:48,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:50:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:48,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:50:48,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:50:48,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:48,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 191 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:48,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:50:48,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-12-07 16:50:48,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842960675] [2019-12-07 16:50:48,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:50:48,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:48,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:50:48,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:50:48,941 INFO L87 Difference]: Start difference. First operand 17743 states and 19773 transitions. Second operand 10 states. [2019-12-07 16:50:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:58,430 INFO L93 Difference]: Finished difference Result 36971 states and 41074 transitions. [2019-12-07 16:50:58,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 16:50:58,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 431 [2019-12-07 16:50:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:58,444 INFO L225 Difference]: With dead ends: 36971 [2019-12-07 16:50:58,445 INFO L226 Difference]: Without dead ends: 22921 [2019-12-07 16:50:58,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-12-07 16:50:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22921 states. [2019-12-07 16:50:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22921 to 16448. [2019-12-07 16:50:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16448 states. [2019-12-07 16:50:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16448 states to 16448 states and 18237 transitions. [2019-12-07 16:50:58,607 INFO L78 Accepts]: Start accepts. Automaton has 16448 states and 18237 transitions. Word has length 431 [2019-12-07 16:50:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:58,607 INFO L462 AbstractCegarLoop]: Abstraction has 16448 states and 18237 transitions. [2019-12-07 16:50:58,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:50:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16448 states and 18237 transitions. [2019-12-07 16:50:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-12-07 16:50:58,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:58,626 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:58,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:50:58,828 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:50:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:58,829 INFO L82 PathProgramCache]: Analyzing trace with hash -794974525, now seen corresponding path program 1 times [2019-12-07 16:50:58,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:50:58,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070282417] [2019-12-07 16:50:58,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:50:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-12-07 16:50:59,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070282417] [2019-12-07 16:50:59,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:59,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:50:59,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426128348] [2019-12-07 16:50:59,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:50:59,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:50:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:50:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:50:59,141 INFO L87 Difference]: Start difference. First operand 16448 states and 18237 transitions. Second operand 5 states. [2019-12-07 16:51:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:00,820 INFO L93 Difference]: Finished difference Result 36769 states and 40703 transitions. [2019-12-07 16:51:00,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:51:00,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 527 [2019-12-07 16:51:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:00,834 INFO L225 Difference]: With dead ends: 36769 [2019-12-07 16:51:00,834 INFO L226 Difference]: Without dead ends: 22353 [2019-12-07 16:51:00,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:51:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22353 states. [2019-12-07 16:51:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22353 to 17921. [2019-12-07 16:51:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17921 states. [2019-12-07 16:51:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17921 states to 17921 states and 19769 transitions. [2019-12-07 16:51:00,996 INFO L78 Accepts]: Start accepts. Automaton has 17921 states and 19769 transitions. Word has length 527 [2019-12-07 16:51:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:00,997 INFO L462 AbstractCegarLoop]: Abstraction has 17921 states and 19769 transitions. [2019-12-07 16:51:00,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:51:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17921 states and 19769 transitions. [2019-12-07 16:51:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-12-07 16:51:01,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:01,011 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:51:01,011 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:51:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1413485239, now seen corresponding path program 1 times [2019-12-07 16:51:01,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:51:01,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146498103] [2019-12-07 16:51:01,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:51:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-12-07 16:51:01,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146498103] [2019-12-07 16:51:01,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:01,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:51:01,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116005077] [2019-12-07 16:51:01,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:51:01,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:51:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:51:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:51:01,253 INFO L87 Difference]: Start difference. First operand 17921 states and 19769 transitions. Second operand 3 states. [2019-12-07 16:51:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:02,134 INFO L93 Difference]: Finished difference Result 36390 states and 40168 transitions. [2019-12-07 16:51:02,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:51:02,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 553 [2019-12-07 16:51:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:02,135 INFO L225 Difference]: With dead ends: 36390 [2019-12-07 16:51:02,136 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:51:02,143 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 16:51:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:51:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:51:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:51:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:51:02,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 553 [2019-12-07 16:51:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:02,144 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:51:02,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:51:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:51:02,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:51:02,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:51:02,610 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 516 DAG size of output: 336 [2019-12-07 16:51:03,021 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 516 DAG size of output: 336 [2019-12-07 16:51:04,111 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 306 DAG size of output: 71 [2019-12-07 16:51:06,097 WARN L192 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 306 DAG size of output: 71 [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 16:51:06,099 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,099 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 16:51:06,100 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse2 (= ~a25~0 10))) (let ((.cse0 (= ~a25~0 13)) (.cse6 (<= ~a29~0 245)) (.cse3 (<= (+ ~a23~0 43) 0)) (.cse8 (<= ~a29~0 275)) (.cse9 (= ~a25~0 12)) (.cse5 (<= ~a23~0 312)) (.cse7 (exists ((v_~a29~0_502 Int)) (let ((.cse10 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse10 299861) 300138)) (<= 0 .cse10))))) (.cse1 (= 1 ~a4~0)) (.cse4 (not .cse2))) (or (and .cse0 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse1) (and .cse1 (= ~a25~0 11)) (and (<= ~a29~0 130) .cse2) (and (not .cse0) (<= ~a29~0 599998) .cse3 .cse4) (and .cse0 .cse5 .cse6) (and (= ~a25~0 9) .cse1) (and .cse1 .cse2 .cse3) (and .cse7 (or (<= ~a23~0 138) .cse6) .cse1) (and .cse8 .cse3 .cse4) (and .cse9 .cse8) (and .cse5 (<= ~a29~0 140)) (and (< 306 ~a23~0) .cse1 .cse2) (and .cse9 .cse5 .cse1) (and .cse7 .cse1 .cse4)))) [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,101 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 16:51:06,102 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,103 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,104 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 16:51:06,105 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 16:51:06,106 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 16:51:06,107 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,108 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,109 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 16:51:06,110 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,111 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,112 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse2 (= ~a25~0 10))) (let ((.cse0 (= ~a25~0 13)) (.cse6 (<= ~a29~0 245)) (.cse3 (<= (+ ~a23~0 43) 0)) (.cse8 (<= ~a29~0 275)) (.cse9 (= ~a25~0 12)) (.cse5 (<= ~a23~0 312)) (.cse7 (exists ((v_~a29~0_502 Int)) (let ((.cse10 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse10 299861) 300138)) (<= 0 .cse10))))) (.cse1 (= 1 ~a4~0)) (.cse4 (not .cse2))) (or (and .cse0 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse1) (and .cse1 (= ~a25~0 11)) (and (<= ~a29~0 130) .cse2) (and (not .cse0) (<= ~a29~0 599998) .cse3 .cse4) (and .cse0 .cse5 .cse6) (and (= ~a25~0 9) .cse1) (and .cse1 .cse2 .cse3) (and .cse7 (or (<= ~a23~0 138) .cse6) .cse1) (and .cse8 .cse3 .cse4) (and .cse9 .cse8) (and .cse5 (<= ~a29~0 140)) (and (< 306 ~a23~0) .cse1 .cse2) (and .cse9 .cse5 .cse1) (and .cse7 .cse1 .cse4)))) [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,113 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 16:51:06,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:51:06 BoogieIcfgContainer [2019-12-07 16:51:06,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:51:06,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:51:06,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:51:06,133 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:51:06,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:50:19" (3/4) ... [2019-12-07 16:51:06,136 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:51:06,154 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 16:51:06,156 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:51:06,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || (1 == a4 && a25 == 11)) || (a29 <= 130 && a25 == 10)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(a25 == 10))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || (a25 == 9 && 1 == a4)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && (a23 <= 138 || a29 <= 245)) && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(a25 == 10))) || (a25 == 12 && a29 <= 275)) || (a23 <= 312 && a29 <= 140)) || ((306 < a23 && 1 == a4) && a25 == 10)) || ((a25 == 12 && a23 <= 312) && 1 == a4)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(a25 == 10)) [2019-12-07 16:51:06,177 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || (1 == a4 && a25 == 11)) || (a29 <= 130 && a25 == 10)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(a25 == 10))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || (a25 == 9 && 1 == a4)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && (a23 <= 138 || a29 <= 245)) && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(a25 == 10))) || (a25 == 12 && a29 <= 275)) || (a23 <= 312 && a29 <= 140)) || ((306 < a23 && 1 == a4) && a25 == 10)) || ((a25 == 12 && a23 <= 312) && 1 == a4)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(a25 == 10)) [2019-12-07 16:51:06,261 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_eb1c3da2-b8de-4630-bfb2-40740261308a/bin/uautomizer/witness.graphml [2019-12-07 16:51:06,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:51:06,262 INFO L168 Benchmark]: Toolchain (without parser) took 48845.96 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 934.0 MB in the beginning and 1.3 GB in the end (delta: -345.8 MB). Peak memory consumption was 854.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:06,263 INFO L168 Benchmark]: CDTParser took 0.16 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 16:51:06,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -197.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:06,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:06,263 INFO L168 Benchmark]: Boogie Preprocessor took 88.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:06,263 INFO L168 Benchmark]: RCFGBuilder took 1072.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 925.8 MB in the end (delta: 173.0 MB). Peak memory consumption was 173.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:06,264 INFO L168 Benchmark]: TraceAbstraction took 46928.86 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 925.8 MB in the beginning and 1.3 GB in the end (delta: -387.5 MB). Peak memory consumption was 964.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:06,264 INFO L168 Benchmark]: Witness Printer took 128.21 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:51:06,265 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.16 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 521.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -197.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1072.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 925.8 MB in the end (delta: 173.0 MB). Peak memory consumption was 173.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46928.86 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 925.8 MB in the beginning and 1.3 GB in the end (delta: -387.5 MB). Peak memory consumption was 964.1 MB. Max. memory is 11.5 GB. * Witness Printer took 128.21 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 114]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-12-07 16:51:06,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,269 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,270 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || (1 == a4 && a25 == 11)) || (a29 <= 130 && a25 == 10)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(a25 == 10))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || (a25 == 9 && 1 == a4)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && (a23 <= 138 || a29 <= 245)) && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(a25 == 10))) || (a25 == 12 && a29 <= 275)) || (a23 <= 312 && a29 <= 140)) || ((306 < a23 && 1 == a4) && a25 == 10)) || ((a25 == 12 && a23 <= 312) && 1 == a4)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(a25 == 10)) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 16:51:06,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,271 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,272 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 16:51:06,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: ((((((((((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a4) || (1 == a4 && a25 == 11)) || (a29 <= 130 && a25 == 10)) || (((!(a25 == 13) && a29 <= 599998) && a23 + 43 <= 0) && !(a25 == 10))) || ((a25 == 13 && a23 <= 312) && a29 <= 245)) || (a25 == 9 && 1 == a4)) || ((1 == a4 && a25 == 10) && a23 + 43 <= 0)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && (a23 <= 138 || a29 <= 245)) && 1 == a4)) || ((a29 <= 275 && a23 + 43 <= 0) && !(a25 == 10))) || (a25 == 12 && a29 <= 275)) || (a23 <= 312 && a29 <= 140)) || ((306 < a23 && 1 == a4) && a25 == 10)) || ((a25 == 12 && a23 <= 312) && 1 == a4)) || (((\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157) && 1 == a4) && !(a25 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 42.8s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, HoareTripleCheckerStatistics: 1976 SDtfs, 10836 SDslu, 944 SDs, 0 SdLazy, 28259 SolverSat, 4459 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1290 GetRequests, 1212 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19967occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 23770 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 250 NumberOfFragments, 359 HoareAnnotationTreeSize, 3 FomulaSimplifications, 38680 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 15748 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 5348 NumberOfCodeBlocks, 5348 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5330 ConstructedInterpolants, 432 QuantifiedInterpolants, 10143979 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1597 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 4564/5418 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...