./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label28.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/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 fbb1e06d5cba6e6a6afd48c5da6c687c5c87d864 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 11:08:32,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:08:32,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:08:32,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:08:32,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:08:32,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:08:32,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:08:32,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:08:32,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:08:32,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:08:32,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:08:32,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:08:32,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:08:32,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:08:32,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:08:32,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:08:32,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:08:32,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:08:32,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:08:32,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:08:32,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:08:32,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:08:32,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:08:32,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:08:32,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:08:32,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:08:32,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:08:32,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:08:32,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:08:32,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:08:32,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:08:32,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:08:32,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:08:32,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:08:32,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:08:32,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:08:32,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:08:32,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:08:32,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:08:32,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:08:32,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:08:32,860 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 11:08:32,883 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:08:32,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:08:32,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:08:32,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:08:32,884 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:08:32,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:08:32,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:08:32,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:08:32,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:08:32,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:08:32,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:08:32,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:08:32,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:08:32,886 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:08:32,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:08:32,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:08:32,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:08:32,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:08:32,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:08:32,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:08:32,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:08:32,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:08:32,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:08:32,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:08:32,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:08:32,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:08:32,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:08:32,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:08:32,889 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_a3c04552-29a4-4c44-aacc-8b3c62453d6c/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 -> fbb1e06d5cba6e6a6afd48c5da6c687c5c87d864 [2019-11-20 11:08:33,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:08:33,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:08:33,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:08:33,040 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:08:33,040 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:08:33,041 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2019-11-20 11:08:33,104 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/data/2546ca986/5367db8dbe9842d2a547b0276c3e0066/FLAG6518b0f69 [2019-11-20 11:08:33,625 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:08:33,626 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/sv-benchmarks/c/eca-rers2012/Problem11_label28.c [2019-11-20 11:08:33,643 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/data/2546ca986/5367db8dbe9842d2a547b0276c3e0066/FLAG6518b0f69 [2019-11-20 11:08:33,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/data/2546ca986/5367db8dbe9842d2a547b0276c3e0066 [2019-11-20 11:08:33,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:08:33,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:08:33,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:08:33,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:08:33,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:08:33,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:08:33" (1/1) ... [2019-11-20 11:08:33,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dad0900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:33, skipping insertion in model container [2019-11-20 11:08:33,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:08:33" (1/1) ... [2019-11-20 11:08:33,918 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:08:33,974 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:08:34,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:08:34,530 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:08:34,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:08:34,723 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:08:34,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34 WrapperNode [2019-11-20 11:08:34,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:08:34,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:08:34,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:08:34,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:08:34,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:08:34,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:08:34,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:08:34,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:08:34,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... [2019-11-20 11:08:34,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:08:34,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:08:34,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:08:34,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:08:34,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/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-11-20 11:08:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:08:35,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:08:36,831 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:08:36,831 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 11:08:36,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:08:36 BoogieIcfgContainer [2019-11-20 11:08:36,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:08:36,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:08:36,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:08:36,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:08:36,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:08:33" (1/3) ... [2019-11-20 11:08:36,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624cd2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:08:36, skipping insertion in model container [2019-11-20 11:08:36,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:08:34" (2/3) ... [2019-11-20 11:08:36,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624cd2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:08:36, skipping insertion in model container [2019-11-20 11:08:36,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:08:36" (3/3) ... [2019-11-20 11:08:36,844 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label28.c [2019-11-20 11:08:36,853 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:08:36,863 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:08:36,874 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:08:36,914 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:08:36,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:08:36,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:08:36,915 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:08:36,915 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:08:36,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:08:36,915 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:08:36,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:08:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-20 11:08:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 11:08:36,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:36,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:08:36,955 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2019-11-20 11:08:36,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:36,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363762207] [2019-11-20 11:08:36,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:37,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363762207] [2019-11-20 11:08:37,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:37,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:08:37,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898961940] [2019-11-20 11:08:37,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:37,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:37,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:37,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:37,347 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-20 11:08:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:39,536 INFO L93 Difference]: Finished difference Result 968 states and 1740 transitions. [2019-11-20 11:08:39,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:08:39,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-20 11:08:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:39,565 INFO L225 Difference]: With dead ends: 968 [2019-11-20 11:08:39,568 INFO L226 Difference]: Without dead ends: 602 [2019-11-20 11:08:39,578 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-11-20 11:08:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-20 11:08:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 407. [2019-11-20 11:08:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-20 11:08:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 590 transitions. [2019-11-20 11:08:39,686 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 590 transitions. Word has length 48 [2019-11-20 11:08:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:39,687 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 590 transitions. [2019-11-20 11:08:39,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 590 transitions. [2019-11-20 11:08:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 11:08:39,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:39,693 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, 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] [2019-11-20 11:08:39,693 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:39,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2122398730, now seen corresponding path program 1 times [2019-11-20 11:08:39,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:39,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730789012] [2019-11-20 11:08:39,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:39,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730789012] [2019-11-20 11:08:39,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:39,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:08:39,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925455629] [2019-11-20 11:08:39,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:39,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:39,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:39,830 INFO L87 Difference]: Start difference. First operand 407 states and 590 transitions. Second operand 4 states. [2019-11-20 11:08:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:41,346 INFO L93 Difference]: Finished difference Result 1567 states and 2285 transitions. [2019-11-20 11:08:41,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:08:41,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-20 11:08:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:41,353 INFO L225 Difference]: With dead ends: 1567 [2019-11-20 11:08:41,353 INFO L226 Difference]: Without dead ends: 1162 [2019-11-20 11:08:41,355 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-11-20 11:08:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-20 11:08:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1148. [2019-11-20 11:08:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-11-20 11:08:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1565 transitions. [2019-11-20 11:08:41,397 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1565 transitions. Word has length 116 [2019-11-20 11:08:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:41,398 INFO L462 AbstractCegarLoop]: Abstraction has 1148 states and 1565 transitions. [2019-11-20 11:08:41,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1565 transitions. [2019-11-20 11:08:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 11:08:41,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:41,407 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, 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] [2019-11-20 11:08:41,407 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:41,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:41,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1068723632, now seen corresponding path program 1 times [2019-11-20 11:08:41,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:41,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958070537] [2019-11-20 11:08:41,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:41,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958070537] [2019-11-20 11:08:41,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:41,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:08:41,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618593559] [2019-11-20 11:08:41,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:41,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:41,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:41,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:41,573 INFO L87 Difference]: Start difference. First operand 1148 states and 1565 transitions. Second operand 4 states. [2019-11-20 11:08:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:43,307 INFO L93 Difference]: Finished difference Result 4144 states and 5715 transitions. [2019-11-20 11:08:43,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:08:43,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-20 11:08:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:43,327 INFO L225 Difference]: With dead ends: 4144 [2019-11-20 11:08:43,328 INFO L226 Difference]: Without dead ends: 2998 [2019-11-20 11:08:43,330 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-11-20 11:08:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-11-20 11:08:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2019-11-20 11:08:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-11-20 11:08:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3663 transitions. [2019-11-20 11:08:43,405 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3663 transitions. Word has length 141 [2019-11-20 11:08:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:43,406 INFO L462 AbstractCegarLoop]: Abstraction has 2998 states and 3663 transitions. [2019-11-20 11:08:43,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3663 transitions. [2019-11-20 11:08:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-20 11:08:43,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:43,413 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:08:43,413 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash -381057166, now seen corresponding path program 1 times [2019-11-20 11:08:43,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:43,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275572550] [2019-11-20 11:08:43,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:43,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275572550] [2019-11-20 11:08:43,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:43,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:08:43,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678839572] [2019-11-20 11:08:43,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:43,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:43,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:43,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:43,655 INFO L87 Difference]: Start difference. First operand 2998 states and 3663 transitions. Second operand 4 states. [2019-11-20 11:08:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:45,271 INFO L93 Difference]: Finished difference Result 7485 states and 9308 transitions. [2019-11-20 11:08:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:08:45,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-20 11:08:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:45,295 INFO L225 Difference]: With dead ends: 7485 [2019-11-20 11:08:45,295 INFO L226 Difference]: Without dead ends: 4673 [2019-11-20 11:08:45,299 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-11-20 11:08:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2019-11-20 11:08:45,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4470. [2019-11-20 11:08:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4470 states. [2019-11-20 11:08:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 5440 transitions. [2019-11-20 11:08:45,391 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 5440 transitions. Word has length 236 [2019-11-20 11:08:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:45,393 INFO L462 AbstractCegarLoop]: Abstraction has 4470 states and 5440 transitions. [2019-11-20 11:08:45,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 5440 transitions. [2019-11-20 11:08:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-20 11:08:45,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:45,402 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:08:45,402 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:45,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:45,402 INFO L82 PathProgramCache]: Analyzing trace with hash -356634931, now seen corresponding path program 1 times [2019-11-20 11:08:45,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:45,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912491626] [2019-11-20 11:08:45,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 11:08:45,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912491626] [2019-11-20 11:08:45,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:45,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:08:45,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58039046] [2019-11-20 11:08:45,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:08:45,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:45,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:08:45,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:08:45,588 INFO L87 Difference]: Start difference. First operand 4470 states and 5440 transitions. Second operand 3 states. [2019-11-20 11:08:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:46,428 INFO L93 Difference]: Finished difference Result 10041 states and 12450 transitions. [2019-11-20 11:08:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:08:46,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-11-20 11:08:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:46,456 INFO L225 Difference]: With dead ends: 10041 [2019-11-20 11:08:46,457 INFO L226 Difference]: Without dead ends: 5757 [2019-11-20 11:08:46,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:08:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-11-20 11:08:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5572. [2019-11-20 11:08:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-11-20 11:08:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 6703 transitions. [2019-11-20 11:08:46,621 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 6703 transitions. Word has length 251 [2019-11-20 11:08:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:46,622 INFO L462 AbstractCegarLoop]: Abstraction has 5572 states and 6703 transitions. [2019-11-20 11:08:46,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:08:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 6703 transitions. [2019-11-20 11:08:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-20 11:08:46,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:46,628 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:08:46,628 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1030741549, now seen corresponding path program 1 times [2019-11-20 11:08:46,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:46,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867333148] [2019-11-20 11:08:46,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 66 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:47,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867333148] [2019-11-20 11:08:47,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137552695] [2019-11-20 11:08:47,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/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-11-20 11:08:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:47,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:08:47,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:47,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:47,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:47,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:08:47,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 11:08:47,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634499029] [2019-11-20 11:08:47,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:47,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:08:47,943 INFO L87 Difference]: Start difference. First operand 5572 states and 6703 transitions. Second operand 4 states. [2019-11-20 11:08:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:50,338 INFO L93 Difference]: Finished difference Result 15571 states and 18826 transitions. [2019-11-20 11:08:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:08:50,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-11-20 11:08:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:50,386 INFO L225 Difference]: With dead ends: 15571 [2019-11-20 11:08:50,386 INFO L226 Difference]: Without dead ends: 10185 [2019-11-20 11:08:50,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:08:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10185 states. [2019-11-20 11:08:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10185 to 9443. [2019-11-20 11:08:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9443 states. [2019-11-20 11:08:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9443 states to 9443 states and 11279 transitions. [2019-11-20 11:08:50,596 INFO L78 Accepts]: Start accepts. Automaton has 9443 states and 11279 transitions. Word has length 267 [2019-11-20 11:08:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:50,597 INFO L462 AbstractCegarLoop]: Abstraction has 9443 states and 11279 transitions. [2019-11-20 11:08:50,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 9443 states and 11279 transitions. [2019-11-20 11:08:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-20 11:08:50,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:50,606 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:08:50,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:08:50,811 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1546626242, now seen corresponding path program 1 times [2019-11-20 11:08:50,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:50,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656434987] [2019-11-20 11:08:50,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-20 11:08:51,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656434987] [2019-11-20 11:08:51,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956818175] [2019-11-20 11:08:51,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/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-11-20 11:08:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:51,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:08:51,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 11:08:51,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:08:51,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-20 11:08:51,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432540935] [2019-11-20 11:08:51,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:08:51,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:51,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:08:51,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:51,258 INFO L87 Difference]: Start difference. First operand 9443 states and 11279 transitions. Second operand 3 states. [2019-11-20 11:08:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:52,463 INFO L93 Difference]: Finished difference Result 18514 states and 22156 transitions. [2019-11-20 11:08:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:08:52,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-20 11:08:52,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:52,513 INFO L225 Difference]: With dead ends: 18514 [2019-11-20 11:08:52,513 INFO L226 Difference]: Without dead ends: 9257 [2019-11-20 11:08:52,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 279 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-11-20 11:08:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9257 states. [2019-11-20 11:08:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9257 to 9257. [2019-11-20 11:08:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9257 states. [2019-11-20 11:08:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9257 states to 9257 states and 10788 transitions. [2019-11-20 11:08:52,690 INFO L78 Accepts]: Start accepts. Automaton has 9257 states and 10788 transitions. Word has length 278 [2019-11-20 11:08:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:52,691 INFO L462 AbstractCegarLoop]: Abstraction has 9257 states and 10788 transitions. [2019-11-20 11:08:52,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:08:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 9257 states and 10788 transitions. [2019-11-20 11:08:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-20 11:08:52,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:52,702 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:08:52,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:08:52,909 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash 627435673, now seen corresponding path program 1 times [2019-11-20 11:08:52,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:52,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900784168] [2019-11-20 11:08:52,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:53,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900784168] [2019-11-20 11:08:53,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:08:53,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:08:53,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599889674] [2019-11-20 11:08:53,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:08:53,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:53,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:08:53,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:08:53,167 INFO L87 Difference]: Start difference. First operand 9257 states and 10788 transitions. Second operand 4 states. [2019-11-20 11:08:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:08:54,281 INFO L93 Difference]: Finished difference Result 19084 states and 22277 transitions. [2019-11-20 11:08:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:08:54,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-11-20 11:08:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:08:54,299 INFO L225 Difference]: With dead ends: 19084 [2019-11-20 11:08:54,299 INFO L226 Difference]: Without dead ends: 10013 [2019-11-20 11:08:54,310 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-11-20 11:08:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2019-11-20 11:08:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 9627. [2019-11-20 11:08:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9627 states. [2019-11-20 11:08:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9627 states to 9627 states and 11195 transitions. [2019-11-20 11:08:54,438 INFO L78 Accepts]: Start accepts. Automaton has 9627 states and 11195 transitions. Word has length 281 [2019-11-20 11:08:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:08:54,438 INFO L462 AbstractCegarLoop]: Abstraction has 9627 states and 11195 transitions. [2019-11-20 11:08:54,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:08:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9627 states and 11195 transitions. [2019-11-20 11:08:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-20 11:08:54,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:08:54,447 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, 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, 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] [2019-11-20 11:08:54,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:08:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:08:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1328057524, now seen corresponding path program 1 times [2019-11-20 11:08:54,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:08:54,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867349880] [2019-11-20 11:08:54,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:08:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 107 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:08:55,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867349880] [2019-11-20 11:08:55,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093289763] [2019-11-20 11:08:55,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:08:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:08:55,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:08:55,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:08:55,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:55,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:08:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-11-20 11:08:55,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:08:55,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-20 11:08:55,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770333179] [2019-11-20 11:08:55,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:08:55,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:08:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:08:55,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 11:08:55,771 INFO L87 Difference]: Start difference. First operand 9627 states and 11195 transitions. Second operand 3 states. [2019-11-20 11:09:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:28,935 INFO L93 Difference]: Finished difference Result 22211 states and 25973 transitions. [2019-11-20 11:09:28,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:09:28,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-11-20 11:09:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:28,957 INFO L225 Difference]: With dead ends: 22211 [2019-11-20 11:09:28,957 INFO L226 Difference]: Without dead ends: 12034 [2019-11-20 11:09:28,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 11:09:28,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12034 states. [2019-11-20 11:09:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12034 to 11847. [2019-11-20 11:09:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11847 states. [2019-11-20 11:09:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13776 transitions. [2019-11-20 11:09:29,138 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13776 transitions. Word has length 305 [2019-11-20 11:09:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:29,138 INFO L462 AbstractCegarLoop]: Abstraction has 11847 states and 13776 transitions. [2019-11-20 11:09:29,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:09:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13776 transitions. [2019-11-20 11:09:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-20 11:09:29,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:29,150 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:09:29,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:09:29,354 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:29,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash 510288335, now seen corresponding path program 1 times [2019-11-20 11:09:29,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:29,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176383240] [2019-11-20 11:09:29,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-20 11:09:29,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176383240] [2019-11-20 11:09:29,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:29,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:09:29,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229060175] [2019-11-20 11:09:29,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:09:29,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:09:29,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:09:29,595 INFO L87 Difference]: Start difference. First operand 11847 states and 13776 transitions. Second operand 3 states. [2019-11-20 11:09:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:30,592 INFO L93 Difference]: Finished difference Result 25531 states and 29712 transitions. [2019-11-20 11:09:30,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:09:30,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-11-20 11:09:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:30,613 INFO L225 Difference]: With dead ends: 25531 [2019-11-20 11:09:30,613 INFO L226 Difference]: Without dead ends: 13134 [2019-11-20 11:09:30,625 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-11-20 11:09:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13134 states. [2019-11-20 11:09:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13134 to 10914. [2019-11-20 11:09:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10914 states. [2019-11-20 11:09:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10914 states to 10914 states and 12544 transitions. [2019-11-20 11:09:30,765 INFO L78 Accepts]: Start accepts. Automaton has 10914 states and 12544 transitions. Word has length 310 [2019-11-20 11:09:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:30,766 INFO L462 AbstractCegarLoop]: Abstraction has 10914 states and 12544 transitions. [2019-11-20 11:09:30,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:09:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 10914 states and 12544 transitions. [2019-11-20 11:09:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-20 11:09:30,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:30,781 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 11:09:30,782 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:30,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2040805826, now seen corresponding path program 1 times [2019-11-20 11:09:30,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:30,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840094239] [2019-11-20 11:09:30,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-20 11:09:31,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840094239] [2019-11-20 11:09:31,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:31,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:09:31,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171996158] [2019-11-20 11:09:31,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:09:31,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:31,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:09:31,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:09:31,181 INFO L87 Difference]: Start difference. First operand 10914 states and 12544 transitions. Second operand 3 states. [2019-11-20 11:09:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:32,059 INFO L93 Difference]: Finished difference Result 22200 states and 25551 transitions. [2019-11-20 11:09:32,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:09:32,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-20 11:09:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:32,073 INFO L225 Difference]: With dead ends: 22200 [2019-11-20 11:09:32,073 INFO L226 Difference]: Without dead ends: 11104 [2019-11-20 11:09:32,084 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-11-20 11:09:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2019-11-20 11:09:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 10182. [2019-11-20 11:09:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-11-20 11:09:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 11676 transitions. [2019-11-20 11:09:32,201 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 11676 transitions. Word has length 335 [2019-11-20 11:09:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:32,202 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 11676 transitions. [2019-11-20 11:09:32,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:09:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 11676 transitions. [2019-11-20 11:09:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-20 11:09:32,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:32,214 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, 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, 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] [2019-11-20 11:09:32,214 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:32,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1721381139, now seen corresponding path program 1 times [2019-11-20 11:09:32,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:32,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963468774] [2019-11-20 11:09:32,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 11:09:32,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963468774] [2019-11-20 11:09:32,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:32,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:09:32,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370175310] [2019-11-20 11:09:32,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:09:32,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:32,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:09:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:09:32,475 INFO L87 Difference]: Start difference. First operand 10182 states and 11676 transitions. Second operand 4 states. [2019-11-20 11:09:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:33,885 INFO L93 Difference]: Finished difference Result 20750 states and 23777 transitions. [2019-11-20 11:09:33,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:09:33,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-11-20 11:09:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:33,898 INFO L225 Difference]: With dead ends: 20750 [2019-11-20 11:09:33,898 INFO L226 Difference]: Without dead ends: 10754 [2019-11-20 11:09:33,903 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-11-20 11:09:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10754 states. [2019-11-20 11:09:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10754 to 10182. [2019-11-20 11:09:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10182 states. [2019-11-20 11:09:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10182 states to 10182 states and 11490 transitions. [2019-11-20 11:09:34,015 INFO L78 Accepts]: Start accepts. Automaton has 10182 states and 11490 transitions. Word has length 336 [2019-11-20 11:09:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:34,015 INFO L462 AbstractCegarLoop]: Abstraction has 10182 states and 11490 transitions. [2019-11-20 11:09:34,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:09:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 10182 states and 11490 transitions. [2019-11-20 11:09:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-20 11:09:34,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:34,028 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, 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, 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] [2019-11-20 11:09:34,029 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:34,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1682522593, now seen corresponding path program 1 times [2019-11-20 11:09:34,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:34,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177982181] [2019-11-20 11:09:34,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 46 proven. 391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:34,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177982181] [2019-11-20 11:09:34,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144797417] [2019-11-20 11:09:34,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:09:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:34,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:09:34,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:34,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:34,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 11:09:35,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:09:35,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-20 11:09:35,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091036288] [2019-11-20 11:09:35,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:09:35,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:35,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:09:35,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:09:35,201 INFO L87 Difference]: Start difference. First operand 10182 states and 11490 transitions. Second operand 4 states. [2019-11-20 11:09:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:36,751 INFO L93 Difference]: Finished difference Result 22762 states and 25749 transitions. [2019-11-20 11:09:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:09:36,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-20 11:09:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:36,764 INFO L225 Difference]: With dead ends: 22762 [2019-11-20 11:09:36,764 INFO L226 Difference]: Without dead ends: 12766 [2019-11-20 11:09:36,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:09:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12766 states. [2019-11-20 11:09:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12766 to 12024. [2019-11-20 11:09:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12024 states. [2019-11-20 11:09:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12024 states to 12024 states and 13467 transitions. [2019-11-20 11:09:36,905 INFO L78 Accepts]: Start accepts. Automaton has 12024 states and 13467 transitions. Word has length 379 [2019-11-20 11:09:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:36,905 INFO L462 AbstractCegarLoop]: Abstraction has 12024 states and 13467 transitions. [2019-11-20 11:09:36,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:09:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 12024 states and 13467 transitions. [2019-11-20 11:09:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-20 11:09:36,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:36,917 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, 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, 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] [2019-11-20 11:09:37,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:09:37,124 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:37,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash 732027564, now seen corresponding path program 1 times [2019-11-20 11:09:37,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:37,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489273406] [2019-11-20 11:09:37,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-20 11:09:37,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489273406] [2019-11-20 11:09:37,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:37,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:09:37,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057278970] [2019-11-20 11:09:37,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:09:37,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:09:37,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:09:37,407 INFO L87 Difference]: Start difference. First operand 12024 states and 13467 transitions. Second operand 4 states. [2019-11-20 11:09:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:38,617 INFO L93 Difference]: Finished difference Result 24059 states and 26951 transitions. [2019-11-20 11:09:38,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:09:38,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-20 11:09:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:38,624 INFO L225 Difference]: With dead ends: 24059 [2019-11-20 11:09:38,625 INFO L226 Difference]: Without dead ends: 12221 [2019-11-20 11:09:38,630 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-11-20 11:09:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12221 states. [2019-11-20 11:09:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12221 to 12024. [2019-11-20 11:09:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12024 states. [2019-11-20 11:09:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12024 states to 12024 states and 13243 transitions. [2019-11-20 11:09:38,747 INFO L78 Accepts]: Start accepts. Automaton has 12024 states and 13243 transitions. Word has length 379 [2019-11-20 11:09:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:38,747 INFO L462 AbstractCegarLoop]: Abstraction has 12024 states and 13243 transitions. [2019-11-20 11:09:38,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:09:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 12024 states and 13243 transitions. [2019-11-20 11:09:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-11-20 11:09:38,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:38,758 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, 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, 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] [2019-11-20 11:09:38,758 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:38,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1821887244, now seen corresponding path program 1 times [2019-11-20 11:09:38,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:38,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085234156] [2019-11-20 11:09:38,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 443 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:39,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085234156] [2019-11-20 11:09:39,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034827993] [2019-11-20 11:09:39,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:09:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:39,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:09:39,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-20 11:09:39,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:09:39,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-20 11:09:39,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965773514] [2019-11-20 11:09:39,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:09:39,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:09:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:09:39,515 INFO L87 Difference]: Start difference. First operand 12024 states and 13243 transitions. Second operand 3 states. [2019-11-20 11:09:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:40,210 INFO L93 Difference]: Finished difference Result 24052 states and 26514 transitions. [2019-11-20 11:09:40,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:09:40,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 384 [2019-11-20 11:09:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:40,218 INFO L225 Difference]: With dead ends: 24052 [2019-11-20 11:09:40,218 INFO L226 Difference]: Without dead ends: 12214 [2019-11-20 11:09:40,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:09:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-11-20 11:09:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12210. [2019-11-20 11:09:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12210 states. [2019-11-20 11:09:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12210 states to 12210 states and 13440 transitions. [2019-11-20 11:09:40,322 INFO L78 Accepts]: Start accepts. Automaton has 12210 states and 13440 transitions. Word has length 384 [2019-11-20 11:09:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:40,322 INFO L462 AbstractCegarLoop]: Abstraction has 12210 states and 13440 transitions. [2019-11-20 11:09:40,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:09:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 12210 states and 13440 transitions. [2019-11-20 11:09:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-11-20 11:09:40,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:40,335 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, 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, 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] [2019-11-20 11:09:40,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:09:40,538 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1802628130, now seen corresponding path program 1 times [2019-11-20 11:09:40,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:40,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140135779] [2019-11-20 11:09:40,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 42 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:42,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140135779] [2019-11-20 11:09:42,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53441367] [2019-11-20 11:09:42,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:09:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:42,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 11:09:42,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:42,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:42,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 242 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:42,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:09:42,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2019-11-20 11:09:42,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026610904] [2019-11-20 11:09:42,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 11:09:42,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:42,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 11:09:42,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-20 11:09:42,797 INFO L87 Difference]: Start difference. First operand 12210 states and 13440 transitions. Second operand 17 states. [2019-11-20 11:09:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:53,609 INFO L93 Difference]: Finished difference Result 35933 states and 39469 transitions. [2019-11-20 11:09:53,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 11:09:53,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 415 [2019-11-20 11:09:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:53,624 INFO L225 Difference]: With dead ends: 35933 [2019-11-20 11:09:53,624 INFO L226 Difference]: Without dead ends: 23909 [2019-11-20 11:09:53,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 11:09:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23909 states. [2019-11-20 11:09:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23909 to 15154. [2019-11-20 11:09:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15154 states. [2019-11-20 11:09:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15154 states to 15154 states and 16548 transitions. [2019-11-20 11:09:53,775 INFO L78 Accepts]: Start accepts. Automaton has 15154 states and 16548 transitions. Word has length 415 [2019-11-20 11:09:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:53,775 INFO L462 AbstractCegarLoop]: Abstraction has 15154 states and 16548 transitions. [2019-11-20 11:09:53,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 11:09:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 15154 states and 16548 transitions. [2019-11-20 11:09:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-11-20 11:09:53,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:53,787 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:09:53,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:09:53,989 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash 930313157, now seen corresponding path program 1 times [2019-11-20 11:09:53,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:53,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205573479] [2019-11-20 11:09:53,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-20 11:09:54,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205573479] [2019-11-20 11:09:54,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:09:54,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:09:54,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078127899] [2019-11-20 11:09:54,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:09:54,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:09:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:09:54,477 INFO L87 Difference]: Start difference. First operand 15154 states and 16548 transitions. Second operand 4 states. [2019-11-20 11:09:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:09:55,688 INFO L93 Difference]: Finished difference Result 32532 states and 35532 transitions. [2019-11-20 11:09:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:09:55,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 432 [2019-11-20 11:09:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:09:55,699 INFO L225 Difference]: With dead ends: 32532 [2019-11-20 11:09:55,700 INFO L226 Difference]: Without dead ends: 17012 [2019-11-20 11:09:55,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-20 11:09:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17012 states. [2019-11-20 11:09:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17012 to 14974. [2019-11-20 11:09:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14974 states. [2019-11-20 11:09:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14974 states to 14974 states and 16173 transitions. [2019-11-20 11:09:55,848 INFO L78 Accepts]: Start accepts. Automaton has 14974 states and 16173 transitions. Word has length 432 [2019-11-20 11:09:55,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:09:55,849 INFO L462 AbstractCegarLoop]: Abstraction has 14974 states and 16173 transitions. [2019-11-20 11:09:55,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:09:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 14974 states and 16173 transitions. [2019-11-20 11:09:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2019-11-20 11:09:55,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:09:55,859 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 11:09:55,859 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:09:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:09:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash -82825745, now seen corresponding path program 1 times [2019-11-20 11:09:55,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:09:55,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108666138] [2019-11-20 11:09:55,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:09:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 88 proven. 723 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:09:57,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108666138] [2019-11-20 11:09:57,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558075206] [2019-11-20 11:09:57,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:09:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:09:57,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 11:09:57,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:09:57,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:09:57,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:57,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:09:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 543 proven. 222 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 11:09:58,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:09:58,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2019-11-20 11:09:58,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24161027] [2019-11-20 11:09:58,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 11:09:58,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:09:58,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 11:09:58,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:09:58,325 INFO L87 Difference]: Start difference. First operand 14974 states and 16173 transitions. Second operand 18 states. [2019-11-20 11:10:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:10:14,366 INFO L93 Difference]: Finished difference Result 48279 states and 52136 transitions. [2019-11-20 11:10:14,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-20 11:10:14,366 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 534 [2019-11-20 11:10:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:10:14,389 INFO L225 Difference]: With dead ends: 48279 [2019-11-20 11:10:14,389 INFO L226 Difference]: Without dead ends: 33491 [2019-11-20 11:10:14,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 529 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1289, Invalid=3541, Unknown=0, NotChecked=0, Total=4830 [2019-11-20 11:10:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33491 states. [2019-11-20 11:10:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33491 to 13308. [2019-11-20 11:10:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13308 states. [2019-11-20 11:10:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13308 states to 13308 states and 14289 transitions. [2019-11-20 11:10:14,573 INFO L78 Accepts]: Start accepts. Automaton has 13308 states and 14289 transitions. Word has length 534 [2019-11-20 11:10:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:10:14,574 INFO L462 AbstractCegarLoop]: Abstraction has 13308 states and 14289 transitions. [2019-11-20 11:10:14,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 11:10:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 13308 states and 14289 transitions. [2019-11-20 11:10:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-11-20 11:10:14,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:10:14,585 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, 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, 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, 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-11-20 11:10:14,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:14,788 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:10:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:10:14,789 INFO L82 PathProgramCache]: Analyzing trace with hash 762866496, now seen corresponding path program 1 times [2019-11-20 11:10:14,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:10:14,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221877261] [2019-11-20 11:10:14,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:10:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 101 proven. 488 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-20 11:10:15,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221877261] [2019-11-20 11:10:15,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115544608] [2019-11-20 11:10:15,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:15,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:10:15,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:10:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 235 proven. 452 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 11:10:16,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:10:16,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-20 11:10:16,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504302804] [2019-11-20 11:10:16,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:10:16,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:10:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:10:16,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:10:16,271 INFO L87 Difference]: Start difference. First operand 13308 states and 14289 transitions. Second operand 8 states. [2019-11-20 11:10:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:10:18,863 INFO L93 Difference]: Finished difference Result 37133 states and 39785 transitions. [2019-11-20 11:10:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:10:18,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 570 [2019-11-20 11:10:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:10:18,878 INFO L225 Difference]: With dead ends: 37133 [2019-11-20 11:10:18,878 INFO L226 Difference]: Without dead ends: 24565 [2019-11-20 11:10:18,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:10:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24565 states. [2019-11-20 11:10:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24565 to 14600. [2019-11-20 11:10:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-11-20 11:10:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 15687 transitions. [2019-11-20 11:10:19,037 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 15687 transitions. Word has length 570 [2019-11-20 11:10:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:10:19,038 INFO L462 AbstractCegarLoop]: Abstraction has 14600 states and 15687 transitions. [2019-11-20 11:10:19,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:10:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 15687 transitions. [2019-11-20 11:10:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-11-20 11:10:19,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:10:19,044 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:10:19,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:19,245 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:10:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:10:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1272720062, now seen corresponding path program 1 times [2019-11-20 11:10:19,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:10:19,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780408698] [2019-11-20 11:10:19,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:10:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 655 proven. 496 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 11:10:19,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780408698] [2019-11-20 11:10:19,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558947525] [2019-11-20 11:10:19,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:20,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:10:20,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:10:20,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:20,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 785 proven. 96 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-11-20 11:10:20,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:10:20,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-20 11:10:20,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426297041] [2019-11-20 11:10:20,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:10:20,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:10:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:10:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:10:20,617 INFO L87 Difference]: Start difference. First operand 14600 states and 15687 transitions. Second operand 12 states. [2019-11-20 11:10:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:10:28,978 INFO L93 Difference]: Finished difference Result 41558 states and 44483 transitions. [2019-11-20 11:10:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 11:10:28,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 574 [2019-11-20 11:10:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:10:28,996 INFO L225 Difference]: With dead ends: 41558 [2019-11-20 11:10:28,996 INFO L226 Difference]: Without dead ends: 27698 [2019-11-20 11:10:29,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2019-11-20 11:10:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27698 states. [2019-11-20 11:10:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27698 to 13114. [2019-11-20 11:10:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13114 states. [2019-11-20 11:10:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 13937 transitions. [2019-11-20 11:10:29,175 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 13937 transitions. Word has length 574 [2019-11-20 11:10:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:10:29,176 INFO L462 AbstractCegarLoop]: Abstraction has 13114 states and 13937 transitions. [2019-11-20 11:10:29,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:10:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 13937 transitions. [2019-11-20 11:10:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-11-20 11:10:29,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:10:29,183 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, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:10:29,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:29,384 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:10:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:10:29,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1877441688, now seen corresponding path program 1 times [2019-11-20 11:10:29,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:10:29,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712068452] [2019-11-20 11:10:29,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:10:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 826 proven. 250 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-20 11:10:29,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712068452] [2019-11-20 11:10:29,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988827080] [2019-11-20 11:10:29,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:30,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:10:30,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:10:30,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:30,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 747 proven. 237 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-20 11:10:30,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:10:30,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 8 [2019-11-20 11:10:30,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441503307] [2019-11-20 11:10:30,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:10:30,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:10:30,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:10:30,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:10:30,522 INFO L87 Difference]: Start difference. First operand 13114 states and 13937 transitions. Second operand 8 states. [2019-11-20 11:10:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:10:33,518 INFO L93 Difference]: Finished difference Result 34704 states and 36826 transitions. [2019-11-20 11:10:33,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:10:33,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 641 [2019-11-20 11:10:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:10:33,531 INFO L225 Difference]: With dead ends: 34704 [2019-11-20 11:10:33,531 INFO L226 Difference]: Without dead ends: 18276 [2019-11-20 11:10:33,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 11:10:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-11-20 11:10:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11818. [2019-11-20 11:10:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11818 states. [2019-11-20 11:10:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11818 states to 11818 states and 12363 transitions. [2019-11-20 11:10:33,652 INFO L78 Accepts]: Start accepts. Automaton has 11818 states and 12363 transitions. Word has length 641 [2019-11-20 11:10:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:10:33,652 INFO L462 AbstractCegarLoop]: Abstraction has 11818 states and 12363 transitions. [2019-11-20 11:10:33,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:10:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 11818 states and 12363 transitions. [2019-11-20 11:10:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2019-11-20 11:10:33,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:10:33,666 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:10:33,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:33,869 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:10:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:10:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash 809804742, now seen corresponding path program 1 times [2019-11-20 11:10:33,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:10:33,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828199051] [2019-11-20 11:10:33,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:10:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 540 proven. 1728 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-11-20 11:10:35,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828199051] [2019-11-20 11:10:35,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371019166] [2019-11-20 11:10:35,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:10:35,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 11:10:35,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:10:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:10:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 390 proven. 1976 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-11-20 11:10:37,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:10:37,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-20 11:10:37,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619476547] [2019-11-20 11:10:37,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 11:10:37,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:10:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 11:10:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:10:37,862 INFO L87 Difference]: Start difference. First operand 11818 states and 12363 transitions. Second operand 16 states. [2019-11-20 11:10:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:10:47,211 INFO L93 Difference]: Finished difference Result 35827 states and 37512 transitions. [2019-11-20 11:10:47,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 11:10:47,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 982 [2019-11-20 11:10:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:10:47,213 INFO L225 Difference]: With dead ends: 35827 [2019-11-20 11:10:47,214 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 11:10:47,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 975 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 11:10:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 11:10:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 11:10:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 11:10:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 11:10:47,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 982 [2019-11-20 11:10:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:10:47,220 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:10:47,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 11:10:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 11:10:47,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 11:10:47,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:10:47,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 11:10:51,468 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 1159 DAG size of output: 943 [2019-11-20 11:10:55,274 WARN L191 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 1159 DAG size of output: 943 [2019-11-20 11:11:04,366 WARN L191 SmtUtils]: Spent 9.08 s on a formula simplification. DAG size of input: 901 DAG size of output: 170 [2019-11-20 11:11:13,373 WARN L191 SmtUtils]: Spent 9.00 s on a formula simplification. DAG size of input: 901 DAG size of output: 170 [2019-11-20 11:11:13,375 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-20 11:11:13,375 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 11:11:13,375 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-20 11:11:13,375 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,376 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,377 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse27 (+ ~a23~0 43))) (let ((.cse20 (= 12 ~a25~0)) (.cse5 (<= ~a4~0 0)) (.cse11 (<= .cse27 0)) (.cse23 (= ~a25~0 9)) (.cse2 (= 1 ~a3~0)) (.cse24 (= 1 ~a4~0))) (let ((.cse7 (<= 0 (+ ~a23~0 600262))) (.cse18 (<= 0 (+ ~a23~0 577712))) (.cse3 (<= (+ ~a23~0 127599) 0)) (.cse0 (<= 0 (+ (div (+ ~a23~0 577632) 5) 42))) (.cse9 (= ~a25~0 13)) (.cse16 (exists ((v_~a29~0_500 Int)) (let ((.cse28 (mod v_~a29~0_500 15))) (and (<= (+ .cse28 260) ~a29~0) (<= 130 v_~a29~0_500) (= 0 .cse28))))) (.cse17 (= ~a25~0 11)) (.cse25 (and .cse23 .cse2 .cse24)) (.cse22 (< 0 .cse27)) (.cse12 (<= ~a29~0 140)) (.cse13 (< 138 ~a23~0)) (.cse15 (<= 0 (+ ~a23~0 16))) (.cse21 (<= ~a23~0 247)) (.cse6 (= ~a25~0 12)) (.cse19 (exists ((v_~a29~0_505 Int)) (and (<= 0 v_~a29~0_505) (< 140 v_~a29~0_505) (<= (+ (mod v_~a29~0_505 15) 256) ~a29~0)))) (.cse1 (and .cse20 .cse5 .cse11)) (.cse8 (<= ~a29~0 277)) (.cse10 (= ~a4~0 1)) (.cse14 (= 10 ~a25~0)) (.cse4 (= 15 ~a8~0))) (or (and (and .cse0 .cse1) .cse2 .cse3 .cse4) (and .cse5 .cse4 .cse6 .cse2 .cse7 .cse8) (and (and .cse9 .cse2 .cse10 .cse4 (<= 130 ~a29~0) .cse11) .cse8) (and .cse12 .cse5 .cse2 (not .cse9) .cse7 .cse4 .cse11) (and .cse9 .cse2 .cse10 .cse4 .cse13) (and .cse10 .cse14 .cse11) (and (<= 437925 ~a23~0) .cse10 .cse4 .cse6 .cse2 (<= ~a29~0 220)) (and .cse15 (and (and .cse16 .cse2 .cse10 .cse17) .cse4)) (and .cse2 (and .cse12 .cse5 .cse14) .cse7 .cse4) (and .cse5 .cse4 .cse18 .cse17 .cse19 .cse2 .cse8 .cse11) (and (and (or (and .cse20 .cse2 .cse10 .cse8 .cse13) (and (and .cse2 .cse10 .cse17) .cse8)) (< 140 ~a29~0) .cse4) .cse18) (and .cse3 .cse4 (and .cse5 .cse16 .cse2 .cse0 .cse17)) (and .cse5 .cse4 .cse21 .cse12 (not .cse17) .cse22 .cse2) (and .cse9 .cse5 .cse4 .cse21 .cse22 .cse2) (and (or (and (and (and .cse23 .cse16 .cse24) .cse2) .cse4) (and .cse19 .cse25 (<= 0 (+ ~a23~0 599717)) .cse4)) (<= 0 (+ ~a23~0 599908))) (and .cse12 .cse23 .cse24 .cse13) (and .cse12 .cse20 .cse2 .cse10 .cse4 (exists ((v_~a23~0_472 Int)) (and (<= ~a23~0 (+ (* 4 (div (* v_~a23~0_472 (- 2)) 10)) 4)) (< 306 v_~a23~0_472) (< 0 (* 2 v_~a23~0_472)) (not (= (mod (* v_~a23~0_472 8) 10) 0))))) (and .cse2 .cse10 (<= ~a23~0 306) .cse4 .cse17 .cse13) (and (and .cse25 .cse4) .cse22) (and (and .cse2 (and .cse12 .cse20 .cse10) .cse4) .cse15 .cse21) (and .cse20 .cse2 .cse10 .cse4 .cse21 .cse13) (and .cse5 .cse15 .cse4 .cse21 .cse6 .cse2) (and (or (and .cse19 .cse1 .cse2 .cse8) (and .cse23 (exists ((v_~a29~0_503 Int)) (let ((.cse26 (mod v_~a29~0_503 299861))) (and (<= (+ .cse26 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse26)))) .cse5 .cse2 .cse11)) .cse4) (and (and .cse10 .cse14) .cse2 .cse4))))) [2019-11-20 11:11:13,377 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,378 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,378 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,378 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,378 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,378 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,378 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,378 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,379 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-20 11:11:13,379 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-20 11:11:13,379 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-20 11:11:13,379 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-20 11:11:13,379 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-20 11:11:13,379 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-20 11:11:13,379 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-20 11:11:13,379 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,380 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,380 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,380 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,380 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,380 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,380 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,380 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,381 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,381 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,381 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-20 11:11:13,381 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-20 11:11:13,381 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-20 11:11:13,381 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-20 11:11:13,381 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,381 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,382 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,382 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,382 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,382 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-20 11:11:13,382 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-20 11:11:13,382 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-20 11:11:13,382 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,383 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,383 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,383 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,383 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-20 11:11:13,383 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-20 11:11:13,383 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,383 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,383 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,384 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,384 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,384 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,384 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-20 11:11:13,384 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-20 11:11:13,384 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,384 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,385 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 11:11:13,385 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 11:11:13,385 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-20 11:11:13,385 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,385 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,385 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,385 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,386 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,386 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,386 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,386 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-20 11:11:13,386 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-20 11:11:13,386 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-20 11:11:13,386 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-20 11:11:13,386 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-20 11:11:13,387 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-20 11:11:13,387 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-20 11:11:13,387 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,387 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,387 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 11:11:13,387 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-20 11:11:13,387 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-20 11:11:13,388 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,388 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,388 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,388 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,388 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,388 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 11:11:13,388 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-20 11:11:13,388 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-20 11:11:13,389 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,389 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,389 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,389 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,389 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,389 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,389 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-20 11:11:13,390 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-20 11:11:13,390 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-20 11:11:13,390 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,390 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,390 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,390 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,390 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,391 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,391 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,391 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 11:11:13,391 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-20 11:11:13,391 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,391 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-20 11:11:13,391 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-20 11:11:13,392 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-20 11:11:13,392 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,392 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,392 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,392 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,392 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,392 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,392 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,393 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,393 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,393 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,393 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,393 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-20 11:11:13,393 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-20 11:11:13,393 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 11:11:13,394 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-20 11:11:13,394 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 11:11:13,394 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,394 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,394 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,394 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,394 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,394 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,395 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,395 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-20 11:11:13,395 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-20 11:11:13,395 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-20 11:11:13,395 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,395 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,395 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,396 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-20 11:11:13,396 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-20 11:11:13,396 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,396 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,396 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,396 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,396 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,396 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-20 11:11:13,397 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-20 11:11:13,397 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,397 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,397 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-20 11:11:13,397 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-20 11:11:13,397 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,397 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,397 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,398 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,398 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,398 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,398 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-20 11:11:13,398 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-20 11:11:13,398 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-20 11:11:13,398 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-20 11:11:13,399 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,399 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,399 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,399 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,399 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,399 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,399 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,399 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,400 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-20 11:11:13,400 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-20 11:11:13,400 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-20 11:11:13,400 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-20 11:11:13,400 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-20 11:11:13,400 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-20 11:11:13,400 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,401 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,401 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,401 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,401 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,401 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,401 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,401 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-20 11:11:13,401 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 11:11:13,402 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 11:11:13,402 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,402 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,402 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,402 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,402 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,402 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,403 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-20 11:11:13,403 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-20 11:11:13,403 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,403 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,403 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,403 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,403 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,403 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,404 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,404 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-20 11:11:13,404 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,404 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,404 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,404 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-20 11:11:13,404 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-20 11:11:13,405 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-20 11:11:13,405 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,405 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-20 11:11:13,405 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,405 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-20 11:11:13,405 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,405 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,405 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,406 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,406 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,406 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,406 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-20 11:11:13,406 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-20 11:11:13,406 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-20 11:11:13,406 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,407 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,407 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,407 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 11:11:13,407 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,407 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,407 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,407 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,407 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,408 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,408 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,408 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-20 11:11:13,408 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-20 11:11:13,408 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-20 11:11:13,408 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,408 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-20 11:11:13,409 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-20 11:11:13,409 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,409 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,409 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,409 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,409 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,409 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,409 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-20 11:11:13,410 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 11:11:13,410 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-20 11:11:13,410 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,410 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,410 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,411 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse27 (+ ~a23~0 43))) (let ((.cse20 (= 12 ~a25~0)) (.cse5 (<= ~a4~0 0)) (.cse11 (<= .cse27 0)) (.cse23 (= ~a25~0 9)) (.cse2 (= 1 ~a3~0)) (.cse24 (= 1 ~a4~0))) (let ((.cse7 (<= 0 (+ ~a23~0 600262))) (.cse18 (<= 0 (+ ~a23~0 577712))) (.cse3 (<= (+ ~a23~0 127599) 0)) (.cse0 (<= 0 (+ (div (+ ~a23~0 577632) 5) 42))) (.cse9 (= ~a25~0 13)) (.cse16 (exists ((v_~a29~0_500 Int)) (let ((.cse28 (mod v_~a29~0_500 15))) (and (<= (+ .cse28 260) ~a29~0) (<= 130 v_~a29~0_500) (= 0 .cse28))))) (.cse17 (= ~a25~0 11)) (.cse25 (and .cse23 .cse2 .cse24)) (.cse22 (< 0 .cse27)) (.cse12 (<= ~a29~0 140)) (.cse13 (< 138 ~a23~0)) (.cse15 (<= 0 (+ ~a23~0 16))) (.cse21 (<= ~a23~0 247)) (.cse6 (= ~a25~0 12)) (.cse19 (exists ((v_~a29~0_505 Int)) (and (<= 0 v_~a29~0_505) (< 140 v_~a29~0_505) (<= (+ (mod v_~a29~0_505 15) 256) ~a29~0)))) (.cse1 (and .cse20 .cse5 .cse11)) (.cse8 (<= ~a29~0 277)) (.cse10 (= ~a4~0 1)) (.cse14 (= 10 ~a25~0)) (.cse4 (= 15 ~a8~0))) (or (and (and .cse0 .cse1) .cse2 .cse3 .cse4) (and .cse5 .cse4 .cse6 .cse2 .cse7 .cse8) (and (and .cse9 .cse2 .cse10 .cse4 (<= 130 ~a29~0) .cse11) .cse8) (and .cse12 .cse5 .cse2 (not .cse9) .cse7 .cse4 .cse11) (and .cse9 .cse2 .cse10 .cse4 .cse13) (and .cse10 .cse14 .cse11) (and (<= 437925 ~a23~0) .cse10 .cse4 .cse6 .cse2 (<= ~a29~0 220)) (and .cse15 (and (and .cse16 .cse2 .cse10 .cse17) .cse4)) (and .cse2 (and .cse12 .cse5 .cse14) .cse7 .cse4) (and .cse5 .cse4 .cse18 .cse17 .cse19 .cse2 .cse8 .cse11) (and (and (or (and .cse20 .cse2 .cse10 .cse8 .cse13) (and (and .cse2 .cse10 .cse17) .cse8)) (< 140 ~a29~0) .cse4) .cse18) (and .cse3 .cse4 (and .cse5 .cse16 .cse2 .cse0 .cse17)) (and .cse5 .cse4 .cse21 .cse12 (not .cse17) .cse22 .cse2) (and .cse9 .cse5 .cse4 .cse21 .cse22 .cse2) (and (or (and (and (and .cse23 .cse16 .cse24) .cse2) .cse4) (and .cse19 .cse25 (<= 0 (+ ~a23~0 599717)) .cse4)) (<= 0 (+ ~a23~0 599908))) (and .cse12 .cse23 .cse24 .cse13) (and .cse12 .cse20 .cse2 .cse10 .cse4 (exists ((v_~a23~0_472 Int)) (and (<= ~a23~0 (+ (* 4 (div (* v_~a23~0_472 (- 2)) 10)) 4)) (< 306 v_~a23~0_472) (< 0 (* 2 v_~a23~0_472)) (not (= (mod (* v_~a23~0_472 8) 10) 0))))) (and .cse2 .cse10 (<= ~a23~0 306) .cse4 .cse17 .cse13) (and (and .cse25 .cse4) .cse22) (and (and .cse2 (and .cse12 .cse20 .cse10) .cse4) .cse15 .cse21) (and .cse20 .cse2 .cse10 .cse4 .cse21 .cse13) (and .cse5 .cse15 .cse4 .cse21 .cse6 .cse2) (and (or (and .cse19 .cse1 .cse2 .cse8) (and .cse23 (exists ((v_~a29~0_503 Int)) (let ((.cse26 (mod v_~a29~0_503 299861))) (and (<= (+ .cse26 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse26)))) .cse5 .cse2 .cse11)) .cse4) (and (and .cse10 .cse14) .cse2 .cse4))))) [2019-11-20 11:11:13,411 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,411 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-20 11:11:13,411 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-20 11:11:13,411 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,412 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,412 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-20 11:11:13,412 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,412 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,412 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 11:11:13,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,444 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:11:13 BoogieIcfgContainer [2019-11-20 11:11:13,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 11:11:13,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:11:13,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:11:13,475 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:11:13,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:08:36" (3/4) ... [2019-11-20 11:11:13,478 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 11:11:13,503 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 11:11:13,505 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 11:11:13,531 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 <= (a23 + 577632) / 5 + 42 && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a23 + 127599 <= 0) && 15 == a8) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && 1 == a3) && 0 <= a23 + 600262) && a29 <= 277)) || ((((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && a23 + 43 <= 0) && a29 <= 277)) || ((((((a29 <= 140 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 138 < a23)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((((437925 <= a23 && a4 == 1) && 15 == a8) && a25 == 12) && 1 == a3) && a29 <= 220)) || (0 <= a23 + 16 && ((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && a4 == 1) && a25 == 11) && 15 == a8)) || (((1 == a3 && (a29 <= 140 && a4 <= 0) && 10 == a25) && 0 <= a23 + 600262) && 15 == a8)) || (((((((a4 <= 0 && 15 == a8) && 0 <= a23 + 577712) && a25 == 11) && (\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29)) && 1 == a3) && a29 <= 277) && a23 + 43 <= 0)) || ((((((((12 == a25 && 1 == a3) && a4 == 1) && a29 <= 277) && 138 < a23) || (((1 == a3 && a4 == 1) && a25 == 11) && a29 <= 277)) && 140 < a29) && 15 == a8) && 0 <= a23 + 577712)) || ((a23 + 127599 <= 0 && 15 == a8) && (((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11)) || ((((((a4 <= 0 && 15 == a8) && a23 <= 247) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && 1 == a3)) || (((((a25 == 13 && a4 <= 0) && 15 == a8) && a23 <= 247) && 0 < a23 + 43) && 1 == a3)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a4) && 1 == a3) && 15 == a8) || ((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (a25 == 9 && 1 == a3) && 1 == a4) && 0 <= a23 + 599717) && 15 == a8)) && 0 <= a23 + 599908)) || (((a29 <= 140 && a25 == 9) && 1 == a4) && 138 < a23)) || (((((a29 <= 140 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0)))) || (((((1 == a3 && a4 == 1) && a23 <= 306) && 15 == a8) && a25 == 11) && 138 < a23)) || ((((a25 == 9 && 1 == a3) && 1 == a4) && 15 == a8) && 0 < a23 + 43)) || ((((1 == a3 && (a29 <= 140 && 12 == a25) && a4 == 1) && 15 == a8) && 0 <= a23 + 16) && a23 <= 247)) || (((((12 == a25 && 1 == a3) && a4 == 1) && 15 == a8) && a23 <= 247) && 138 < a23)) || (((((a4 <= 0 && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && a25 == 12) && 1 == a3)) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a29 <= 277) || ((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && a23 + 43 <= 0)) && 15 == a8)) || (((a4 == 1 && 10 == a25) && 1 == a3) && 15 == a8) [2019-11-20 11:11:13,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 <= (a23 + 577632) / 5 + 42 && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a23 + 127599 <= 0) && 15 == a8) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && 1 == a3) && 0 <= a23 + 600262) && a29 <= 277)) || ((((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && a23 + 43 <= 0) && a29 <= 277)) || ((((((a29 <= 140 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 138 < a23)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((((437925 <= a23 && a4 == 1) && 15 == a8) && a25 == 12) && 1 == a3) && a29 <= 220)) || (0 <= a23 + 16 && ((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && a4 == 1) && a25 == 11) && 15 == a8)) || (((1 == a3 && (a29 <= 140 && a4 <= 0) && 10 == a25) && 0 <= a23 + 600262) && 15 == a8)) || (((((((a4 <= 0 && 15 == a8) && 0 <= a23 + 577712) && a25 == 11) && (\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29)) && 1 == a3) && a29 <= 277) && a23 + 43 <= 0)) || ((((((((12 == a25 && 1 == a3) && a4 == 1) && a29 <= 277) && 138 < a23) || (((1 == a3 && a4 == 1) && a25 == 11) && a29 <= 277)) && 140 < a29) && 15 == a8) && 0 <= a23 + 577712)) || ((a23 + 127599 <= 0 && 15 == a8) && (((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11)) || ((((((a4 <= 0 && 15 == a8) && a23 <= 247) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && 1 == a3)) || (((((a25 == 13 && a4 <= 0) && 15 == a8) && a23 <= 247) && 0 < a23 + 43) && 1 == a3)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a4) && 1 == a3) && 15 == a8) || ((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (a25 == 9 && 1 == a3) && 1 == a4) && 0 <= a23 + 599717) && 15 == a8)) && 0 <= a23 + 599908)) || (((a29 <= 140 && a25 == 9) && 1 == a4) && 138 < a23)) || (((((a29 <= 140 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0)))) || (((((1 == a3 && a4 == 1) && a23 <= 306) && 15 == a8) && a25 == 11) && 138 < a23)) || ((((a25 == 9 && 1 == a3) && 1 == a4) && 15 == a8) && 0 < a23 + 43)) || ((((1 == a3 && (a29 <= 140 && 12 == a25) && a4 == 1) && 15 == a8) && 0 <= a23 + 16) && a23 <= 247)) || (((((12 == a25 && 1 == a3) && a4 == 1) && 15 == a8) && a23 <= 247) && 138 < a23)) || (((((a4 <= 0 && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && a25 == 12) && 1 == a3)) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a29 <= 277) || ((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && a23 + 43 <= 0)) && 15 == a8)) || (((a4 == 1 && 10 == a25) && 1 == a3) && 15 == a8) [2019-11-20 11:11:13,672 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a3c04552-29a4-4c44-aacc-8b3c62453d6c/bin/uautomizer/witness.graphml [2019-11-20 11:11:13,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:11:13,674 INFO L168 Benchmark]: Toolchain (without parser) took 159769.03 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 945.1 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-20 11:11:13,675 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:11:13,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:11:13,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:11:13,676 INFO L168 Benchmark]: Boogie Preprocessor took 132.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:11:13,676 INFO L168 Benchmark]: RCFGBuilder took 1842.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 887.4 MB in the end (delta: 175.1 MB). Peak memory consumption was 175.1 MB. Max. memory is 11.5 GB. [2019-11-20 11:11:13,677 INFO L168 Benchmark]: TraceAbstraction took 156640.30 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 887.4 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-11-20 11:11:13,677 INFO L168 Benchmark]: Witness Printer took 198.06 ms. Allocated memory is still 4.7 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:11:13,679 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 818.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1842.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 887.4 MB in the end (delta: 175.1 MB). Peak memory consumption was 175.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 156640.30 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 887.4 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 198.06 ms. Allocated memory is still 4.7 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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-11-20 11:11:13,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((0 <= (a23 + 577632) / 5 + 42 && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a23 + 127599 <= 0) && 15 == a8) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && 1 == a3) && 0 <= a23 + 600262) && a29 <= 277)) || ((((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && a23 + 43 <= 0) && a29 <= 277)) || ((((((a29 <= 140 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 138 < a23)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((((437925 <= a23 && a4 == 1) && 15 == a8) && a25 == 12) && 1 == a3) && a29 <= 220)) || (0 <= a23 + 16 && ((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && a4 == 1) && a25 == 11) && 15 == a8)) || (((1 == a3 && (a29 <= 140 && a4 <= 0) && 10 == a25) && 0 <= a23 + 600262) && 15 == a8)) || (((((((a4 <= 0 && 15 == a8) && 0 <= a23 + 577712) && a25 == 11) && (\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29)) && 1 == a3) && a29 <= 277) && a23 + 43 <= 0)) || ((((((((12 == a25 && 1 == a3) && a4 == 1) && a29 <= 277) && 138 < a23) || (((1 == a3 && a4 == 1) && a25 == 11) && a29 <= 277)) && 140 < a29) && 15 == a8) && 0 <= a23 + 577712)) || ((a23 + 127599 <= 0 && 15 == a8) && (((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11)) || ((((((a4 <= 0 && 15 == a8) && a23 <= 247) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && 1 == a3)) || (((((a25 == 13 && a4 <= 0) && 15 == a8) && a23 <= 247) && 0 < a23 + 43) && 1 == a3)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a4) && 1 == a3) && 15 == a8) || ((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (a25 == 9 && 1 == a3) && 1 == a4) && 0 <= a23 + 599717) && 15 == a8)) && 0 <= a23 + 599908)) || (((a29 <= 140 && a25 == 9) && 1 == a4) && 138 < a23)) || (((((a29 <= 140 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0)))) || (((((1 == a3 && a4 == 1) && a23 <= 306) && 15 == a8) && a25 == 11) && 138 < a23)) || ((((a25 == 9 && 1 == a3) && 1 == a4) && 15 == a8) && 0 < a23 + 43)) || ((((1 == a3 && (a29 <= 140 && 12 == a25) && a4 == 1) && 15 == a8) && 0 <= a23 + 16) && a23 <= 247)) || (((((12 == a25 && 1 == a3) && a4 == 1) && 15 == a8) && a23 <= 247) && 138 < a23)) || (((((a4 <= 0 && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && a25 == 12) && 1 == a3)) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a29 <= 277) || ((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && a23 + 43 <= 0)) && 15 == a8)) || (((a4 == 1 && 10 == a25) && 1 == a3) && 15 == a8) - InvariantResult [Line: 22]: Loop Invariant [2019-11-20 11:11:13,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 11:11:13,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-11-20 11:11:13,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 11:11:13,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 11:11:13,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((0 <= (a23 + 577632) / 5 + 42 && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a23 + 127599 <= 0) && 15 == a8) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && 1 == a3) && 0 <= a23 + 600262) && a29 <= 277)) || ((((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 130 <= a29) && a23 + 43 <= 0) && a29 <= 277)) || ((((((a29 <= 140 && a4 <= 0) && 1 == a3) && !(a25 == 13)) && 0 <= a23 + 600262) && 15 == a8) && a23 + 43 <= 0)) || ((((a25 == 13 && 1 == a3) && a4 == 1) && 15 == a8) && 138 < a23)) || ((a4 == 1 && 10 == a25) && a23 + 43 <= 0)) || (((((437925 <= a23 && a4 == 1) && 15 == a8) && a25 == 12) && 1 == a3) && a29 <= 220)) || (0 <= a23 + 16 && ((((\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15) && 1 == a3) && a4 == 1) && a25 == 11) && 15 == a8)) || (((1 == a3 && (a29 <= 140 && a4 <= 0) && 10 == a25) && 0 <= a23 + 600262) && 15 == a8)) || (((((((a4 <= 0 && 15 == a8) && 0 <= a23 + 577712) && a25 == 11) && (\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29)) && 1 == a3) && a29 <= 277) && a23 + 43 <= 0)) || ((((((((12 == a25 && 1 == a3) && a4 == 1) && a29 <= 277) && 138 < a23) || (((1 == a3 && a4 == 1) && a25 == 11) && a29 <= 277)) && 140 < a29) && 15 == a8) && 0 <= a23 + 577712)) || ((a23 + 127599 <= 0 && 15 == a8) && (((a4 <= 0 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a3) && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11)) || ((((((a4 <= 0 && 15 == a8) && a23 <= 247) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && 1 == a3)) || (((((a25 == 13 && a4 <= 0) && 15 == a8) && a23 <= 247) && 0 < a23 + 43) && 1 == a3)) || ((((((a25 == 9 && (\exists v_~a29~0_500 : int :: (v_~a29~0_500 % 15 + 260 <= a29 && 130 <= v_~a29~0_500) && 0 == v_~a29~0_500 % 15)) && 1 == a4) && 1 == a3) && 15 == a8) || ((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (a25 == 9 && 1 == a3) && 1 == a4) && 0 <= a23 + 599717) && 15 == a8)) && 0 <= a23 + 599908)) || (((a29 <= 140 && a25 == 9) && 1 == a4) && 138 < a23)) || (((((a29 <= 140 && 12 == a25) && 1 == a3) && a4 == 1) && 15 == a8) && (\exists v_~a23~0_472 : int :: ((a23 <= 4 * (v_~a23~0_472 * -2 / 10) + 4 && 306 < v_~a23~0_472) && 0 < 2 * v_~a23~0_472) && !(v_~a23~0_472 * 8 % 10 == 0)))) || (((((1 == a3 && a4 == 1) && a23 <= 306) && 15 == a8) && a25 == 11) && 138 < a23)) || ((((a25 == 9 && 1 == a3) && 1 == a4) && 15 == a8) && 0 < a23 + 43)) || ((((1 == a3 && (a29 <= 140 && 12 == a25) && a4 == 1) && 15 == a8) && 0 <= a23 + 16) && a23 <= 247)) || (((((12 == a25 && 1 == a3) && a4 == 1) && 15 == a8) && a23 <= 247) && 138 < a23)) || (((((a4 <= 0 && 0 <= a23 + 16) && 15 == a8) && a23 <= 247) && a25 == 12) && 1 == a3)) || ((((((\exists v_~a29~0_505 : int :: (0 <= v_~a29~0_505 && 140 < v_~a29~0_505) && v_~a29~0_505 % 15 + 256 <= a29) && (12 == a25 && a4 <= 0) && a23 + 43 <= 0) && 1 == a3) && a29 <= 277) || ((((a25 == 9 && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && a4 <= 0) && 1 == a3) && a23 + 43 <= 0)) && 15 == a8)) || (((a4 == 1 && 10 == a25) && 1 == a3) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 156.5s, OverallIterations: 22, TraceHistogramMax: 8, AutomataDifference: 104.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.9s, HoareTripleCheckerStatistics: 3590 SDtfs, 30562 SDslu, 1761 SDs, 0 SdLazy, 69906 SolverSat, 7908 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 86.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5594 GetRequests, 5343 SyntacticMatches, 8 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2737 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15154occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 68552 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 348 NumberOfFragments, 1423 HoareAnnotationTreeSize, 3 FomulaSimplifications, 13054722 FormulaSimplificationTreeSizeReduction, 7.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7408710 FormulaSimplificationTreeSizeReductionInter, 18.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 13523 NumberOfCodeBlocks, 13523 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 13490 ConstructedInterpolants, 564 QuantifiedInterpolants, 40447792 SizeOfPredicates, 21 NumberOfNonLiveVariables, 6925 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 12360/20429 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...