./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label57.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_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label57.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/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 22c18731806e96bfa852bca51e2e7f8af9799504 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:43:59,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:43:59,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:43:59,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:43:59,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:43:59,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:43:59,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:43:59,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:43:59,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:43:59,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:43:59,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:43:59,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:43:59,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:43:59,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:43:59,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:43:59,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:43:59,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:43:59,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:43:59,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:43:59,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:43:59,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:43:59,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:43:59,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:43:59,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:43:59,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:43:59,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:43:59,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:43:59,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:43:59,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:43:59,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:43:59,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:43:59,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:43:59,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:43:59,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:43:59,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:43:59,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:43:59,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:43:59,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:43:59,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:43:59,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:43:59,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:43:59,953 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:43:59,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:43:59,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:43:59,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:43:59,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:43:59,963 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:43:59,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:43:59,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:43:59,965 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:43:59,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:43:59,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:43:59,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:43:59,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:43:59,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:43:59,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:43:59,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:43:59,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:43:59,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:43:59,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:43:59,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:43:59,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:43:59,966 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:43:59,966 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_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/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 -> 22c18731806e96bfa852bca51e2e7f8af9799504 [2019-12-07 12:44:00,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:44:00,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:44:00,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:44:00,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:44:00,076 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:44:00,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2019-12-07 12:44:00,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/data/41e220acf/401e69d25af24f21a8684ab1efc653b4/FLAGb50393d76 [2019-12-07 12:44:00,530 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:44:00,530 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2019-12-07 12:44:00,541 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/data/41e220acf/401e69d25af24f21a8684ab1efc653b4/FLAGb50393d76 [2019-12-07 12:44:00,550 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/data/41e220acf/401e69d25af24f21a8684ab1efc653b4 [2019-12-07 12:44:00,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:44:00,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:44:00,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:44:00,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:44:00,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:44:00,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:00,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4de5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00, skipping insertion in model container [2019-12-07 12:44:00,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:00,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:44:00,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:44:00,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:44:00,900 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:44:00,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:44:00,998 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:44:00,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00 WrapperNode [2019-12-07 12:44:00,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:44:00,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:44:00,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:44:00,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:44:01,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:44:01,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:44:01,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:44:01,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:44:01,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... [2019-12-07 12:44:01,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:44:01,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:44:01,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:44:01,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:44:01,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/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 12:44:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:44:01,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:44:02,225 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:44:02,225 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:44:02,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:44:02 BoogieIcfgContainer [2019-12-07 12:44:02,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:44:02,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:44:02,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:44:02,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:44:02,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:44:00" (1/3) ... [2019-12-07 12:44:02,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323112fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:44:02, skipping insertion in model container [2019-12-07 12:44:02,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:44:00" (2/3) ... [2019-12-07 12:44:02,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323112fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:44:02, skipping insertion in model container [2019-12-07 12:44:02,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:44:02" (3/3) ... [2019-12-07 12:44:02,233 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label57.c [2019-12-07 12:44:02,242 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:44:02,249 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:44:02,260 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:44:02,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:44:02,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:44:02,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:44:02,283 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:44:02,283 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:44:02,283 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:44:02,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:44:02,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:44:02,299 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 12:44:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 12:44:02,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:02,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:44:02,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:02,309 INFO L82 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2019-12-07 12:44:02,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:02,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524624076] [2019-12-07 12:44:02,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:02,559 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 12:44:02,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524624076] [2019-12-07 12:44:02,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:02,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:02,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403666956] [2019-12-07 12:44:02,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:02,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:02,582 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 12:44:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:03,727 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-12-07 12:44:03,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:03,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-07 12:44:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:03,741 INFO L225 Difference]: With dead ends: 966 [2019-12-07 12:44:03,741 INFO L226 Difference]: Without dead ends: 616 [2019-12-07 12:44:03,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-12-07 12:44:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-12-07 12:44:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-07 12:44:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-12-07 12:44:03,794 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 46 [2019-12-07 12:44:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:03,795 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-12-07 12:44:03,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-12-07 12:44:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 12:44:03,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:03,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, 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] [2019-12-07 12:44:03,799 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:03,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1553487167, now seen corresponding path program 1 times [2019-12-07 12:44:03,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:03,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662349177] [2019-12-07 12:44:03,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:03,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662349177] [2019-12-07 12:44:03,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:03,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:03,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544313216] [2019-12-07 12:44:03,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:03,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:03,912 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-12-07 12:44:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:04,918 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-12-07 12:44:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:04,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 12:44:04,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:04,927 INFO L225 Difference]: With dead ends: 2309 [2019-12-07 12:44:04,927 INFO L226 Difference]: Without dead ends: 1711 [2019-12-07 12:44:04,929 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 12:44:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-12-07 12:44:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1527. [2019-12-07 12:44:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-12-07 12:44:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2032 transitions. [2019-12-07 12:44:04,969 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2032 transitions. Word has length 117 [2019-12-07 12:44:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:04,970 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 2032 transitions. [2019-12-07 12:44:04,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2032 transitions. [2019-12-07 12:44:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 12:44:04,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:04,972 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, 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] [2019-12-07 12:44:04,972 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:04,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash 624671770, now seen corresponding path program 1 times [2019-12-07 12:44:04,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:04,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890563728] [2019-12-07 12:44:04,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:05,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890563728] [2019-12-07 12:44:05,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:05,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:05,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128078348] [2019-12-07 12:44:05,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:05,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:05,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:05,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:05,065 INFO L87 Difference]: Start difference. First operand 1527 states and 2032 transitions. Second operand 4 states. [2019-12-07 12:44:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:06,251 INFO L93 Difference]: Finished difference Result 5088 states and 6913 transitions. [2019-12-07 12:44:06,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:06,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 12:44:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:06,264 INFO L225 Difference]: With dead ends: 5088 [2019-12-07 12:44:06,265 INFO L226 Difference]: Without dead ends: 3563 [2019-12-07 12:44:06,266 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 12:44:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-12-07 12:44:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2447. [2019-12-07 12:44:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-12-07 12:44:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-12-07 12:44:06,304 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 130 [2019-12-07 12:44:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:06,305 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-12-07 12:44:06,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-12-07 12:44:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 12:44:06,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:06,308 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, 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] [2019-12-07 12:44:06,308 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:06,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:06,308 INFO L82 PathProgramCache]: Analyzing trace with hash 383208159, now seen corresponding path program 1 times [2019-12-07 12:44:06,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:06,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506078165] [2019-12-07 12:44:06,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:06,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506078165] [2019-12-07 12:44:06,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:06,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:44:06,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12833980] [2019-12-07 12:44:06,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:44:06,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:06,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:44:06,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:44:06,438 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 5 states. [2019-12-07 12:44:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:07,946 INFO L93 Difference]: Finished difference Result 8049 states and 10315 transitions. [2019-12-07 12:44:07,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:44:07,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2019-12-07 12:44:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:07,972 INFO L225 Difference]: With dead ends: 8049 [2019-12-07 12:44:07,972 INFO L226 Difference]: Without dead ends: 5788 [2019-12-07 12:44:07,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:44:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5788 states. [2019-12-07 12:44:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5788 to 5787. [2019-12-07 12:44:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-12-07 12:44:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 7107 transitions. [2019-12-07 12:44:08,042 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 7107 transitions. Word has length 173 [2019-12-07 12:44:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:08,043 INFO L462 AbstractCegarLoop]: Abstraction has 5787 states and 7107 transitions. [2019-12-07 12:44:08,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:44:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 7107 transitions. [2019-12-07 12:44:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-12-07 12:44:08,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:08,049 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, 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, 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] [2019-12-07 12:44:08,049 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1602503085, now seen corresponding path program 1 times [2019-12-07 12:44:08,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:08,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785907585] [2019-12-07 12:44:08,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 12:44:08,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785907585] [2019-12-07 12:44:08,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:08,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:44:08,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056046799] [2019-12-07 12:44:08,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:08,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:08,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:08,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:08,236 INFO L87 Difference]: Start difference. First operand 5787 states and 7107 transitions. Second operand 4 states. [2019-12-07 12:44:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:09,241 INFO L93 Difference]: Finished difference Result 13801 states and 17074 transitions. [2019-12-07 12:44:09,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:09,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-12-07 12:44:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:09,269 INFO L225 Difference]: With dead ends: 13801 [2019-12-07 12:44:09,270 INFO L226 Difference]: Without dead ends: 8200 [2019-12-07 12:44:09,274 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 12:44:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8200 states. [2019-12-07 12:44:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8200 to 7995. [2019-12-07 12:44:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7995 states. [2019-12-07 12:44:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7995 states to 7995 states and 9579 transitions. [2019-12-07 12:44:09,369 INFO L78 Accepts]: Start accepts. Automaton has 7995 states and 9579 transitions. Word has length 309 [2019-12-07 12:44:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:09,369 INFO L462 AbstractCegarLoop]: Abstraction has 7995 states and 9579 transitions. [2019-12-07 12:44:09,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 7995 states and 9579 transitions. [2019-12-07 12:44:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-12-07 12:44:09,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:09,377 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, 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, 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] [2019-12-07 12:44:09,377 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash -606468400, now seen corresponding path program 1 times [2019-12-07 12:44:09,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:09,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971983737] [2019-12-07 12:44:09,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-12-07 12:44:09,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971983737] [2019-12-07 12:44:09,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:09,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:44:09,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084245831] [2019-12-07 12:44:09,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:09,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:09,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:09,554 INFO L87 Difference]: Start difference. First operand 7995 states and 9579 transitions. Second operand 4 states. [2019-12-07 12:44:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:10,621 INFO L93 Difference]: Finished difference Result 20621 states and 24840 transitions. [2019-12-07 12:44:10,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:10,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-12-07 12:44:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:10,661 INFO L225 Difference]: With dead ends: 20621 [2019-12-07 12:44:10,661 INFO L226 Difference]: Without dead ends: 12812 [2019-12-07 12:44:10,667 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 12:44:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12812 states. [2019-12-07 12:44:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12812 to 8539. [2019-12-07 12:44:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8539 states. [2019-12-07 12:44:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8539 states to 8539 states and 10160 transitions. [2019-12-07 12:44:10,777 INFO L78 Accepts]: Start accepts. Automaton has 8539 states and 10160 transitions. Word has length 332 [2019-12-07 12:44:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:10,777 INFO L462 AbstractCegarLoop]: Abstraction has 8539 states and 10160 transitions. [2019-12-07 12:44:10,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 8539 states and 10160 transitions. [2019-12-07 12:44:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-12-07 12:44:10,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:10,785 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, 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, 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] [2019-12-07 12:44:10,785 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1478199095, now seen corresponding path program 1 times [2019-12-07 12:44:10,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:10,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844327141] [2019-12-07 12:44:10,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-12-07 12:44:10,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844327141] [2019-12-07 12:44:10,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:10,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:10,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344906397] [2019-12-07 12:44:10,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:44:10,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:44:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:44:10,946 INFO L87 Difference]: Start difference. First operand 8539 states and 10160 transitions. Second operand 3 states. [2019-12-07 12:44:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:11,500 INFO L93 Difference]: Finished difference Result 17255 states and 20563 transitions. [2019-12-07 12:44:11,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:44:11,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-12-07 12:44:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:11,511 INFO L225 Difference]: With dead ends: 17255 [2019-12-07 12:44:11,511 INFO L226 Difference]: Without dead ends: 9826 [2019-12-07 12:44:11,517 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 12:44:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2019-12-07 12:44:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 6874. [2019-12-07 12:44:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-12-07 12:44:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 8202 transitions. [2019-12-07 12:44:11,582 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 8202 transitions. Word has length 338 [2019-12-07 12:44:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:11,583 INFO L462 AbstractCegarLoop]: Abstraction has 6874 states and 8202 transitions. [2019-12-07 12:44:11,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:44:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 8202 transitions. [2019-12-07 12:44:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-12-07 12:44:11,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:11,590 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 12:44:11,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1497380334, now seen corresponding path program 1 times [2019-12-07 12:44:11,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:11,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487147262] [2019-12-07 12:44:11,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:11,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487147262] [2019-12-07 12:44:11,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:11,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:44:11,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144647915] [2019-12-07 12:44:11,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:44:11,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:11,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:44:11,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:44:11,772 INFO L87 Difference]: Start difference. First operand 6874 states and 8202 transitions. Second operand 5 states. [2019-12-07 12:44:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:13,438 INFO L93 Difference]: Finished difference Result 19096 states and 23065 transitions. [2019-12-07 12:44:13,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:44:13,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 351 [2019-12-07 12:44:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:13,457 INFO L225 Difference]: With dead ends: 19096 [2019-12-07 12:44:13,457 INFO L226 Difference]: Without dead ends: 12408 [2019-12-07 12:44:13,463 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 12:44:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12408 states. [2019-12-07 12:44:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12408 to 9998. [2019-12-07 12:44:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9998 states. [2019-12-07 12:44:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9998 states to 9998 states and 12013 transitions. [2019-12-07 12:44:13,555 INFO L78 Accepts]: Start accepts. Automaton has 9998 states and 12013 transitions. Word has length 351 [2019-12-07 12:44:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:13,556 INFO L462 AbstractCegarLoop]: Abstraction has 9998 states and 12013 transitions. [2019-12-07 12:44:13,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:44:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 9998 states and 12013 transitions. [2019-12-07 12:44:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-12-07 12:44:13,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:13,567 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:44:13,567 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:13,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:13,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1603876004, now seen corresponding path program 1 times [2019-12-07 12:44:13,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:13,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539419089] [2019-12-07 12:44:13,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 435 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 12:44:13,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539419089] [2019-12-07 12:44:13,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916614380] [2019-12-07 12:44:13,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/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 12:44:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:14,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:44:14,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:44:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 12:44:14,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:44:14,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 12:44:14,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773248117] [2019-12-07 12:44:14,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:14,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:44:14,259 INFO L87 Difference]: Start difference. First operand 9998 states and 12013 transitions. Second operand 4 states. [2019-12-07 12:44:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:15,273 INFO L93 Difference]: Finished difference Result 21462 states and 25948 transitions. [2019-12-07 12:44:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:15,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 456 [2019-12-07 12:44:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:15,293 INFO L225 Difference]: With dead ends: 21462 [2019-12-07 12:44:15,293 INFO L226 Difference]: Without dead ends: 9994 [2019-12-07 12:44:15,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:44:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9994 states. [2019-12-07 12:44:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9994 to 8334. [2019-12-07 12:44:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8334 states. [2019-12-07 12:44:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8334 states to 8334 states and 9404 transitions. [2019-12-07 12:44:15,393 INFO L78 Accepts]: Start accepts. Automaton has 8334 states and 9404 transitions. Word has length 456 [2019-12-07 12:44:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:15,393 INFO L462 AbstractCegarLoop]: Abstraction has 8334 states and 9404 transitions. [2019-12-07 12:44:15,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8334 states and 9404 transitions. [2019-12-07 12:44:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-12-07 12:44:15,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:15,405 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, 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, 3, 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, 1, 1, 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 12:44:15,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:44:15,605 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:15,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:15,606 INFO L82 PathProgramCache]: Analyzing trace with hash -734371707, now seen corresponding path program 1 times [2019-12-07 12:44:15,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:15,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679463910] [2019-12-07 12:44:15,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-12-07 12:44:15,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679463910] [2019-12-07 12:44:15,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:15,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:44:15,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000767944] [2019-12-07 12:44:15,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:44:15,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:15,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:44:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:44:15,909 INFO L87 Difference]: Start difference. First operand 8334 states and 9404 transitions. Second operand 4 states. [2019-12-07 12:44:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:16,804 INFO L93 Difference]: Finished difference Result 17602 states and 19905 transitions. [2019-12-07 12:44:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:44:16,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-12-07 12:44:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:16,814 INFO L225 Difference]: With dead ends: 17602 [2019-12-07 12:44:16,814 INFO L226 Difference]: Without dead ends: 9083 [2019-12-07 12:44:16,823 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 12:44:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9083 states. [2019-12-07 12:44:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9083 to 8700. [2019-12-07 12:44:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8700 states. [2019-12-07 12:44:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8700 states to 8700 states and 9703 transitions. [2019-12-07 12:44:16,899 INFO L78 Accepts]: Start accepts. Automaton has 8700 states and 9703 transitions. Word has length 505 [2019-12-07 12:44:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:16,899 INFO L462 AbstractCegarLoop]: Abstraction has 8700 states and 9703 transitions. [2019-12-07 12:44:16,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:44:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8700 states and 9703 transitions. [2019-12-07 12:44:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-12-07 12:44:16,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:16,909 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, 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, 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, 1, 1, 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 12:44:16,909 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:16,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1159225603, now seen corresponding path program 1 times [2019-12-07 12:44:16,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:16,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496733175] [2019-12-07 12:44:16,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 403 proven. 382 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:44:17,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496733175] [2019-12-07 12:44:17,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71843524] [2019-12-07 12:44:17,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/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 12:44:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:17,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 12:44:17,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:44:17,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:44:17,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:44:17,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:44:17,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:44:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 453 proven. 236 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 12:44:18,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:44:18,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2019-12-07 12:44:18,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656126049] [2019-12-07 12:44:18,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:44:18,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:18,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:44:18,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:44:18,564 INFO L87 Difference]: Start difference. First operand 8700 states and 9703 transitions. Second operand 14 states. [2019-12-07 12:44:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:29,438 INFO L93 Difference]: Finished difference Result 27949 states and 31001 transitions. [2019-12-07 12:44:29,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 12:44:29,438 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 522 [2019-12-07 12:44:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:29,449 INFO L225 Difference]: With dead ends: 27949 [2019-12-07 12:44:29,449 INFO L226 Difference]: Without dead ends: 18135 [2019-12-07 12:44:29,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=563, Invalid=1599, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 12:44:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18135 states. [2019-12-07 12:44:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18135 to 9248. [2019-12-07 12:44:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2019-12-07 12:44:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 10126 transitions. [2019-12-07 12:44:29,546 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 10126 transitions. Word has length 522 [2019-12-07 12:44:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:29,547 INFO L462 AbstractCegarLoop]: Abstraction has 9248 states and 10126 transitions. [2019-12-07 12:44:29,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:44:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 10126 transitions. [2019-12-07 12:44:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-12-07 12:44:29,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:44:29,558 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, 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, 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, 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] [2019-12-07 12:44:29,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:44:29,759 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:44:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:44:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1524195677, now seen corresponding path program 1 times [2019-12-07 12:44:29,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:44:29,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371479568] [2019-12-07 12:44:29,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:44:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:44:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-12-07 12:44:30,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371479568] [2019-12-07 12:44:30,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:44:30,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:44:30,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346594738] [2019-12-07 12:44:30,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:44:30,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:44:30,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:44:30,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:44:30,071 INFO L87 Difference]: Start difference. First operand 9248 states and 10126 transitions. Second operand 3 states. [2019-12-07 12:44:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:44:30,586 INFO L93 Difference]: Finished difference Result 18859 states and 20602 transitions. [2019-12-07 12:44:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:44:30,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 685 [2019-12-07 12:44:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:44:30,587 INFO L225 Difference]: With dead ends: 18859 [2019-12-07 12:44:30,587 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:44:30,591 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 12:44:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:44:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:44:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:44:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:44:30,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 685 [2019-12-07 12:44:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:44:30,592 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:44:30,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:44:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:44:30,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:44:30,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:44:30,944 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 295 [2019-12-07 12:44:31,290 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 295 [2019-12-07 12:44:32,918 WARN L192 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 281 DAG size of output: 110 [2019-12-07 12:44:34,530 WARN L192 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 281 DAG size of output: 110 [2019-12-07 12:44:34,532 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 12:44:34,532 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 12:44:34,532 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 12:44:34,532 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,533 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse22 (<= ~a4~0 0)) (.cse9 (= ~a25~0 10)) (.cse5 (<= ~a29~0 140)) (.cse19 (< 306 ~a23~0)) (.cse1 (<= ~a23~0 138)) (.cse21 (= ~a25~0 12)) (.cse11 (= ~a25~0 13)) (.cse2 (= 1 ~a4~0))) (let ((.cse6 (= ~a25~0 11)) (.cse4 (not .cse2)) (.cse3 (not .cse11)) (.cse7 (<= ~a29~0 599928)) (.cse18 (<= ~a29~0 277)) (.cse23 (<= (+ ~a23~0 43) 0)) (.cse10 (<= ~a23~0 312)) (.cse14 (< 138 ~a23~0)) (.cse8 (<= ~a29~0 245)) (.cse15 (not .cse21)) (.cse17 (or .cse19 .cse1)) (.cse20 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= ~a29~0 (+ (mod v_~a29~0_500 299861) 300139)) (<= 0 v_~a29~0_500)))) (.cse12 (= 1 ~a3~0)) (.cse0 (<= ~a25~0 9)) (.cse13 (= 15 ~a8~0)) (.cse24 (<= (+ ~a29~0 92) 0)) (.cse16 (or (and .cse1 .cse9 .cse5) (and .cse22 .cse9 .cse5)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5) (and (<= ~a29~0 599998) .cse1 .cse2 .cse6) (and .cse7 .cse1 .cse6) (and .cse8 .cse9 .cse2) (and .cse1 .cse9 .cse2) (and .cse10 .cse11 .cse7 .cse12 .cse13 .cse2 .cse14) (and .cse1 (<= (+ ~a29~0 22) 0) .cse15) (and .cse16 .cse17) (and .cse0 .cse17 .cse18 .cse8 .cse2) (and .cse12 .cse19 .cse13 .cse18 .cse2) (and .cse20 .cse12 .cse17 .cse13 .cse9 .cse2) (and .cse20 .cse12 .cse19 .cse13 .cse2 .cse6) (and .cse7 .cse12 .cse13 .cse2 .cse6) (and .cse21 .cse22 .cse18) (and .cse21 .cse1 .cse18 .cse4) (and .cse12 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= (+ ~a29~0 299881) (mod v_~a29~0_500 299861)) (<= 0 v_~a29~0_500))) .cse13 .cse2 .cse14) (and .cse7 .cse3 .cse15 .cse23) (and .cse0 .cse18 .cse2 (<= ~a29~0 220)) (and .cse7 (<= 13 ~a25~0) .cse12 .cse19 .cse13 .cse2) (and .cse24 .cse1) (and .cse15 .cse18 .cse23) (and .cse10 .cse11 (<= ~a23~0 306) .cse8 .cse2 .cse14) (and .cse12 .cse13 .cse8 .cse15 .cse2) (and .cse24 (or .cse15 (<= 312 ~a23~0)) .cse17 .cse2) (and .cse20 .cse12 .cse0 .cse13 .cse2) (and .cse24 .cse16)))) [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,534 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 12:44:34,535 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,536 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 12:44:34,537 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,538 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 144) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,539 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,540 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 12:44:34,541 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 12:44:34,542 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,543 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 12:44:34,544 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,545 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,546 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,547 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse22 (<= ~a4~0 0)) (.cse9 (= ~a25~0 10)) (.cse5 (<= ~a29~0 140)) (.cse19 (< 306 ~a23~0)) (.cse1 (<= ~a23~0 138)) (.cse21 (= ~a25~0 12)) (.cse11 (= ~a25~0 13)) (.cse2 (= 1 ~a4~0))) (let ((.cse6 (= ~a25~0 11)) (.cse4 (not .cse2)) (.cse3 (not .cse11)) (.cse7 (<= ~a29~0 599928)) (.cse18 (<= ~a29~0 277)) (.cse23 (<= (+ ~a23~0 43) 0)) (.cse10 (<= ~a23~0 312)) (.cse14 (< 138 ~a23~0)) (.cse8 (<= ~a29~0 245)) (.cse15 (not .cse21)) (.cse17 (or .cse19 .cse1)) (.cse20 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= ~a29~0 (+ (mod v_~a29~0_500 299861) 300139)) (<= 0 v_~a29~0_500)))) (.cse12 (= 1 ~a3~0)) (.cse0 (<= ~a25~0 9)) (.cse13 (= 15 ~a8~0)) (.cse24 (<= (+ ~a29~0 92) 0)) (.cse16 (or (and .cse1 .cse9 .cse5) (and .cse22 .cse9 .cse5)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5) (and (<= ~a29~0 599998) .cse1 .cse2 .cse6) (and .cse7 .cse1 .cse6) (and .cse8 .cse9 .cse2) (and .cse1 .cse9 .cse2) (and .cse10 .cse11 .cse7 .cse12 .cse13 .cse2 .cse14) (and .cse1 (<= (+ ~a29~0 22) 0) .cse15) (and .cse16 .cse17) (and .cse0 .cse17 .cse18 .cse8 .cse2) (and .cse12 .cse19 .cse13 .cse18 .cse2) (and .cse20 .cse12 .cse17 .cse13 .cse9 .cse2) (and .cse20 .cse12 .cse19 .cse13 .cse2 .cse6) (and .cse7 .cse12 .cse13 .cse2 .cse6) (and .cse21 .cse22 .cse18) (and .cse21 .cse1 .cse18 .cse4) (and .cse12 (exists ((v_~a29~0_500 Int)) (and (< 277 v_~a29~0_500) (<= (+ ~a29~0 299881) (mod v_~a29~0_500 299861)) (<= 0 v_~a29~0_500))) .cse13 .cse2 .cse14) (and .cse7 .cse3 .cse15 .cse23) (and .cse0 .cse18 .cse2 (<= ~a29~0 220)) (and .cse7 (<= 13 ~a25~0) .cse12 .cse19 .cse13 .cse2) (and .cse24 .cse1) (and .cse15 .cse18 .cse23) (and .cse10 .cse11 (<= ~a23~0 306) .cse8 .cse2 .cse14) (and .cse12 .cse13 .cse8 .cse15 .cse2) (and .cse24 (or .cse15 (<= 312 ~a23~0)) .cse17 .cse2) (and .cse20 .cse12 .cse0 .cse13 .cse2) (and .cse24 .cse16)))) [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,548 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 12:44:34,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,561 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:44:34 BoogieIcfgContainer [2019-12-07 12:44:34,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:44:34,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:44:34,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:44:34,590 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:44:34,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:44:02" (3/4) ... [2019-12-07 12:44:34,593 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:44:34,615 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 12:44:34,617 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:44:34,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a25 <= 9 && a23 <= 138) && 1 == a4) || (((!(a25 == 13) && a23 <= 138) && !(1 == a4)) && a29 <= 140)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || ((a29 <= 245 && a25 == 10) && 1 == a4)) || ((a23 <= 138 && a25 == 10) && 1 == a4)) || ((((((a23 <= 312 && a25 == 13) && a29 <= 599928) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12))) || ((((a23 <= 138 && a25 == 10) && a29 <= 140) || ((a4 <= 0 && a25 == 10) && a29 <= 140)) && (306 < a23 || a23 <= 138))) || ((((a25 <= 9 && (306 < a23 || a23 <= 138)) && a29 <= 277) && a29 <= 245) && 1 == a4)) || ((((1 == a3 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 15 == a8) && a25 == 10) && 1 == a4)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a25 == 12 && a4 <= 0) && a29 <= 277)) || (((a25 == 12 && a23 <= 138) && a29 <= 277) && !(1 == a4))) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || (((a29 <= 599928 && !(a25 == 13)) && !(a25 == 12)) && a23 + 43 <= 0)) || (((a25 <= 9 && a29 <= 277) && 1 == a4) && a29 <= 220)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && a23 <= 138)) || ((!(a25 == 12) && a29 <= 277) && a23 + 43 <= 0)) || (((((a23 <= 312 && a25 == 13) && a23 <= 306) && a29 <= 245) && 1 == a4) && 138 < a23)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && !(a25 == 12)) && 1 == a4)) || (((a29 + 92 <= 0 && (!(a25 == 12) || 312 <= a23)) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && (((a23 <= 138 && a25 == 10) && a29 <= 140) || ((a4 <= 0 && a25 == 10) && a29 <= 140))) [2019-12-07 12:44:34,639 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a25 <= 9 && a23 <= 138) && 1 == a4) || (((!(a25 == 13) && a23 <= 138) && !(1 == a4)) && a29 <= 140)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || ((a29 <= 245 && a25 == 10) && 1 == a4)) || ((a23 <= 138 && a25 == 10) && 1 == a4)) || ((((((a23 <= 312 && a25 == 13) && a29 <= 599928) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12))) || ((((a23 <= 138 && a25 == 10) && a29 <= 140) || ((a4 <= 0 && a25 == 10) && a29 <= 140)) && (306 < a23 || a23 <= 138))) || ((((a25 <= 9 && (306 < a23 || a23 <= 138)) && a29 <= 277) && a29 <= 245) && 1 == a4)) || ((((1 == a3 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 15 == a8) && a25 == 10) && 1 == a4)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a25 == 12 && a4 <= 0) && a29 <= 277)) || (((a25 == 12 && a23 <= 138) && a29 <= 277) && !(1 == a4))) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || (((a29 <= 599928 && !(a25 == 13)) && !(a25 == 12)) && a23 + 43 <= 0)) || (((a25 <= 9 && a29 <= 277) && 1 == a4) && a29 <= 220)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && a23 <= 138)) || ((!(a25 == 12) && a29 <= 277) && a23 + 43 <= 0)) || (((((a23 <= 312 && a25 == 13) && a23 <= 306) && a29 <= 245) && 1 == a4) && 138 < a23)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && !(a25 == 12)) && 1 == a4)) || (((a29 + 92 <= 0 && (!(a25 == 12) || 312 <= a23)) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && (((a23 <= 138 && a25 == 10) && a29 <= 140) || ((a4 <= 0 && a25 == 10) && a29 <= 140))) [2019-12-07 12:44:34,717 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a8a5ffc2-bb33-4d5b-acfa-66610ec22a85/bin/uautomizer/witness.graphml [2019-12-07 12:44:34,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:44:34,718 INFO L168 Benchmark]: Toolchain (without parser) took 34164.65 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 12:44:34,718 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:44:34,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:34,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:34,719 INFO L168 Benchmark]: Boogie Preprocessor took 73.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:34,719 INFO L168 Benchmark]: RCFGBuilder took 1079.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 853.3 MB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:34,719 INFO L168 Benchmark]: TraceAbstraction took 32361.57 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 853.3 MB in the beginning and 1.1 GB in the end (delta: -260.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 12:44:34,720 INFO L168 Benchmark]: Witness Printer took 127.42 ms. Allocated memory is still 2.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:44:34,721 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1079.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 853.3 MB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32361.57 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 853.3 MB in the beginning and 1.1 GB in the end (delta: -260.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 127.42 ms. Allocated memory is still 2.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 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_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: 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 12:44:34,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a25 <= 9 && a23 <= 138) && 1 == a4) || (((!(a25 == 13) && a23 <= 138) && !(1 == a4)) && a29 <= 140)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || ((a29 <= 245 && a25 == 10) && 1 == a4)) || ((a23 <= 138 && a25 == 10) && 1 == a4)) || ((((((a23 <= 312 && a25 == 13) && a29 <= 599928) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12))) || ((((a23 <= 138 && a25 == 10) && a29 <= 140) || ((a4 <= 0 && a25 == 10) && a29 <= 140)) && (306 < a23 || a23 <= 138))) || ((((a25 <= 9 && (306 < a23 || a23 <= 138)) && a29 <= 277) && a29 <= 245) && 1 == a4)) || ((((1 == a3 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 15 == a8) && a25 == 10) && 1 == a4)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a25 == 12 && a4 <= 0) && a29 <= 277)) || (((a25 == 12 && a23 <= 138) && a29 <= 277) && !(1 == a4))) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || (((a29 <= 599928 && !(a25 == 13)) && !(a25 == 12)) && a23 + 43 <= 0)) || (((a25 <= 9 && a29 <= 277) && 1 == a4) && a29 <= 220)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && a23 <= 138)) || ((!(a25 == 12) && a29 <= 277) && a23 + 43 <= 0)) || (((((a23 <= 312 && a25 == 13) && a23 <= 306) && a29 <= 245) && 1 == a4) && 138 < a23)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && !(a25 == 12)) && 1 == a4)) || (((a29 + 92 <= 0 && (!(a25 == 12) || 312 <= a23)) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && (((a23 <= 138 && a25 == 10) && a29 <= 140) || ((a4 <= 0 && a25 == 10) && a29 <= 140))) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 12:44:34,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 12:44:34,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a25 <= 9 && a23 <= 138) && 1 == a4) || (((!(a25 == 13) && a23 <= 138) && !(1 == a4)) && a29 <= 140)) || (((a29 <= 599998 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((a29 <= 599928 && a23 <= 138) && a25 == 11)) || ((a29 <= 245 && a25 == 10) && 1 == a4)) || ((a23 <= 138 && a25 == 10) && 1 == a4)) || ((((((a23 <= 312 && a25 == 13) && a29 <= 599928) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a23 <= 138 && a29 + 22 <= 0) && !(a25 == 12))) || ((((a23 <= 138 && a25 == 10) && a29 <= 140) || ((a4 <= 0 && a25 == 10) && a29 <= 140)) && (306 < a23 || a23 <= 138))) || ((((a25 <= 9 && (306 < a23 || a23 <= 138)) && a29 <= 277) && a29 <= 245) && 1 == a4)) || ((((1 == a3 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && (306 < a23 || a23 <= 138)) && 15 == a8) && a25 == 10) && 1 == a4)) || ((((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((a29 <= 599928 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a25 == 12 && a4 <= 0) && a29 <= 277)) || (((a25 == 12 && a23 <= 138) && a29 <= 277) && !(1 == a4))) || ((((1 == a3 && (\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 + 299881 <= v_~a29~0_500 % 299861) && 0 <= v_~a29~0_500)) && 15 == a8) && 1 == a4) && 138 < a23)) || (((a29 <= 599928 && !(a25 == 13)) && !(a25 == 12)) && a23 + 43 <= 0)) || (((a25 <= 9 && a29 <= 277) && 1 == a4) && a29 <= 220)) || (((((a29 <= 599928 && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && a23 <= 138)) || ((!(a25 == 12) && a29 <= 277) && a23 + 43 <= 0)) || (((((a23 <= 312 && a25 == 13) && a23 <= 306) && a29 <= 245) && 1 == a4) && 138 < a23)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && !(a25 == 12)) && 1 == a4)) || (((a29 + 92 <= 0 && (!(a25 == 12) || 312 <= a23)) && (306 < a23 || a23 <= 138)) && 1 == a4)) || (((((\exists v_~a29~0_500 : int :: (277 < v_~a29~0_500 && a29 <= v_~a29~0_500 % 299861 + 300139) && 0 <= v_~a29~0_500) && 1 == a3) && a25 <= 9) && 15 == a8) && 1 == a4)) || (a29 + 92 <= 0 && (((a23 <= 138 && a25 == 10) && a29 <= 140) || ((a4 <= 0 && a25 == 10) && a29 <= 140))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 28.3s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, HoareTripleCheckerStatistics: 1638 SDtfs, 9025 SDslu, 768 SDs, 0 SdLazy, 23381 SolverSat, 3942 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1093 GetRequests, 1021 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9998occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 22087 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 148 NumberOfFragments, 979 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15338 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 13398 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4942 NumberOfCodeBlocks, 4942 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4928 ConstructedInterpolants, 177 QuantifiedInterpolants, 8357007 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1253 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 5417/6038 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...