./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/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 e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 06:46:03,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:46:03,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:46:03,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:46:03,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:46:03,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:46:03,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:46:03,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:46:03,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:46:03,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:46:03,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:46:03,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:46:03,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:46:03,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:46:03,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:46:03,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:46:03,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:46:03,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:46:03,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:46:03,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:46:03,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:46:03,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:46:03,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:46:03,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:46:03,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:46:03,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:46:03,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:46:03,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:46:03,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:46:03,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:46:03,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:46:03,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:46:03,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:46:03,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:46:03,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:46:03,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:46:03,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:46:03,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:46:03,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:46:03,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:46:03,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:46:03,103 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 06:46:03,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:46:03,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:46:03,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:46:03,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:46:03,120 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:46:03,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:46:03,121 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:46:03,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:46:03,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:46:03,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:46:03,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:46:03,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:46:03,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:46:03,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:46:03,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:46:03,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:46:03,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:46:03,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:46:03,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:46:03,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:46:03,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:46:03,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:46:03,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:46:03,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:46:03,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:46:03,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:46:03,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:46:03,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:46:03,127 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_69e5b43d-e065-46c8-8f5e-61c435b00c3e/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 -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2019-11-20 06:46:03,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:46:03,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:46:03,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:46:03,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:46:03,333 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:46:03,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-20 06:46:03,396 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/data/7ba1f0254/9dac82799ead4ecdab62bf618dcb0e72/FLAG2e85dfb45 [2019-11-20 06:46:03,785 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:46:03,786 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-20 06:46:03,795 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/data/7ba1f0254/9dac82799ead4ecdab62bf618dcb0e72/FLAG2e85dfb45 [2019-11-20 06:46:04,156 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/data/7ba1f0254/9dac82799ead4ecdab62bf618dcb0e72 [2019-11-20 06:46:04,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:46:04,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:46:04,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:46:04,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:46:04,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:46:04,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@185fc65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04, skipping insertion in model container [2019-11-20 06:46:04,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,179 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:46:04,228 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:46:04,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:46:04,541 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:46:04,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:46:04,589 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:46:04,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04 WrapperNode [2019-11-20 06:46:04,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:46:04,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:46:04,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:46:04,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:46:04,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:46:04,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:46:04,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:46:04,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:46:04,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... [2019-11-20 06:46:04,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:46:04,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:46:04,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:46:04,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:46:04,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:46:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:46:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:46:05,256 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:46:05,256 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 06:46:05,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:46:05 BoogieIcfgContainer [2019-11-20 06:46:05,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:46:05,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:46:05,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:46:05,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:46:05,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:46:04" (1/3) ... [2019-11-20 06:46:05,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5531c56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:46:05, skipping insertion in model container [2019-11-20 06:46:05,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:46:04" (2/3) ... [2019-11-20 06:46:05,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5531c56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:46:05, skipping insertion in model container [2019-11-20 06:46:05,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:46:05" (3/3) ... [2019-11-20 06:46:05,266 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-20 06:46:05,275 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:46:05,281 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-20 06:46:05,292 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-20 06:46:05,315 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:46:05,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:46:05,316 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:46:05,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:46:05,316 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:46:05,316 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:46:05,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:46:05,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:46:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-20 06:46:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 06:46:05,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:05,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:05,342 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2019-11-20 06:46:05,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:05,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267842128] [2019-11-20 06:46:05,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:05,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267842128] [2019-11-20 06:46:05,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:05,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:05,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888522410] [2019-11-20 06:46:05,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:05,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:05,541 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2019-11-20 06:46:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:05,595 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2019-11-20 06:46:05,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:05,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 06:46:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:05,606 INFO L225 Difference]: With dead ends: 88 [2019-11-20 06:46:05,606 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 06:46:05,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 06:46:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-20 06:46:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 06:46:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-20 06:46:05,642 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2019-11-20 06:46:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:05,642 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-20 06:46:05,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-20 06:46:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 06:46:05,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:05,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:05,644 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:05,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:05,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2019-11-20 06:46:05,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:05,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087938012] [2019-11-20 06:46:05,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:05,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087938012] [2019-11-20 06:46:05,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:05,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 06:46:05,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711092805] [2019-11-20 06:46:05,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 06:46:05,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:05,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 06:46:05,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:46:05,724 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-11-20 06:46:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:05,833 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-20 06:46:05,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:05,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 06:46:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:05,836 INFO L225 Difference]: With dead ends: 76 [2019-11-20 06:46:05,836 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 06:46:05,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:46:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 06:46:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-20 06:46:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 06:46:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-20 06:46:05,846 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2019-11-20 06:46:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:05,846 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-20 06:46:05,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 06:46:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-20 06:46:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 06:46:05,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:05,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:05,848 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2019-11-20 06:46:05,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:05,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749537501] [2019-11-20 06:46:05,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:05,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749537501] [2019-11-20 06:46:05,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:05,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:46:05,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903246671] [2019-11-20 06:46:05,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:05,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:46:05,907 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2019-11-20 06:46:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:05,992 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-20 06:46:05,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:05,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 06:46:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:05,994 INFO L225 Difference]: With dead ends: 97 [2019-11-20 06:46:05,994 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 06:46:05,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 06:46:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2019-11-20 06:46:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 06:46:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-11-20 06:46:06,003 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2019-11-20 06:46:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:06,003 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-11-20 06:46:06,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-11-20 06:46:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 06:46:06,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:06,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:06,005 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2019-11-20 06:46:06,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:06,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206430748] [2019-11-20 06:46:06,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:06,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206430748] [2019-11-20 06:46:06,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:06,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:06,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019832819] [2019-11-20 06:46:06,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:06,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:06,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:06,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:06,069 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2019-11-20 06:46:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:06,155 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-11-20 06:46:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:06,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 06:46:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:06,157 INFO L225 Difference]: With dead ends: 72 [2019-11-20 06:46:06,157 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 06:46:06,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 06:46:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-20 06:46:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-20 06:46:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-20 06:46:06,164 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2019-11-20 06:46:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:06,164 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-20 06:46:06,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-20 06:46:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:46:06,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:06,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:06,166 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2019-11-20 06:46:06,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:06,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530633890] [2019-11-20 06:46:06,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:06,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530633890] [2019-11-20 06:46:06,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:06,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:06,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975948148] [2019-11-20 06:46:06,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:06,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:06,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:06,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:06,237 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-11-20 06:46:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:06,423 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-20 06:46:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:46:06,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 06:46:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:06,425 INFO L225 Difference]: With dead ends: 137 [2019-11-20 06:46:06,425 INFO L226 Difference]: Without dead ends: 135 [2019-11-20 06:46:06,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:46:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-20 06:46:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2019-11-20 06:46:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-20 06:46:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-20 06:46:06,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2019-11-20 06:46:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:06,442 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-20 06:46:06,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-20 06:46:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:46:06,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:06,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:06,444 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2019-11-20 06:46:06,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:06,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32234159] [2019-11-20 06:46:06,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:06,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32234159] [2019-11-20 06:46:06,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:06,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:06,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369990700] [2019-11-20 06:46:06,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:06,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:06,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:06,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:06,545 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-20 06:46:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:06,690 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-20 06:46:06,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:46:06,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-20 06:46:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:06,692 INFO L225 Difference]: With dead ends: 104 [2019-11-20 06:46:06,692 INFO L226 Difference]: Without dead ends: 102 [2019-11-20 06:46:06,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:46:06,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-20 06:46:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-11-20 06:46:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 06:46:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-20 06:46:06,700 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-11-20 06:46:06,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:06,700 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-20 06:46:06,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-20 06:46:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 06:46:06,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:06,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:06,705 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:06,709 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2019-11-20 06:46:06,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:06,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806422967] [2019-11-20 06:46:06,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:06,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806422967] [2019-11-20 06:46:06,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:06,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:06,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175958403] [2019-11-20 06:46:06,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:06,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:06,797 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2019-11-20 06:46:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:06,924 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-11-20 06:46:06,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:06,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-20 06:46:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:06,926 INFO L225 Difference]: With dead ends: 117 [2019-11-20 06:46:06,926 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 06:46:06,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 06:46:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2019-11-20 06:46:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-20 06:46:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-20 06:46:06,935 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2019-11-20 06:46:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:06,936 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-20 06:46:06,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-20 06:46:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 06:46:06,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:06,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:06,937 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:06,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2019-11-20 06:46:06,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:06,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6648269] [2019-11-20 06:46:06,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:06,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6648269] [2019-11-20 06:46:06,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:06,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:06,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604404239] [2019-11-20 06:46:06,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:06,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:07,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:07,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:07,000 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-20 06:46:07,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:07,115 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-20 06:46:07,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:07,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-20 06:46:07,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:07,117 INFO L225 Difference]: With dead ends: 73 [2019-11-20 06:46:07,117 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 06:46:07,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 06:46:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-20 06:46:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 06:46:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-11-20 06:46:07,124 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2019-11-20 06:46:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:07,125 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-11-20 06:46:07,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-11-20 06:46:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 06:46:07,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:07,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:07,127 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:07,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:07,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2019-11-20 06:46:07,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:07,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649027488] [2019-11-20 06:46:07,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:07,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649027488] [2019-11-20 06:46:07,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:07,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:46:07,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695351840] [2019-11-20 06:46:07,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:46:07,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:07,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:46:07,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:07,167 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2019-11-20 06:46:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:07,215 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-20 06:46:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:46:07,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 06:46:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:07,217 INFO L225 Difference]: With dead ends: 111 [2019-11-20 06:46:07,217 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 06:46:07,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:46:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 06:46:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-20 06:46:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 06:46:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-20 06:46:07,224 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-11-20 06:46:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:07,235 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-20 06:46:07,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:46:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-20 06:46:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 06:46:07,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:07,236 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:07,236 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:07,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:07,237 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2019-11-20 06:46:07,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:07,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376067633] [2019-11-20 06:46:07,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:46:07,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376067633] [2019-11-20 06:46:07,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979862597] [2019-11-20 06:46:07,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:07,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 06:46:07,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:07,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:46:07,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:46:07,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-20 06:46:07,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880567564] [2019-11-20 06:46:07,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 06:46:07,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 06:46:07,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:07,434 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 7 states. [2019-11-20 06:46:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:07,566 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-11-20 06:46:07,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:07,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-20 06:46:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:07,567 INFO L225 Difference]: With dead ends: 111 [2019-11-20 06:46:07,567 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 06:46:07,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:46:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 06:46:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2019-11-20 06:46:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 06:46:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-20 06:46:07,573 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-20 06:46:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:07,573 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-20 06:46:07,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 06:46:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-20 06:46:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 06:46:07,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:07,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:07,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:07,775 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:07,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2019-11-20 06:46:07,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:07,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694984242] [2019-11-20 06:46:07,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:07,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694984242] [2019-11-20 06:46:07,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:07,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:07,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280278614] [2019-11-20 06:46:07,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:07,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:07,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:07,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:07,831 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2019-11-20 06:46:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:07,904 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-20 06:46:07,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:07,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-20 06:46:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:07,905 INFO L225 Difference]: With dead ends: 69 [2019-11-20 06:46:07,905 INFO L226 Difference]: Without dead ends: 67 [2019-11-20 06:46:07,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-20 06:46:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-20 06:46:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-20 06:46:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-11-20 06:46:07,910 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2019-11-20 06:46:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:07,910 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-11-20 06:46:07,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-11-20 06:46:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 06:46:07,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:07,911 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:07,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2019-11-20 06:46:07,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:07,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917372381] [2019-11-20 06:46:07,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:46:07,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917372381] [2019-11-20 06:46:07,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112409916] [2019-11-20 06:46:07,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:08,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 06:46:08,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:08,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 06:46:08,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:46:08,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-20 06:46:08,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351434136] [2019-11-20 06:46:08,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 06:46:08,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:08,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 06:46:08,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:08,083 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 7 states. [2019-11-20 06:46:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:08,192 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-20 06:46:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:08,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-20 06:46:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:08,193 INFO L225 Difference]: With dead ends: 67 [2019-11-20 06:46:08,194 INFO L226 Difference]: Without dead ends: 65 [2019-11-20 06:46:08,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:46:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-20 06:46:08,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-11-20 06:46:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 06:46:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-20 06:46:08,198 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-11-20 06:46:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:08,198 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-20 06:46:08,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 06:46:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-20 06:46:08,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 06:46:08,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:08,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:08,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:08,403 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2019-11-20 06:46:08,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:08,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809060775] [2019-11-20 06:46:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:08,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809060775] [2019-11-20 06:46:08,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:08,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:08,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480134715] [2019-11-20 06:46:08,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:08,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:08,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:08,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:08,449 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2019-11-20 06:46:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:08,516 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-20 06:46:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:08,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-20 06:46:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:08,518 INFO L225 Difference]: With dead ends: 60 [2019-11-20 06:46:08,518 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 06:46:08,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 06:46:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-20 06:46:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 06:46:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-20 06:46:08,522 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2019-11-20 06:46:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:08,522 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-20 06:46:08,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-20 06:46:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 06:46:08,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:08,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:08,523 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:08,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:08,524 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2019-11-20 06:46:08,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:08,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179853250] [2019-11-20 06:46:08,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:08,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179853250] [2019-11-20 06:46:08,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:08,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:08,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788725436] [2019-11-20 06:46:08,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:08,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:08,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:08,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:08,587 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-11-20 06:46:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:08,652 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-20 06:46:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:08,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-20 06:46:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:08,654 INFO L225 Difference]: With dead ends: 59 [2019-11-20 06:46:08,654 INFO L226 Difference]: Without dead ends: 57 [2019-11-20 06:46:08,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-20 06:46:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-20 06:46:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-20 06:46:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-11-20 06:46:08,658 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2019-11-20 06:46:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:08,658 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-11-20 06:46:08,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-11-20 06:46:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 06:46:08,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:08,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:08,659 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2019-11-20 06:46:08,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:08,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835077056] [2019-11-20 06:46:08,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:08,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835077056] [2019-11-20 06:46:08,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:08,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 06:46:08,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903607919] [2019-11-20 06:46:08,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 06:46:08,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 06:46:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:46:08,723 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2019-11-20 06:46:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:08,824 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-20 06:46:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:08,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-20 06:46:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:08,825 INFO L225 Difference]: With dead ends: 67 [2019-11-20 06:46:08,826 INFO L226 Difference]: Without dead ends: 65 [2019-11-20 06:46:08,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-20 06:46:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-20 06:46:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-11-20 06:46:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-20 06:46:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-20 06:46:08,833 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2019-11-20 06:46:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:08,833 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-20 06:46:08,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 06:46:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-20 06:46:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 06:46:08,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:08,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:08,835 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:08,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:08,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2019-11-20 06:46:08,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:08,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348561634] [2019-11-20 06:46:08,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:08,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348561634] [2019-11-20 06:46:08,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:08,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:08,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175608423] [2019-11-20 06:46:08,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:08,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:08,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:08,891 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2019-11-20 06:46:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:09,020 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-20 06:46:09,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:46:09,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-20 06:46:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:09,021 INFO L225 Difference]: With dead ends: 87 [2019-11-20 06:46:09,021 INFO L226 Difference]: Without dead ends: 85 [2019-11-20 06:46:09,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-20 06:46:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-11-20 06:46:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-20 06:46:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-20 06:46:09,026 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-11-20 06:46:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-20 06:46:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-20 06:46:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 06:46:09,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:09,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:09,027 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2019-11-20 06:46:09,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:09,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402538029] [2019-11-20 06:46:09,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:09,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402538029] [2019-11-20 06:46:09,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:09,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:09,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336429514] [2019-11-20 06:46:09,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:09,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:09,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:09,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:09,080 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-11-20 06:46:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:09,175 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-20 06:46:09,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:09,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-20 06:46:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:09,176 INFO L225 Difference]: With dead ends: 57 [2019-11-20 06:46:09,176 INFO L226 Difference]: Without dead ends: 55 [2019-11-20 06:46:09,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-20 06:46:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-20 06:46:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-20 06:46:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-20 06:46:09,180 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2019-11-20 06:46:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:09,181 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-20 06:46:09,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-20 06:46:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 06:46:09,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:09,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:09,182 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:09,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2019-11-20 06:46:09,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:09,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639708216] [2019-11-20 06:46:09,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:09,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639708216] [2019-11-20 06:46:09,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:09,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:09,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835945370] [2019-11-20 06:46:09,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:09,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:09,226 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2019-11-20 06:46:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:09,246 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-20 06:46:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:09,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-20 06:46:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:09,247 INFO L225 Difference]: With dead ends: 66 [2019-11-20 06:46:09,247 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 06:46:09,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 06:46:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-20 06:46:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-20 06:46:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-20 06:46:09,252 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 37 [2019-11-20 06:46:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:09,252 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-20 06:46:09,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-20 06:46:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 06:46:09,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:09,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:09,253 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2019-11-20 06:46:09,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:09,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106008844] [2019-11-20 06:46:09,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:09,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106008844] [2019-11-20 06:46:09,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:09,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:09,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427917493] [2019-11-20 06:46:09,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:09,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:09,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:09,326 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-20 06:46:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:09,356 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-20 06:46:09,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:09,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-20 06:46:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:09,357 INFO L225 Difference]: With dead ends: 64 [2019-11-20 06:46:09,357 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 06:46:09,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:46:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 06:46:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-20 06:46:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 06:46:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-20 06:46:09,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2019-11-20 06:46:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:09,362 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-20 06:46:09,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-20 06:46:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 06:46:09,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:09,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:09,363 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2019-11-20 06:46:09,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:09,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682965349] [2019-11-20 06:46:09,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:09,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682965349] [2019-11-20 06:46:09,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:09,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:09,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186624475] [2019-11-20 06:46:09,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:09,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:09,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:09,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:09,419 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-20 06:46:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:09,553 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-11-20 06:46:09,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 06:46:09,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-20 06:46:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:09,554 INFO L225 Difference]: With dead ends: 86 [2019-11-20 06:46:09,554 INFO L226 Difference]: Without dead ends: 84 [2019-11-20 06:46:09,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-20 06:46:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2019-11-20 06:46:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 06:46:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-11-20 06:46:09,559 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 39 [2019-11-20 06:46:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:09,560 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-11-20 06:46:09,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-11-20 06:46:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 06:46:09,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:09,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:09,561 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2019-11-20 06:46:09,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:09,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882155149] [2019-11-20 06:46:09,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:09,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882155149] [2019-11-20 06:46:09,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:09,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:09,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124787180] [2019-11-20 06:46:09,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:09,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:09,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:09,602 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 5 states. [2019-11-20 06:46:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:09,699 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-20 06:46:09,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:09,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-20 06:46:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:09,701 INFO L225 Difference]: With dead ends: 71 [2019-11-20 06:46:09,701 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 06:46:09,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 06:46:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-20 06:46:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 06:46:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-20 06:46:09,706 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2019-11-20 06:46:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:09,706 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-20 06:46:09,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-20 06:46:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 06:46:09,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:09,707 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:09,708 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:09,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:09,708 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2019-11-20 06:46:09,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:09,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123488509] [2019-11-20 06:46:09,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:09,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123488509] [2019-11-20 06:46:09,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859970374] [2019-11-20 06:46:09,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:09,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 06:46:09,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:09,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:09,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 06:46:09,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-20 06:46:09,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568022205] [2019-11-20 06:46:09,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 06:46:09,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 06:46:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:46:09,935 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2019-11-20 06:46:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:10,094 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-11-20 06:46:10,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:46:10,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-20 06:46:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:10,097 INFO L225 Difference]: With dead ends: 64 [2019-11-20 06:46:10,097 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 06:46:10,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:46:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 06:46:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-20 06:46:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 06:46:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-20 06:46:10,102 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 40 [2019-11-20 06:46:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:10,102 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-20 06:46:10,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 06:46:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-20 06:46:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 06:46:10,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:10,103 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:10,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:10,304 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:10,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2019-11-20 06:46:10,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:10,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811649775] [2019-11-20 06:46:10,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 06:46:10,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811649775] [2019-11-20 06:46:10,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:10,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 06:46:10,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273563589] [2019-11-20 06:46:10,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 06:46:10,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:10,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 06:46:10,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 06:46:10,348 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2019-11-20 06:46:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:10,484 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-20 06:46:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 06:46:10,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-20 06:46:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:10,486 INFO L225 Difference]: With dead ends: 73 [2019-11-20 06:46:10,486 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 06:46:10,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:46:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 06:46:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-11-20 06:46:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 06:46:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-11-20 06:46:10,491 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 45 [2019-11-20 06:46:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:10,492 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-11-20 06:46:10,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 06:46:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-11-20 06:46:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 06:46:10,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:10,493 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:10,494 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:10,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:10,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1932282916, now seen corresponding path program 1 times [2019-11-20 06:46:10,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:46:10,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488009842] [2019-11-20 06:46:10,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:46:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:10,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488009842] [2019-11-20 06:46:10,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867234739] [2019-11-20 06:46:10,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:10,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:46:10,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:10,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:46:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 06:46:10,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:46:10,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-20 06:46:10,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226654155] [2019-11-20 06:46:10,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:46:10,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:46:10,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:46:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 06:46:10,632 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2019-11-20 06:46:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:10,667 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-20 06:46:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 06:46:10,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-20 06:46:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:10,668 INFO L225 Difference]: With dead ends: 56 [2019-11-20 06:46:10,668 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 06:46:10,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:46:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 06:46:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 06:46:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 06:46:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 06:46:10,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-20 06:46:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:10,669 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 06:46:10,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:46:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 06:46:10,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 06:46:10,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:46:10,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 06:46:11,294 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-20 06:46:11,763 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-11-20 06:46:11,999 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-11-20 06:46:12,371 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-20 06:46:12,376 INFO L444 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-20 06:46:12,376 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-11-20 06:46:12,376 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 06:46:12,376 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-11-20 06:46:12,376 INFO L444 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-11-20 06:46:12,376 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-11-20 06:46:12,376 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-20 06:46:12,377 INFO L444 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L440 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) .cse1 .cse2 .cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16))))) [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-11-20 06:46:12,378 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L440 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse4 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse5 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse8 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse9 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse10 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse11 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse12 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse1 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0))) (or (and .cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse1 (and .cse2 .cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (and .cse2 .cse3 .cse0 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse1 .cse14 (= ULTIMATE.start_main_~main__c~0 0)))) [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L440 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-20 06:46:12,379 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L440 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7)) (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6)) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3) (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0))))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse5 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse6 (= ULTIMATE.start_main_~main__c~0 0))) (or (and .cse0 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse1 .cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse3 .cse4 .cse5) (and .cse2 (<= (+ ULTIMATE.start_main_~main__cp~0 2) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~8) .cse1 .cse4 .cse5 .cse6))) [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-11-20 06:46:12,380 INFO L447 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-11-20 06:46:12,381 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-20 06:46:12,382 INFO L440 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse1 (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (let ((.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (.cse4 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~16)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse2 .cse3 .cse4 .cse5 .cse6)))))) (or (and (and .cse0 .cse1) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (and (= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse0 .cse1))) [2019-11-20 06:46:12,382 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-11-20 06:46:12,382 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-11-20 06:46:12,382 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-11-20 06:46:12,382 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-11-20 06:46:12,382 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-11-20 06:46:12,382 INFO L444 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-11-20 06:46:12,382 INFO L444 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-11-20 06:46:12,382 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-11-20 06:46:12,383 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-11-20 06:46:12,383 INFO L444 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-11-20 06:46:12,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:46:12 BoogieIcfgContainer [2019-11-20 06:46:12,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:46:12,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:46:12,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:46:12,408 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:46:12,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:46:05" (3/4) ... [2019-11-20 06:46:12,412 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 06:46:12,426 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 06:46:12,426 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 06:46:12,501 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_69e5b43d-e065-46c8-8f5e-61c435b00c3e/bin/uautomizer/witness.graphml [2019-11-20 06:46:12,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:46:12,502 INFO L168 Benchmark]: Toolchain (without parser) took 8341.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -73.8 MB). Peak memory consumption was 203.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:46:12,503 INFO L168 Benchmark]: CDTParser took 0.18 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-20 06:46:12,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 06:46:12,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:46:12,504 INFO L168 Benchmark]: Boogie Preprocessor took 24.59 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 06:46:12,504 INFO L168 Benchmark]: RCFGBuilder took 601.52 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:46:12,504 INFO L168 Benchmark]: TraceAbstraction took 7148.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.1 MB). Peak memory consumption was 340.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:46:12,505 INFO L168 Benchmark]: Witness Printer took 93.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-20 06:46:12,506 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.18 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 425.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -195.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.59 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 601.52 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: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7148.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.1 MB). Peak memory consumption was 340.1 MB. Max. memory is 11.5 GB. * Witness Printer took 93.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (main__cp + 1 <= main__urilen && 1 == __VERIFIER_assert__cond) && (((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) || ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((1 == __VERIFIER_assert__cond && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && ((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) || ((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && main__c == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((1 == __VERIFIER_assert__cond && main__cp < main__urilen && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) || ((main__cp + 1 == main__urilen && 1 == __VERIFIER_assert__cond) && main__cp < main__urilen && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((1 == __VERIFIER_assert__cond && main__c + 2 <= main__tokenlen) && (!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && (1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && ((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) || ((((((((((1 == __VERIFIER_assert__cond && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && (!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && (1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && ((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) || ((((((1 <= main__cp && main__cp + 2 <= main__urilen) && 1 == __VERIFIER_assert__cond) && (!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && (1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && ((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Result: SAFE, OverallTime: 7.0s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 1307 SDtfs, 2367 SDslu, 1508 SDs, 0 SdLazy, 1173 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 179 SyntacticMatches, 15 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 291 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 526 HoareAnnotationTreeSize, 6 FomulaSimplifications, 50296 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4350 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 57314 SizeOfPredicates, 25 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 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...