./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label23.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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 e2b1b3074ba1970495a934bff93d8ae3ffe89d9a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:44:16,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:44:16,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:44:16,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:44:16,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:44:16,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:44:16,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:44:16,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:44:16,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:44:16,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:44:16,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:44:16,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:44:16,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:44:16,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:44:16,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:44:16,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:44:16,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:44:16,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:44:16,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:44:16,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:44:16,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:44:16,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:44:16,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:44:16,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:44:16,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:44:16,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:44:16,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:44:16,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:44:16,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:44:16,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:44:16,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:44:16,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:44:16,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:44:16,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:44:16,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:44:16,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:44:16,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:44:16,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:44:16,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:44:16,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:44:16,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:44:16,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:44:16,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:44:16,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:44:16,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:44:16,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:44:16,970 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:44:16,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:44:16,971 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:44:16,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:44:16,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:44:16,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:44:16,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:44:16,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:44:16,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:44:16,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:44:16,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:44:16,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:44:16,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:44:16,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:44:16,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:44:16,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:44:16,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:44:16,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:44:16,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:44:16,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:44:16,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:44:16,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:44:16,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:44:16,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:44:16,979 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_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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 -> e2b1b3074ba1970495a934bff93d8ae3ffe89d9a [2019-11-15 22:44:17,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:44:17,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:44:17,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:44:17,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:44:17,049 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:44:17,050 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label23.c [2019-11-15 22:44:17,127 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/data/664fe91da/600395a408194e4b9f0d8be0f2e5b886/FLAG1a024e10d [2019-11-15 22:44:17,781 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:44:17,788 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/sv-benchmarks/c/eca-rers2012/Problem14_label23.c [2019-11-15 22:44:17,803 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/data/664fe91da/600395a408194e4b9f0d8be0f2e5b886/FLAG1a024e10d [2019-11-15 22:44:17,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/data/664fe91da/600395a408194e4b9f0d8be0f2e5b886 [2019-11-15 22:44:17,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:44:17,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:44:17,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:44:17,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:44:17,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:44:17,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:44:17" (1/1) ... [2019-11-15 22:44:17,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e206a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:17, skipping insertion in model container [2019-11-15 22:44:17,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:44:17" (1/1) ... [2019-11-15 22:44:18,005 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:44:18,073 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:44:18,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:44:18,667 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:44:18,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:44:18,924 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:44:18,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18 WrapperNode [2019-11-15 22:44:18,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:44:18,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:44:18,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:44:18,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:44:18,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:18,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:19,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:44:19,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:44:19,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:44:19,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:44:19,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:19,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:19,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:19,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:19,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:19,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:19,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... [2019-11-15 22:44:19,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:44:19,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:44:19,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:44:19,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:44:19,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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-15 22:44:19,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:44:19,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:44:21,118 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:44:21,119 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:44:21,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:44:21 BoogieIcfgContainer [2019-11-15 22:44:21,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:44:21,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:44:21,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:44:21,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:44:21,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:44:17" (1/3) ... [2019-11-15 22:44:21,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebe6a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:44:21, skipping insertion in model container [2019-11-15 22:44:21,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:44:18" (2/3) ... [2019-11-15 22:44:21,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebe6a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:44:21, skipping insertion in model container [2019-11-15 22:44:21,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:44:21" (3/3) ... [2019-11-15 22:44:21,130 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label23.c [2019-11-15 22:44:21,141 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:44:21,150 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:44:21,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:44:21,194 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:44:21,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:44:21,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:44:21,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:44:21,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:44:21,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:44:21,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:44:21,196 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:44:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 22:44:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 22:44:21,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:21,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:21,238 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2019-11-15 22:44:21,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:21,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507701279] [2019-11-15 22:44:21,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:21,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:21,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:21,599 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-15 22:44:21,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507701279] [2019-11-15 22:44:21,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:21,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:44:21,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83764250] [2019-11-15 22:44:21,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:21,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:21,626 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-15 22:44:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:24,100 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-15 22:44:24,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:24,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 22:44:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:24,139 INFO L225 Difference]: With dead ends: 850 [2019-11-15 22:44:24,145 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 22:44:24,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 22:44:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-15 22:44:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 22:44:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-11-15 22:44:24,266 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 32 [2019-11-15 22:44:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:24,267 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-11-15 22:44:24,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-11-15 22:44:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-15 22:44:24,275 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:24,277 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:44:24,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash 266816249, now seen corresponding path program 1 times [2019-11-15 22:44:24,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:24,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150252318] [2019-11-15 22:44:24,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:24,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:24,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:44:24,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150252318] [2019-11-15 22:44:24,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:24,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:44:24,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919723911] [2019-11-15 22:44:24,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:24,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:24,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:24,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:24,518 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-11-15 22:44:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:26,201 INFO L93 Difference]: Finished difference Result 2144 states and 3249 transitions. [2019-11-15 22:44:26,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:26,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-15 22:44:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:26,217 INFO L225 Difference]: With dead ends: 2144 [2019-11-15 22:44:26,217 INFO L226 Difference]: Without dead ends: 1608 [2019-11-15 22:44:26,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-11-15 22:44:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2019-11-15 22:44:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-11-15 22:44:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2208 transitions. [2019-11-15 22:44:26,300 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2208 transitions. Word has length 114 [2019-11-15 22:44:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:26,301 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 2208 transitions. [2019-11-15 22:44:26,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2208 transitions. [2019-11-15 22:44:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 22:44:26,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:26,310 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:44:26,310 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -827986371, now seen corresponding path program 1 times [2019-11-15 22:44:26,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:26,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845286269] [2019-11-15 22:44:26,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:26,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:26,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:44:26,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845286269] [2019-11-15 22:44:26,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261619942] [2019-11-15 22:44:26,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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-15 22:44:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:26,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:44:26,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:44:27,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:44:27,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-15 22:44:27,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015256402] [2019-11-15 22:44:27,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:44:27,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:44:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:44:27,013 INFO L87 Difference]: Start difference. First operand 1606 states and 2208 transitions. Second operand 3 states. [2019-11-15 22:44:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:28,091 INFO L93 Difference]: Finished difference Result 2854 states and 3985 transitions. [2019-11-15 22:44:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:44:28,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-15 22:44:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:28,112 INFO L225 Difference]: With dead ends: 2854 [2019-11-15 22:44:28,113 INFO L226 Difference]: Without dead ends: 2852 [2019-11-15 22:44:28,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:44:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-15 22:44:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1428. [2019-11-15 22:44:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-15 22:44:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1993 transitions. [2019-11-15 22:44:28,170 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1993 transitions. Word has length 138 [2019-11-15 22:44:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:28,171 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1993 transitions. [2019-11-15 22:44:28,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:44:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1993 transitions. [2019-11-15 22:44:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 22:44:28,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:28,177 INFO L380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:44:28,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:44:28,382 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash 819167030, now seen corresponding path program 1 times [2019-11-15 22:44:28,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:28,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95143708] [2019-11-15 22:44:28,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:28,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:28,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:44:28,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95143708] [2019-11-15 22:44:28,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:28,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:44:28,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251836764] [2019-11-15 22:44:28,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:28,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:28,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:28,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:28,517 INFO L87 Difference]: Start difference. First operand 1428 states and 1993 transitions. Second operand 4 states. [2019-11-15 22:44:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:30,192 INFO L93 Difference]: Finished difference Result 4278 states and 5972 transitions. [2019-11-15 22:44:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:30,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-15 22:44:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:30,211 INFO L225 Difference]: With dead ends: 4278 [2019-11-15 22:44:30,212 INFO L226 Difference]: Without dead ends: 2852 [2019-11-15 22:44:30,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-15 22:44:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2019-11-15 22:44:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2019-11-15 22:44:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3217 transitions. [2019-11-15 22:44:30,291 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3217 transitions. Word has length 177 [2019-11-15 22:44:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:30,292 INFO L462 AbstractCegarLoop]: Abstraction has 2496 states and 3217 transitions. [2019-11-15 22:44:30,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3217 transitions. [2019-11-15 22:44:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 22:44:30,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:30,297 INFO L380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 22:44:30,297 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:30,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash 872689753, now seen corresponding path program 1 times [2019-11-15 22:44:30,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:30,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456261262] [2019-11-15 22:44:30,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:30,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:30,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 132 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:44:30,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456261262] [2019-11-15 22:44:30,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548012533] [2019-11-15 22:44:30,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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-15 22:44:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:30,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:44:30,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:44:30,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:44:30,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 22:44:30,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232518141] [2019-11-15 22:44:30,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:30,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:44:30,827 INFO L87 Difference]: Start difference. First operand 2496 states and 3217 transitions. Second operand 4 states. [2019-11-15 22:44:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:31,743 INFO L93 Difference]: Finished difference Result 5226 states and 6692 transitions. [2019-11-15 22:44:31,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:31,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-15 22:44:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:31,760 INFO L225 Difference]: With dead ends: 5226 [2019-11-15 22:44:31,761 INFO L226 Difference]: Without dead ends: 2674 [2019-11-15 22:44:31,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:44:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-15 22:44:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-15 22:44:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 22:44:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2574 transitions. [2019-11-15 22:44:31,823 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2574 transitions. Word has length 191 [2019-11-15 22:44:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:31,823 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2574 transitions. [2019-11-15 22:44:31,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2574 transitions. [2019-11-15 22:44:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-15 22:44:31,829 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:31,830 INFO L380 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:44:32,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:44:32,044 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -424271452, now seen corresponding path program 1 times [2019-11-15 22:44:32,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:32,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757719658] [2019-11-15 22:44:32,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:32,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:32,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 209 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:44:32,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757719658] [2019-11-15 22:44:32,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409831359] [2019-11-15 22:44:32,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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-15 22:44:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:32,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:44:32,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-15 22:44:33,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:44:33,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-15 22:44:33,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717525064] [2019-11-15 22:44:33,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:44:33,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:44:33,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:44:33,139 INFO L87 Difference]: Start difference. First operand 2318 states and 2574 transitions. Second operand 7 states. [2019-11-15 22:44:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:34,041 INFO L93 Difference]: Finished difference Result 4912 states and 5436 transitions. [2019-11-15 22:44:34,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:44:34,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 286 [2019-11-15 22:44:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:34,061 INFO L225 Difference]: With dead ends: 4912 [2019-11-15 22:44:34,061 INFO L226 Difference]: Without dead ends: 2496 [2019-11-15 22:44:34,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:44:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2019-11-15 22:44:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2019-11-15 22:44:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 22:44:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2526 transitions. [2019-11-15 22:44:34,117 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2526 transitions. Word has length 286 [2019-11-15 22:44:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:34,118 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2526 transitions. [2019-11-15 22:44:34,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:44:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2526 transitions. [2019-11-15 22:44:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-11-15 22:44:34,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:34,133 INFO L380 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 22:44:34,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:44:34,338 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:34,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:34,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1180337235, now seen corresponding path program 1 times [2019-11-15 22:44:34,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:34,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925872968] [2019-11-15 22:44:34,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:34,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:34,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 551 proven. 4 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 22:44:35,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925872968] [2019-11-15 22:44:35,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411488568] [2019-11-15 22:44:35,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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-15 22:44:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:35,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:44:35,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:44:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 532 proven. 23 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-15 22:44:35,934 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:44:35,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 22:44:35,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820612448] [2019-11-15 22:44:35,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:44:35,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:44:35,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:44:35,937 INFO L87 Difference]: Start difference. First operand 2318 states and 2526 transitions. Second operand 8 states. [2019-11-15 22:44:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:37,760 INFO L93 Difference]: Finished difference Result 5394 states and 5828 transitions. [2019-11-15 22:44:37,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:44:37,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 521 [2019-11-15 22:44:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:37,779 INFO L225 Difference]: With dead ends: 5394 [2019-11-15 22:44:37,779 INFO L226 Difference]: Without dead ends: 3078 [2019-11-15 22:44:37,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 518 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:44:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-11-15 22:44:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2318. [2019-11-15 22:44:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 22:44:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2524 transitions. [2019-11-15 22:44:37,847 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2524 transitions. Word has length 521 [2019-11-15 22:44:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:37,848 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2524 transitions. [2019-11-15 22:44:37,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:44:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2524 transitions. [2019-11-15 22:44:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-11-15 22:44:37,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:37,875 INFO L380 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 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-15 22:44:38,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:44:38,080 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1907590994, now seen corresponding path program 1 times [2019-11-15 22:44:38,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:38,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377068917] [2019-11-15 22:44:38,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:38,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:38,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 628 proven. 174 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-15 22:44:40,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377068917] [2019-11-15 22:44:40,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953520667] [2019-11-15 22:44:40,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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-15 22:44:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:40,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:44:40,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 773 proven. 29 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-15 22:44:41,579 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:44:41,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 22:44:41,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75831094] [2019-11-15 22:44:41,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:44:41,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:41,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:44:41,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:44:41,582 INFO L87 Difference]: Start difference. First operand 2318 states and 2524 transitions. Second operand 8 states. [2019-11-15 22:44:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:43,095 INFO L93 Difference]: Finished difference Result 5399 states and 5837 transitions. [2019-11-15 22:44:43,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:44:43,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 655 [2019-11-15 22:44:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:43,114 INFO L225 Difference]: With dead ends: 5399 [2019-11-15 22:44:43,115 INFO L226 Difference]: Without dead ends: 3083 [2019-11-15 22:44:43,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 652 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:44:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2019-11-15 22:44:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2496. [2019-11-15 22:44:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2019-11-15 22:44:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2706 transitions. [2019-11-15 22:44:43,178 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2706 transitions. Word has length 655 [2019-11-15 22:44:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:43,179 INFO L462 AbstractCegarLoop]: Abstraction has 2496 states and 2706 transitions. [2019-11-15 22:44:43,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:44:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2706 transitions. [2019-11-15 22:44:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-11-15 22:44:43,186 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:43,187 INFO L380 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:43,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:44:43,393 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1502033299, now seen corresponding path program 1 times [2019-11-15 22:44:43,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:43,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029910313] [2019-11-15 22:44:43,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:43,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:43,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 813 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-15 22:44:45,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029910313] [2019-11-15 22:44:45,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:45,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:44:45,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170255361] [2019-11-15 22:44:45,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:44:45,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:45,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:44:45,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:44:45,221 INFO L87 Difference]: Start difference. First operand 2496 states and 2706 transitions. Second operand 7 states. [2019-11-15 22:44:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:47,480 INFO L93 Difference]: Finished difference Result 5580 states and 6016 transitions. [2019-11-15 22:44:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:44:47,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 666 [2019-11-15 22:44:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:47,499 INFO L225 Difference]: With dead ends: 5580 [2019-11-15 22:44:47,499 INFO L226 Difference]: Without dead ends: 3086 [2019-11-15 22:44:47,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:44:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2019-11-15 22:44:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 2674. [2019-11-15 22:44:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-11-15 22:44:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2887 transitions. [2019-11-15 22:44:47,564 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2887 transitions. Word has length 666 [2019-11-15 22:44:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:47,565 INFO L462 AbstractCegarLoop]: Abstraction has 2674 states and 2887 transitions. [2019-11-15 22:44:47,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:44:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2887 transitions. [2019-11-15 22:44:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2019-11-15 22:44:47,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:47,575 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 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, 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] [2019-11-15 22:44:47,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:47,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash -834510759, now seen corresponding path program 1 times [2019-11-15 22:44:47,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:47,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300286935] [2019-11-15 22:44:47,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:47,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:47,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 1037 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-11-15 22:44:48,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300286935] [2019-11-15 22:44:48,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:48,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:44:48,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578522196] [2019-11-15 22:44:48,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:44:48,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:44:48,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:48,215 INFO L87 Difference]: Start difference. First operand 2674 states and 2887 transitions. Second operand 3 states. [2019-11-15 22:44:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:49,078 INFO L93 Difference]: Finished difference Result 6592 states and 7106 transitions. [2019-11-15 22:44:49,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:44:49,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 682 [2019-11-15 22:44:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:49,102 INFO L225 Difference]: With dead ends: 6592 [2019-11-15 22:44:49,102 INFO L226 Difference]: Without dead ends: 3920 [2019-11-15 22:44:49,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:49,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-15 22:44:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-11-15 22:44:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-15 22:44:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4015 transitions. [2019-11-15 22:44:49,302 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4015 transitions. Word has length 682 [2019-11-15 22:44:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:49,303 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 4015 transitions. [2019-11-15 22:44:49,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:44:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4015 transitions. [2019-11-15 22:44:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2019-11-15 22:44:49,316 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:49,318 INFO L380 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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-15 22:44:49,318 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash -907298080, now seen corresponding path program 1 times [2019-11-15 22:44:49,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:49,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532479049] [2019-11-15 22:44:49,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:49,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:49,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2149 backedges. 1373 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-11-15 22:44:50,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532479049] [2019-11-15 22:44:50,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:50,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:44:50,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288933654] [2019-11-15 22:44:50,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:50,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:50,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:50,171 INFO L87 Difference]: Start difference. First operand 3742 states and 4015 transitions. Second operand 4 states. [2019-11-15 22:44:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:51,554 INFO L93 Difference]: Finished difference Result 9262 states and 10025 transitions. [2019-11-15 22:44:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:51,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 837 [2019-11-15 22:44:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:51,594 INFO L225 Difference]: With dead ends: 9262 [2019-11-15 22:44:51,603 INFO L226 Difference]: Without dead ends: 5522 [2019-11-15 22:44:51,608 INFO L600 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-15 22:44:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2019-11-15 22:44:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4988. [2019-11-15 22:44:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-15 22:44:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5322 transitions. [2019-11-15 22:44:51,722 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5322 transitions. Word has length 837 [2019-11-15 22:44:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:51,723 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5322 transitions. [2019-11-15 22:44:51,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5322 transitions. [2019-11-15 22:44:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2019-11-15 22:44:51,736 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:51,737 INFO L380 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, 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:51,738 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash -596181461, now seen corresponding path program 1 times [2019-11-15 22:44:51,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:51,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064323601] [2019-11-15 22:44:51,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:51,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:51,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1552 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-11-15 22:44:53,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064323601] [2019-11-15 22:44:53,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:53,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:44:53,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367449547] [2019-11-15 22:44:53,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:44:53,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:44:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:44:53,853 INFO L87 Difference]: Start difference. First operand 4988 states and 5322 transitions. Second operand 7 states. [2019-11-15 22:44:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:55,313 INFO L93 Difference]: Finished difference Result 10155 states and 10829 transitions. [2019-11-15 22:44:55,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:44:55,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 858 [2019-11-15 22:44:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:55,326 INFO L225 Difference]: With dead ends: 10155 [2019-11-15 22:44:55,326 INFO L226 Difference]: Without dead ends: 5347 [2019-11-15 22:44:55,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:44:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2019-11-15 22:44:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 4988. [2019-11-15 22:44:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-11-15 22:44:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5317 transitions. [2019-11-15 22:44:55,458 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5317 transitions. Word has length 858 [2019-11-15 22:44:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:55,459 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 5317 transitions. [2019-11-15 22:44:55,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:44:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5317 transitions. [2019-11-15 22:44:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2019-11-15 22:44:55,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:55,479 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:55,479 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:55,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:55,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1984770699, now seen corresponding path program 1 times [2019-11-15 22:44:55,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:55,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296062884] [2019-11-15 22:44:55,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:55,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:55,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2019-11-15 22:44:56,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296062884] [2019-11-15 22:44:56,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:56,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:44:56,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61878631] [2019-11-15 22:44:56,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:56,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:56,509 INFO L87 Difference]: Start difference. First operand 4988 states and 5317 transitions. Second operand 4 states. [2019-11-15 22:44:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:57,649 INFO L93 Difference]: Finished difference Result 11398 states and 12149 transitions. [2019-11-15 22:44:57,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:57,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 935 [2019-11-15 22:44:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:57,660 INFO L225 Difference]: With dead ends: 11398 [2019-11-15 22:44:57,661 INFO L226 Difference]: Without dead ends: 5166 [2019-11-15 22:44:57,670 INFO L600 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-15 22:44:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-11-15 22:44:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2019-11-15 22:44:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 22:44:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4894 transitions. [2019-11-15 22:44:57,749 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4894 transitions. Word has length 935 [2019-11-15 22:44:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:57,750 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4894 transitions. [2019-11-15 22:44:57,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4894 transitions. [2019-11-15 22:44:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2019-11-15 22:44:57,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:57,766 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:57,766 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash 870770276, now seen corresponding path program 1 times [2019-11-15 22:44:57,767 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:57,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925340525] [2019-11-15 22:44:57,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:57,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:57,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-11-15 22:44:58,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925340525] [2019-11-15 22:44:58,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:58,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:44:58,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278358763] [2019-11-15 22:44:58,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:58,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:58,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:58,857 INFO L87 Difference]: Start difference. First operand 4632 states and 4894 transitions. Second operand 4 states. [2019-11-15 22:44:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:59,779 INFO L93 Difference]: Finished difference Result 9262 states and 9793 transitions. [2019-11-15 22:44:59,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:59,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1007 [2019-11-15 22:44:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:59,791 INFO L225 Difference]: With dead ends: 9262 [2019-11-15 22:44:59,791 INFO L226 Difference]: Without dead ends: 4810 [2019-11-15 22:44:59,796 INFO L600 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-15 22:44:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-11-15 22:44:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4454. [2019-11-15 22:44:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-15 22:44:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4654 transitions. [2019-11-15 22:44:59,869 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4654 transitions. Word has length 1007 [2019-11-15 22:44:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:59,870 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4654 transitions. [2019-11-15 22:44:59,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4654 transitions. [2019-11-15 22:44:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-11-15 22:44:59,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:59,886 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:59,886 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -730527857, now seen corresponding path program 1 times [2019-11-15 22:44:59,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:59,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422772984] [2019-11-15 22:44:59,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:59,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:59,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3487 backedges. 883 proven. 0 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2019-11-15 22:45:01,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422772984] [2019-11-15 22:45:01,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:45:01,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:45:01,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970819039] [2019-11-15 22:45:01,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:45:01,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:01,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:01,590 INFO L87 Difference]: Start difference. First operand 4454 states and 4654 transitions. Second operand 4 states. [2019-11-15 22:45:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:02,402 INFO L93 Difference]: Finished difference Result 8750 states and 9149 transitions. [2019-11-15 22:45:02,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:02,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1032 [2019-11-15 22:45:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:45:02,412 INFO L225 Difference]: With dead ends: 8750 [2019-11-15 22:45:02,412 INFO L226 Difference]: Without dead ends: 4454 [2019-11-15 22:45:02,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-11-15 22:45:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2019-11-15 22:45:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-15 22:45:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4650 transitions. [2019-11-15 22:45:02,487 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4650 transitions. Word has length 1032 [2019-11-15 22:45:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:45:02,488 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4650 transitions. [2019-11-15 22:45:02,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:45:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4650 transitions. [2019-11-15 22:45:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2019-11-15 22:45:02,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:45:02,505 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:02,505 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:45:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1412080206, now seen corresponding path program 1 times [2019-11-15 22:45:02,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:02,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303689625] [2019-11-15 22:45:02,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:02,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:02,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3539 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 2648 trivial. 0 not checked. [2019-11-15 22:45:03,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303689625] [2019-11-15 22:45:03,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:45:03,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:45:03,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156159301] [2019-11-15 22:45:03,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:45:03,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:03,756 INFO L87 Difference]: Start difference. First operand 4454 states and 4650 transitions. Second operand 4 states. [2019-11-15 22:45:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:04,617 INFO L93 Difference]: Finished difference Result 8906 states and 9298 transitions. [2019-11-15 22:45:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:04,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1046 [2019-11-15 22:45:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:45:04,630 INFO L225 Difference]: With dead ends: 8906 [2019-11-15 22:45:04,630 INFO L226 Difference]: Without dead ends: 4632 [2019-11-15 22:45:04,635 INFO L600 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-15 22:45:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-15 22:45:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2019-11-15 22:45:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-11-15 22:45:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4443 transitions. [2019-11-15 22:45:04,711 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4443 transitions. Word has length 1046 [2019-11-15 22:45:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:45:04,713 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4443 transitions. [2019-11-15 22:45:04,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:45:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4443 transitions. [2019-11-15 22:45:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1056 [2019-11-15 22:45:04,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:45:04,730 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:04,730 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:45:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:04,731 INFO L82 PathProgramCache]: Analyzing trace with hash -166325796, now seen corresponding path program 1 times [2019-11-15 22:45:04,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:04,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120030528] [2019-11-15 22:45:04,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:04,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:04,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 1603 proven. 6 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-15 22:45:06,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120030528] [2019-11-15 22:45:06,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804501668] [2019-11-15 22:45:06,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/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-15 22:45:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:06,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:45:06,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3557 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-11-15 22:45:08,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:45:08,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 22:45:08,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811222333] [2019-11-15 22:45:08,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:45:08,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:08,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:08,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:45:08,083 INFO L87 Difference]: Start difference. First operand 4276 states and 4443 transitions. Second operand 4 states. [2019-11-15 22:45:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:08,959 INFO L93 Difference]: Finished difference Result 8728 states and 9105 transitions. [2019-11-15 22:45:08,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:08,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1055 [2019-11-15 22:45:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:45:08,964 INFO L225 Difference]: With dead ends: 8728 [2019-11-15 22:45:08,964 INFO L226 Difference]: Without dead ends: 4632 [2019-11-15 22:45:08,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 1055 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:45:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-15 22:45:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2019-11-15 22:45:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-15 22:45:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4625 transitions. [2019-11-15 22:45:09,039 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4625 transitions. Word has length 1055 [2019-11-15 22:45:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:45:09,041 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4625 transitions. [2019-11-15 22:45:09,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:45:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4625 transitions. [2019-11-15 22:45:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2019-11-15 22:45:09,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:45:09,060 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:45:09,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:45:09,268 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:45:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash 199964749, now seen corresponding path program 1 times [2019-11-15 22:45:09,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:09,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700279055] [2019-11-15 22:45:09,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:09,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:09,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3659 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 3390 trivial. 0 not checked. [2019-11-15 22:45:10,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700279055] [2019-11-15 22:45:10,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:45:10,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:45:10,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550175662] [2019-11-15 22:45:10,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:45:10,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:10,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:10,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:10,525 INFO L87 Difference]: Start difference. First operand 4454 states and 4625 transitions. Second operand 4 states. [2019-11-15 22:45:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:11,520 INFO L93 Difference]: Finished difference Result 9972 states and 10351 transitions. [2019-11-15 22:45:11,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:11,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1108 [2019-11-15 22:45:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:45:11,521 INFO L225 Difference]: With dead ends: 9972 [2019-11-15 22:45:11,522 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:45:11,528 INFO L600 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-15 22:45:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:45:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:45:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:45:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:45:11,529 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1108 [2019-11-15 22:45:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:45:11,529 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:45:11,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:45:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:45:11,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:45:11,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:45:12,048 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 194 [2019-11-15 22:45:12,444 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 192 [2019-11-15 22:45:13,450 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 182 DAG size of output: 51 [2019-11-15 22:45:14,418 WARN L191 SmtUtils]: Spent 966.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 51 [2019-11-15 22:45:14,421 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 22:45:14,422 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 22:45:14,423 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 22:45:14,424 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 22:45:14,425 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 22:45:14,426 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 22:45:14,427 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 22:45:14,428 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 22:45:14,429 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 22:45:14,429 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 22:45:14,430 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 22:45:14,430 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 22:45:14,430 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 22:45:14,430 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,430 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,430 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,431 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 22:45:14,431 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 22:45:14,431 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 22:45:14,431 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 22:45:14,431 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 22:45:14,431 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 22:45:14,431 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 22:45:14,432 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 22:45:14,432 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,432 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,432 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,432 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 22:45:14,432 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 22:45:14,433 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:45:14,433 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 22:45:14,433 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 22:45:14,433 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 22:45:14,433 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 22:45:14,433 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 22:45:14,433 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 22:45:14,434 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,434 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,434 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,434 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 22:45:14,434 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 22:45:14,434 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 22:45:14,435 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 22:45:14,435 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 22:45:14,435 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 22:45:14,435 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 22:45:14,435 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 22:45:14,435 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,436 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,436 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,436 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 22:45:14,436 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 22:45:14,436 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 22:45:14,436 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 22:45:14,437 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 22:45:14,437 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 22:45:14,437 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:45:14,437 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 22:45:14,437 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 22:45:14,437 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,437 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,438 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,438 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 22:45:14,438 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 22:45:14,438 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 22:45:14,439 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 22:45:14,439 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 22:45:14,439 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 22:45:14,439 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 22:45:14,439 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 22:45:14,439 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,440 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,440 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,440 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 22:45:14,440 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 22:45:14,440 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 22:45:14,440 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 22:45:14,440 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 22:45:14,441 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 22:45:14,441 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 22:45:14,441 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 22:45:14,441 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,441 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,441 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 22:45:14,442 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 22:45:14,442 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 22:45:14,442 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-15 22:45:14,442 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 22:45:14,442 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 22:45:14,443 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 22:45:14,443 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 22:45:14,443 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 22:45:14,443 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,443 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,443 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 22:45:14,443 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 22:45:14,444 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 22:45:14,444 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 22:45:14,444 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 22:45:14,444 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 22:45:14,444 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,444 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,447 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse7 (= 10 ~a21~0))) (let ((.cse1 (not .cse7)) (.cse4 (<= ~a15~0 8)) (.cse3 (not (= 6 ~a15~0))) (.cse6 (<= 8 ~a15~0)) (.cse0 (= ~a24~0 1)) (.cse2 (<= 0 (+ ~a12~0 41)))) (or (and (= 7 ~a15~0) .cse0) (and (= ~a21~0 6) .cse0 (= ~a15~0 5)) (and .cse1 .cse0 .cse2) (and (= 8 ~a21~0) .cse0 .cse3) (and (and .cse4 (let ((.cse5 (<= (+ ~a12~0 49) 0))) (or (and .cse1 .cse5) (and .cse6 .cse5)))) .cse3) (and (and .cse0 .cse4) (= ~a21~0 9)) (and (and .cse0 .cse7 .cse3) (< 0 (+ ~a12~0 43))) (and .cse6 .cse0 .cse7) (and .cse0 (<= ~a12~0 11) .cse2)))) [2019-11-15 22:45:14,447 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 22:45:14,447 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 22:45:14,447 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 22:45:14,447 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 22:45:14,448 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 22:45:14,448 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 22:45:14,448 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 22:45:14,448 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 22:45:14,448 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,448 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,449 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 22:45:14,449 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 22:45:14,449 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 22:45:14,449 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 22:45:14,449 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 22:45:14,449 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 22:45:14,450 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 22:45:14,450 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 22:45:14,450 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,450 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,450 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 22:45:14,450 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 22:45:14,450 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 22:45:14,451 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 22:45:14,451 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:45:14,451 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 22:45:14,451 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 22:45:14,451 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,451 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,452 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 22:45:14,452 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,452 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 22:45:14,452 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse7 (= 10 ~a21~0))) (let ((.cse1 (not .cse7)) (.cse4 (<= ~a15~0 8)) (.cse3 (not (= 6 ~a15~0))) (.cse6 (<= 8 ~a15~0)) (.cse0 (= ~a24~0 1)) (.cse2 (<= 0 (+ ~a12~0 41)))) (or (and (= 7 ~a15~0) .cse0) (and (= ~a21~0 6) .cse0 (= ~a15~0 5)) (and .cse1 .cse0 .cse2) (and (= 8 ~a21~0) .cse0 .cse3) (and (and .cse4 (let ((.cse5 (<= (+ ~a12~0 49) 0))) (or (and .cse1 .cse5) (and .cse6 .cse5)))) .cse3) (and (and .cse0 .cse4) (= ~a21~0 9)) (and (and .cse0 .cse7 .cse3) (< 0 (+ ~a12~0 43))) (and .cse6 .cse0 .cse7) (and .cse0 (<= ~a12~0 11) .cse2)))) [2019-11-15 22:45:14,452 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 22:45:14,453 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 22:45:14,453 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 22:45:14,453 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 22:45:14,453 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 22:45:14,453 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 22:45:14,453 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 22:45:14,454 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 22:45:14,454 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 22:45:14,454 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,454 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,454 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,454 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 22:45:14,455 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 22:45:14,455 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 22:45:14,455 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 22:45:14,455 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 22:45:14,455 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 22:45:14,455 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 22:45:14,455 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 22:45:14,456 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 22:45:14,456 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,456 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,456 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,456 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 22:45:14,456 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 22:45:14,457 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 22:45:14,457 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 22:45:14,457 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:45:14,457 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 22:45:14,457 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 22:45:14,457 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 22:45:14,458 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 22:45:14,458 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,458 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,458 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,458 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 22:45:14,458 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 22:45:14,459 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 22:45:14,459 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 22:45:14,459 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 22:45:14,459 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 22:45:14,459 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 22:45:14,459 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 22:45:14,460 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 22:45:14,460 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,460 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,460 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 22:45:14,460 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 22:45:14,460 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 22:45:14,461 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 22:45:14,461 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 22:45:14,461 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 22:45:14,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:45:14 BoogieIcfgContainer [2019-11-15 22:45:14,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:45:14,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:45:14,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:45:14,493 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:45:14,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:44:21" (3/4) ... [2019-11-15 22:45:14,497 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:45:14,544 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 22:45:14,546 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:45:14,754 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a5150ad2-1aaa-4cab-87cb-9f09ce61703d/bin/uautomizer/witness.graphml [2019-11-15 22:45:14,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:45:14,756 INFO L168 Benchmark]: Toolchain (without parser) took 56771.45 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 944.7 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-15 22:45:14,757 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:45:14,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 939.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:14,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.22 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:14,758 INFO L168 Benchmark]: Boogie Preprocessor took 150.84 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:14,759 INFO L168 Benchmark]: RCFGBuilder took 1895.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:14,759 INFO L168 Benchmark]: TraceAbstraction took 53370.39 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 970.0 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 22:45:14,760 INFO L168 Benchmark]: Witness Printer took 262.34 ms. Allocated memory is still 3.7 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:14,762 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 939.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 147.22 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 150.84 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1895.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 130.1 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53370.39 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 970.0 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 262.34 ms. Allocated memory is still 3.7 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 100]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((7 == a15 && a24 == 1) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((!(10 == a21) && a24 == 1) && 0 <= a12 + 41)) || ((8 == a21 && a24 == 1) && !(6 == a15))) || ((a15 <= 8 && ((!(10 == a21) && a12 + 49 <= 0) || (8 <= a15 && a12 + 49 <= 0))) && !(6 == a15))) || ((a24 == 1 && a15 <= 8) && a21 == 9)) || (((a24 == 1 && 10 == a21) && !(6 == a15)) && 0 < a12 + 43)) || ((8 <= a15 && a24 == 1) && 10 == a21)) || ((a24 == 1 && a12 <= 11) && 0 <= a12 + 41) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((7 == a15 && a24 == 1) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((!(10 == a21) && a24 == 1) && 0 <= a12 + 41)) || ((8 == a21 && a24 == 1) && !(6 == a15))) || ((a15 <= 8 && ((!(10 == a21) && a12 + 49 <= 0) || (8 <= a15 && a12 + 49 <= 0))) && !(6 == a15))) || ((a24 == 1 && a15 <= 8) && a21 == 9)) || (((a24 == 1 && 10 == a21) && !(6 == a15)) && 0 < a12 + 43)) || ((8 <= a15 && a24 == 1) && 10 == a21)) || ((a24 == 1 && a12 <= 11) && 0 <= a12 + 41) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 53.2s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, HoareTripleCheckerStatistics: 722 SDtfs, 4832 SDslu, 234 SDs, 0 SdLazy, 16343 SolverSat, 1773 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2939 GetRequests, 2852 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 6570 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 96 NumberOfFragments, 243 HoareAnnotationTreeSize, 3 FomulaSimplifications, 80262 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 34142 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 14186 NumberOfCodeBlocks, 14186 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14162 ConstructedInterpolants, 0 QuantifiedInterpolants, 34634166 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3603 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 24 InterpolantComputations, 16 PerfectInterpolantSequences, 35339/35651 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...